PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Demaine, Erik D."

Author of the publication

copydeleteadd this publication to your clipboard
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.

, , , , and . J. Comput. Syst. Sci., 69 (2): 166-195 (2004)

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.

Erik Eppinger University of Stuttgart

D. Marino

Dr. Erik Poloni University of Stuttgart

Erik Wimmer University of Stuttgart

D. Roth

 

Other publications of authors with the same name

Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm., , and . Graphs and Combinatorics, 30 (1): 125-140 (2014)(Non)Existence of Pleated Folds: How Paper Folds Between Creases., , , , and . Graphs and Combinatorics, 27 (3): 377-397 (2011)Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121)., , , and . Dagstuhl Reports, 3 (3): 51-74 (2013)Picture-Hanging Puzzles., , , , , and . Theory Comput. Syst., 54 (4): 531-550 (2014)Puzzles, Art, and Magic with Algorithms., and . Theory Comput. Syst., 39 (3): 473-481 (2006)Approximation algorithms for classes of graphs excluding single-crossing graphs as minors., , , , and . J. Comput. Syst. Sci., 69 (2): 166-195 (2004)The Bidimensional Theory of Bounded-Genus Graphs., , and . SIAM J. Discrete Math., 20 (2): 357-371 (2006)Computational Geometry Column 37., and . Int. J. Comput. Geometry Appl., 10 (1): 103-107 (2000)Unfolding some classes of orthogonal polyhedra., , , , , , , and . CCCG, (1998)On flat-state connectivity of chains with fixed acute angles., , , , , and . CCCG, page 27-30. (2002)