( en | de | ru )

 

Disambiguierung von "Rote, Günter"

Autor der Publikation

copydeleteadd this publication to your clipboard
On the Union of Fat Wedges and Separating a Collection of Segments By a Line.

, , and . Comput. Geom., (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Meike Rotermund

Josef Roters

Franz Rotering

Helene Rotermund

Lothar Rotermund

 

Other publications of authors with the same name

A Visibility Representation for Graphs in Three Dimensions., , , , , , , , , and 1 other author(s). J. Graph Algorithms Appl., 2 (3): 1-16 (1998)Saturated simple and 2-simple topological graphs with few edges., , , and . J. Graph Algorithms Appl., 22 (1): 117-138 (2018)Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension., , , , and . ACM Trans. Algorithms, 7 (4): 43:1-43:27 (2011)Advantage in the discrete Voronoi game, , , , and . CoRR, (2013)λ > 4: an improved lower bound on the growth constant of polyominoes., , and . Commun. ACM, 59 (7): 88-95 (2016)Three-Clustering of Points in the Plane., and . ESA, volume 726 of Lecture Notes in Computer Science, page 192-199. Springer, (1993)The Largest Quadrilateral in a Convex Polygon.. CoRR, (2019)Monotone Paths in Planar Convex Subdivisions., , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 240-251. Springer, (2012)Approximation and Hardness of Token Swapping., , , , , and . ESA, volume 57 of LIPIcs, page 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Triangulations Intersect Nicely., , , , , , and . Discret. Comput. Geom., 16 (4): 339-359 (1996)