Author of the publication

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

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards., , , , , , , and . FUN, volume 49 of LIPIcs, page 4:1-4:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Routing in polygonal domains., , , , , , , , , and . Comput. Geom., (2020)Rectilinear link diameter and radius in a rectilinear polygonal domain., , , , , , , and . Comput. Geom., (2021)On the Average Complexity of the k-Level., , , , , and . CoRR, (2019)Hanabi is NP-hard, even for cheaters who look at their cards., , , , , , , and . Theor. Comput. Sci., (2017)High Dimensional Consistent Digital Segments., and . SIAM J. Discret. Math., 32 (4): 2566-2590 (2018)Navigating Weighted Regions with Scattered Skinny Tetrahedra., , , and . Int. J. Comput. Geom. Appl., 27 (1-2): 13-32 (2017)Snipperclips: Cutting Tools into Desired Polygons using Themselves., , , , , , , , , and . CoRR, (2021)High Dimensional Consistent Digital Segments., and . CoRR, (2016)Computational Complexity of the α-Ham-Sandwich Problem., , and . ICALP, volume 168 of LIPIcs, page 31:1-31:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)