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

On universally easy classes for NP-complete problems., , and . SODA, page 910-911. ACM/SIAM, (2001)Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)., , , and . Dagstuhl Reports, 3 (3): 51-74 (2013)Optimal Covering Tours with Turn Costs., , , , , and . SIAM J. Comput., 35 (3): 531-566 (2005)Puzzles, Art, and Magic with Algorithms., and . Theory Comput. Syst., 39 (3): 473-481 (2006)Planning to fold multiple objects from a single self-folding sheet., , , and . Robotica, 29 (1): 87-102 (2011)Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm., , and . Graphs Comb., 30 (1): 125-140 (2014)Computational Geometry Column 37., and . Int. J. Comput. Geom. Appl., 10 (1): 103-107 (2000)Grid Vertex-Unfolding Orthostacks., , and . Int. J. Comput. Geom. Appl., 20 (3): 245-254 (2010)Path Puzzles: Discrete Tomography with a Path Constraint is Hard., , , , , and . Graphs Comb., 36 (2): 251-267 (2020)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , , , and . Theor. Comput. Sci., (2020)