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

Hamiltonicity is Hard in Thin or Polygonal Grid Graphs, but Easy in Thin Polygonal Grid Graphs., and . CoRR, (2017)Hardness of Token Swapping on Trees., , , , , , , , and . ESA, volume 244 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Tree-Residue Vertex-Breaking: a new tool for proving hardness., and . CoRR, (2017)Dissection with the Fewest Pieces is Hard, Even to Approximate., , , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 37-48. Springer, (2015)Circumscribing Polygons and Polygonizations for Disjoint Line Segments., , , , and . SoCG, volume 129 of LIPIcs, page 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Yin-Yang Puzzles are NP-complete., , , and . CCCG, page 97-106. (2021)Solving the Rubik's Cube Optimally is NP-complete., , and . CoRR, (2017)Tree-Residue Vertex-Breaking: a new tool for proving hardness., and . SWAT, volume 101 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Circumscribing Polygons and Polygonizations for Disjoint Line Segments., , , , , and . Discret. Comput. Geom., 68 (1): 218-254 (2022)Computational complexity of numberless Shakashaka., , , , and . CCCG, Queen's University, Ontario, Canada, (2015)