( en | de | ru )

 

Disambiguation of "Rote, Günter"

Author of the publication

copydeleteadd this publication to your clipboard
The Obnoxious Center Problem on a Tree.

, , , and . SIAM J. Discret. Math., 14 (4): 498-509 (2001)

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

Johannes Roter

 

Other publications of authors with the same name

Crossing the Bridge at Night.. Bulletin of the EATCS, (2002)Advantage in the discrete Voronoi game, , , , and . CoRR, (2013)Convexifying Polygons Without Losing Visibilities., , , , , , , , , and 1 other author(s). CCCG, (2011)Quality Ratios of Measures for Graph Drawing Styles., , , and . CCCG, Carleton University, Ottawa, Canada, (2014)Convex hull alignment through translation., , , , and . CCCG, Carleton University, Ottawa, Canada, (2013)Triangulations Intersect Nicely., , , , , , and . Discret. Comput. Geom., 16 (4): 339-359 (1996)On the Parameterization and the Geometry of the Configuration Space of a Single Planar Robot., , and . Journal of WSCG, 21 (1): 11-20 (2013)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)Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs., and . Algorithmica, 84 (4): 1064-1080 (2022)