Author of the publication

Refinement of Three-Dimensional Orthogonal Graph Drawings.

, , and . GD, volume 1984 of Lecture Notes in Computer Science, page 308-320. Springer, (2000)

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

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons, , , , and . Proceedings of the 36th European Workshop on Computational Geometry (EuroCG'20), page 70:1--70:6. Würzburg, (2020)Abstract.The Straight-Line RAC Drawing Problem is NP-Hard., , and . J. Graph Algorithms Appl., 16 (2): 569-597 (2012)Monotone Drawings of Graphs with Fixed Embedding., , , , , , and . Algorithmica, 71 (2): 233-257 (2015)Many-to-Many Routings on Trees via Matchings., , and . Theor. Comput. Sci., 185 (2): 347-377 (1997)Resource allocation for video-on-demand with "delayed-multicast" protocol., , and . GLOBECOM, page 1789-1793. IEEE, (2002)Splitting Vertices in 2-Layer Graph Drawings., , , , , , , , , and 1 other author(s). CoRR, (2023)Lower bounds for hot-potato permutation routing on trees., , and . SIROCCO, page 281-295. Carleton Scientific, (2000)Maximizing the Total Resolution of Graphs., , and . Comput. J., 56 (7): 887-900 (2013)Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms., , and . Comput. J., 45 (4): 423-435 (2002)Dimension-exchange algorithms for token distribution on tree-connected architectures., , and . J. Parallel Distributed Comput., 64 (5): 591-605 (2004)