Author of the publication

Partitioning Orthogonal Histograms into Rectangular Boxes.

, , , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 146-160. Springer, (2018)

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

How to Morph Planar Graph Drawings., , , , , , , , , and 3 other author(s). SIAM J. Comput., 46 (2): 824-852 (2017)Embedding Problems for Paths with Direction Constrained Edges., , , and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 64-73. Springer, (2000)Flipping Edge-Labelled Triangulations., , , and . CoRR, (2013)On the Planar Split Thickness of Graphs, , , , , , , , and . Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN'16), volume 9644 of Lecture Notes in Computer Science, page 403--415. Springer-Verlag, (April 2016)Counterexample to a Conjecture of Szymanski on Hypercube Routing.. Inf. Process. Lett., 35 (2): 57-61 (1990)Decomposing polygonal regions into convex quadrilaterals.. SCG, page 97-106. ACM, (1985)Reconfiguring a Chain of Cubes., , , , and . CCCG, Queen's University, Ontario, Canada, (2015)Recovery of Convex Hulls From External Visibility Graphs., , and . CCCG, page 309-314. University of Waterloo, (1993)Rollercoasters and Caterpillars., , , , , , and . ICALP, volume 107 of LIPIcs, page 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Visibility Center of a Simple Polygon., and . ESA, volume 204 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)