( en | de | ru )

 

Disambiguation of "Rote, Günter"

Author of the publication

copydeleteadd this publication to your clipboard
Partitioning a Polygon into Two Mirror Congruent Pieces.

, , , and . CCCG, (2008)

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

Franz Rotering

Josef Roters

Helene Rotermund

Sigrid Rotering-Steinberg

 

Other publications of authors with the same name

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)The Zigzag Path of a Pseudo-Triangulation., , , and . WADS, volume 2748 of Lecture Notes in Computer Science, page 377-388. Springer, (2003)Three-Clustering of Points in the Plane., and . ESA, volume 726 of Lecture Notes in Computer Science, page 192-199. Springer, (1993)Crossing the Bridge at Night.. Bulletin of the EATCS, (2002)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)Computing the Fréchet distance between piecewise smooth curves.. Comput. Geom., 37 (3): 162-174 (2007)Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs., and . Algorithmica, 84 (4): 1064-1080 (2022)