( en | de | ru )

 

Disambiguation of "van Renssen, André"

Author of the publication

copydeleteadd this publication to your clipboard
Routing in polygonal domains.

, , , , , , , , , and . Comput. Geom., (2020)

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.

Ernst-Christian André

Helmut André

Achim André

Karl Wilhelm Andrée

Emil Andrée

 

Other publications of authors with the same name

Constrained generalized Delaunay graphs are plane spanners., , and . Comput. Geom., (2018)Time-Space Trade-offs for Triangulating a Simple Polygon., , , , and . SWAT, volume 53 of LIPIcs, page 30:1-30:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The θ 5-Graph is a Spanner., , , and . WG, volume 8165 of Lecture Notes in Computer Science, page 100-114. Springer, (2013)Time-Space Trade-offs for Triangulations and Voronoi Diagrams., , , , , and . WADS, volume 9214 of Lecture Notes in Computer Science, page 482-494. Springer, (2015)Snipperclips: Cutting Tools into Desired Polygons using Themselves., , , , , , , , , and . CoRR, (2021)Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces., , , , , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 180-192. Springer, (2015)Geometry and Generation of a New Graph Planarity Game., , , and . J. Graph Algorithms Appl., 23 (4): 603-624 (2019)Towards Tight Bounds on Theta-Graphs., , , , and . CoRR, (2014)On the Spanning Ratio of Theta-Graphs., , and . WADS, volume 8037 of Lecture Notes in Computer Science, page 182-194. Springer, (2013)Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers., , , , , , , , , and 1 other author(s). ESA, volume 144 of LIPIcs, page 3:1-3:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)