Author of the publication

Improved Time-Space Trade-Offs for Computing Voronoi Diagrams.

, , , , , , and . STACS, volume 66 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)

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.

 

Other publications of authors with the same name

Dynamic Graph Coloring., , , , , , and . Algorithmica, 81 (4): 1319-1341 (2019)Time-space trade-offs for triangulations and Voronoi diagrams., , , , , and . Comput. Geom., (2018)Routing in Polygons with Holes., , , , , , , and . CoRR, (2017)Kinetic Convex Hulls, Delaunay Triangulations and Connectivity Structures in the Black-Box Model., , and . JoCG, 3 (1): 222-249 (2012)Time-space trade-offs for triangulating a simple polygon., , , , and . JoCG, 8 (1): 105-124 (2017)Kinetic 2-centers in the black-box model., , and . Symposium on Computational Geometry, page 145-154. ACM, (2013)Packing Short Plane Spanning Trees in Complete Geometric Graphs., , , , , , , and . ISAAC, volume 64 of LIPIcs, page 9:1-9:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Balanced Line Separators of Unit Disk Graphs., , , , , , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 241-252. Springer, (2017)Point Location.. Encyclopedia of Algorithms, (2016)Hanabi is NP-hard, even for cheaters who look at their cards., , , , , , , and . Theor. Comput. Sci., (2017)