Author of the publication

On the Complexity of the Storyplan Problem.

, , , , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 304-318. Springer, (2022)

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

Proximity Drawings of Outerplanar Graphs., and . GD, volume 1190 of Lecture Notes in Computer Science, page 286-302. Springer, (1996)Proximity Drawability: a Survey., , and . GD, volume 894 of Lecture Notes in Computer Science, page 328-339. Springer, (1994)Hamiltonian Cycles in Solid Grid Graphs., and . FOCS, page 496-505. IEEE Computer Society, (1997)On Partitioning the Edges of 1-Planar Graphs., , and . CoRR, (2015)Perfectly Orderable P4 Composition., and . Electron. Notes Discret. Math., (2001)(k, p)-planarity: A relaxation of hybrid planarity., , , , and . Theor. Comput. Sci., (2021)Drawing Partial 2-Trees with Few Slopes., , , and . Algorithmica, 85 (5): 1156-1175 (May 2023)(k, p)-Planarity: A Relaxation of Hybrid Planarity., , , , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 148-159. Springer, (2019)Computing the Link Center of a Simple Polygon., , , , , , , , and . SCG, page 1-10. ACM, (1987)Minimum Weight Drawings of Maximal Triangulations (Extended Abstract)., and . GD, volume 1984 of Lecture Notes in Computer Science, page 338-349. Springer, (2000)