( en | de | ru )

 

Disambiguation of "Klawitter, Jonathan"

Author of the publication

copydeleteadd this publication to your clipboard
Morphing Rectangular Duals.

, , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 389-403. Springer, (2022)

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.

Jonathan

Amalie Klawitter

Yvonne Klawitter

Tim Klawitter

Gerhard Klawitter

 

Other publications of authors with the same name

Upward Planar Drawings with Three and More Slopes, and . Journal of Graph Algorithms and Applications, 27 (2): 49--70 (2023)Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings., and . GD, volume 12590 of Lecture Notes in Computer Science, page 173-180. Springer, (2020)Morphing Rectangular Duals., , , , and . GD, volume 13764 of Lecture Notes in Computer Science, page 389-403. Springer, (2022)Visualizing Geophylogenies - Internal and External Labeling with Phylogenetic Tree Constraints., , , , and . GIScience, volume 277 of LIPIcs, page 5:1-5:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Tree Drawings with Columns, and . Proc. 31st International Symposium on Graph Drawing and Network Visualization (GD'23), page 195--210. Springer, (2023)Upward Planar Drawings with Three Slopes, and . Proc. 37th Europ. Workshop Comput. Geom. (EuroCG'21), (2021)Upward Planar Drawings with Three and More Slopes., and . GD, volume 12868 of Lecture Notes in Computer Science, page 149-165. Springer, (2021)The agreement distance of unrooted phylogenetic networks. (2019)cite arxiv:1908.08183.The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs., , , , , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 271-286. Springer, (2022)Algorithms for Floor Planning with Proximity Requirements., , and . CAAD Futures, volume 1465 of Communications in Computer and Information Science, page 151-171. Springer, (2021)