Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Partitioning Orthogonal Histograms into Rectangular Boxes.

T. Biedl, M. Derka, V. Irvine, A. Lubiw, D. Mondal, and A. Turcotte. 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.

Martin Baumann

Martin Schwartz University of Stuttgart

Martin Alvarez University of Stuttgart

Univ. -Prof. Martin Ostermann University of Stuttgart

Dr. Martin Rose University of Stuttgart

Other publications of authors with the same name

Splitting $B_2$-VPG graphs into outer-string and co-comparability graphs.M. Derka, and T. Biedl. CoRR, (2016)List Colouring Big Graphs On-Line.M. Derka, A. López-Ortiz, and D. Maftuleac. CoRR, (2015)List Colouring and Partial List Colouring of Graphs On-line.M. Derka, A. López-Ortiz, and D. Maftuleac. IWOCA, volume 9538 of Lecture Notes in Computer Science, page 124-135. Springer, (2015)Order-Preserving 1-String Representations of Planar Graphs.T. Biedl, and M. Derka. SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 283-294. Springer, (2017)Turning Orthogonally Convex Polyhedra into Orthoballs.F. Barrera-Cruz, T. Biedl, M. Derka, S. Kiazyk, A. Lubiw, and H. Vosoughpour. CCCG, Carleton University, Ottawa, Canada, (2014)The (3, 1)-ordering for 4-connected planar triangulations.T. Biedl, and M. Derka. J. Graph Algorithms Appl., 20 (2): 347-362 (2016)Crossing Number for Graphs with Bounded~Pathwidth.T. Biedl, M. Chimani, M. Derka, and P. Mutzel. ISAAC, volume 92 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)On the Size of Outer-String Representations.T. Biedl, A. Biniaz, and M. Derka. SWAT, volume 101 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Planar emulators conjecture is nearly true for cubic graphs.M. Derka, and P. Hlinený. Eur. J. Comb., (2015)Crossing Number for Graphs With Bounded Pathwidth.T. Biedl, M. Chimani, M. Derka, and P. Mutzel. CoRR, (2016)