Author of the publication

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.

 

Other publications of authors with the same name

A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks., , , , , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 372-381. Springer, (2012)Laminar Structure of Ptolemaic Graphs and Its Applications., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 186-195. Springer, (2005)(Total) Vector Domination for Graphs with Bounded Branchwidth., , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 238-249. Springer, (2014)Efficient Algorithms for the Longest Path Problem., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 871-883. Springer, (2004)A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares., , , , , , and . SWAT, volume 7357 of Lecture Notes in Computer Science, page 24-35. Springer, (2012)Mining Preserving Structures in a Graph Sequence., and . COCOON, volume 9198 of Lecture Notes in Computer Science, page 3-15. Springer, (2015)Mining Preserving Structures in a Graph Sequence, and . CoRR, (2012)Subexponential fixed-parameter algorithms for partial vector domination., , and . Discret. Optim., (2016)A Linear Time Algorithm for L(2, 1)-Labeling of Trees., , , and . Algorithmica, 66 (3): 654-681 (2013)A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs., , , and . J. Discrete Algorithms, (2012)