( en | de | ru )

 

Disambiguation of "Pfister, Maximilian"

Author of the publication

copydeleteadd this publication to your clipboard
Simultaneous Drawing of Layered Trees

, , , , and . Proc. 18th International Conference and Workshops on Algorithms and Computation (WALCOM'24), page 47--61. Springer, (2024)
DOI: 10.1007/978-981-97-0566-5_5

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.

Peter Maximilian Pfister

Dominik Maximilian Pfister

Roland Pfister

Ulrike Pfister

Traude Pfister

 

Other publications of authors with the same name

RAC Drawings of Graphs with Low Degree., , , , and . MFCS, volume 241 of LIPIcs, page 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Weakly and Strongly Fan-Planar Graphs., , , , and . GD (1), volume 14465 of Lecture Notes in Computer Science, page 53-68. Springer, (2023)Similarity Measures for Case-Based Retrieval of Natural Language Argument Graphs in Argumentation Machines., , , and . FLAIRS, page 329-334. AAAI Press, (2019)Simultaneous Drawing of Layered Trees., , , , and . CoRR, (2023)On Morphing 1-Planar Drawings., , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 270-282. Springer, (2021)Drawing Shortest Paths in Geodetic Graphs., , , , , , and . GD, volume 12590 of Lecture Notes in Computer Science, page 333-340. Springer, (2020)The Thickness of Fan-Planar Graphs is At Most Three., , and . GD, volume 13764 of Lecture Notes in Computer Science, page 247-260. Springer, (2022)Simultaneous Drawing of Layered Trees, , , , and . Proc. 18th International Conference and Workshops on Algorithms and Computation (WALCOM'24), page 47--61. Springer, (2024)Beyond-Planarity: Turán-Type Results for Non-Planar Bipartite Graphs., , , , and . ISAAC, volume 123 of LIPIcs, page 28:1-28:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Drawing Shortest Paths in Geodetic Graphs., , , , , , and . J. Graph Algorithms Appl., 26 (3): 353-361 (2022)