( en | de | ru )

 

Disambiguation of "van Renssen, André"

Author of the publication

copydeleteadd this publication to your clipboard
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.

, , , , , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 180-192. Springer, (2015)

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.

Karl Wilhelm Andrée

Emil Andrée

Gustav André

Michael André

Dieter André

 

Other publications of authors with the same name

Competitive Local Routing with Constraints., , , and . CoRR, (2014)On Kinetic Range Spaces and their Applications., , , , , and . CoRR, (2015)Constrained generalized Delaunay graphs are plane spanners., , and . Comput. Geom., (2018)Continuous Yao graphs., , , , , , , , , and . Comput. Geom., (2018)Hanabi is NP-hard, even for cheaters who look at their cards., , , , , , , and . Theor. Comput. Sci., (2017)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)Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points., , , , , and . Int. J. Comput. Geom. Appl., 29 (1): 49-72 (2019)