( en | de | ru )

 

Disambiguation of "Gronemann, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Multi-Level Steiner Trees

, , , , , , , , , , and . Proc. 17th Int. Symp. Exper. Algorithms (SEA'18), volume 103 of LIPIcs, page 15:1--14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2018)
DOI: 10.4230/LIPIcs.SEA.2018.15

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 Gronemann

Werner Gronemann

Hans Gronemann

Elisabeth Gronemann

Walther Gronemann

 

Other publications of authors with the same name

Bitonic st-Orderings for Upward Planar Graphs: The Variable Embedding Setting., , , and . WG, volume 12301 of Lecture Notes in Computer Science, page 339-351. Springer, (2020)The mixed page number of graphs., , , , and . Theor. Comput. Sci., (2022)Recognizing Map Graphs of Bounded Treewidth., , , , , and . SWAT, volume 227 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Geometric Representations of Dichotomous Ordinal Data., , , and . WG, volume 11789 of Lecture Notes in Computer Science, page 205-217. Springer, (2019)Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages., , , , , and . SoCG, volume 164 of LIPIcs, page 16:1-16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Multi-level Steiner Trees., , , , , , , , , and 1 other author(s). ACM J. Exp. Algorithmics, 24 (1): 2.5:1-2.5:22 (2019)Recognizing DAGs with Page-Number 2 Is NP-complete., , , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 361-370. Springer, (2022)Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution., , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 157-171. Springer, (2022)Drawing Shortest Paths in Geodetic Graphs., , , , , , and . J. Graph Algorithms Appl., 26 (3): 353-361 (2022)Bitonic st-Orderings for Upward Planar Graphs: Splits and Bends in the Variable Embedding Scenario., , , and . Algorithmica, 85 (9): 2667-2692 (September 2023)