From post

Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three.

, , , и . GD, том 5417 из Lecture Notes in Computer Science, стр. 408-419. Springer, (2008)

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.

 

Другие публикации лиц с тем же именем

Evaluating Cartogram Effectiveness., , и . CoRR, (2015)Minimum-area drawings of plane 3-trees., , , и . CCCG, стр. 191-194. (2010)3D proportional contact representations of graphs., , , , и . IISA, стр. 27-32. IEEE, (2014)Queue Layouts of Planar 3-Trees., , , , и . Algorithmica, 82 (9): 2564-2585 (2020)Lazy Queue Layouts of Posets., , , , и . Algorithmica, 85 (5): 1176-1201 (мая 2023)Balanced Circle Packings for Planar Graphs., , , , и . GD, том 8871 из Lecture Notes in Computer Science, стр. 125-136. Springer, (2014)Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area., , и . J. Graph Algorithms Appl., 15 (3): 437-456 (2011)Lazy Queue Layouts of Posets., , , , и . GD, том 12590 из Lecture Notes in Computer Science, стр. 55-68. Springer, (2020)Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three., , , и . GD, том 5417 из Lecture Notes in Computer Science, стр. 408-419. Springer, (2008)Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs., , и . GD, том 8242 из Lecture Notes in Computer Science, стр. 83-94. Springer, (2013)