Author of the publication

Drawing a tree as a minimum spanning tree approximation

, , , and . Journal of Computer and System Sciences, 78 (2): 491--503 (2012)

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

k-planar Placement and Packing of Δ-regular Caterpillars., , , , and . CoRR, (2023)Animating Geometric Algorithms Over the Web., , , and . SCG, page C-3-C-4. ACM, (1996)In-browser Visualization of Large-scale Graphs., , , and . itaDATA, volume 3340 of CEUR Workshop Proceedings, page 27-38. CEUR-WS.org, (2022)Area Requirement of Visibility Representations of Trees., , , and . CCCG, page 192-197. University of Waterloo, (1993)On the Edge-Length Ratio of 2-Trees., , and . GD, volume 12590 of Lecture Notes in Computer Science, page 85-98. Springer, (2020)NodeTrix Planarity Testing with Small Clusters., , , and . GD, volume 10692 of Lecture Notes in Computer Science, page 479-491. Springer, (2017)Planar and Plane Slope Number of Partial 2-Trees., , , and . GD, volume 8242 of Lecture Notes in Computer Science, page 412-423. Springer, (2013)Computing Labeled Orthogonal Drawings., , , and . GD, volume 2528 of Lecture Notes in Computer Science, page 66-73. Springer, (2002)Orthogonal 3D Shapes of Theta Graphs., , and . GD, volume 2528 of Lecture Notes in Computer Science, page 142-149. Springer, (2002)On Representing Graphs by Touching Cuboids., , , , , , , , and . GD, volume 7704 of Lecture Notes in Computer Science, page 187-198. Springer, (2012)