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

Planar emulators conjecture is nearly true for cubic graphs., and . Eur. J. Comb., (2015)Order-preserving 1-string representations of planar graphs., and . CoRR, (2016)Partitioning Orthogonal Histograms into Rectangular Boxes., , , , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 146-160. Springer, (2018)List Colouring and Partial List Colouring of Graphs On-line., , and . IWOCA, volume 9538 of Lecture Notes in Computer Science, page 124-135. Springer, (2015)Order-Preserving 1-String Representations of Planar Graphs., and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 283-294. Springer, (2017)Ideal properties of rollup escape hatches., , and . DICG@Middleware, page 7-12. ACM, (2022)A Rollup Comparison Framework., and . CoRR, (2024)Turning Orthogonally Convex Polyhedra into Orthoballs., , , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)Crossing Number for Graphs with Bounded~Pathwidth., , , and . ISAAC, volume 92 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Size of Outer-String Representations., , and . SWAT, volume 101 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)