From post

Straightening Drawings of Clustered Hierarchical Graphs

, , , и . Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM'07), том 4362 из Lecture Notes in Computer Science, стр. 177--186. Springer-Verlag, (2007)
DOI: 10.1007/978-3-540-69507-3_14

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.

 

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

Preface., и . Theor. Comput. Sci., (2018)On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model., , , , и . CoRR, (2018)Optimizing Phylogenetic Networks for Circular Split Systems., и . IEEE ACM Trans. Comput. Biol. Bioinform., 9 (2): 535-547 (2012)Computing Balanced Convex Partitions of Lines.. Algorithmica, 85 (8): 2515-2528 (августа 2023)On the coarseness of bicolored point sets., , , , , и . Comput. Geom., 46 (1): 65-77 (2013)On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane.. Graphs Comb., 25 (2): 139-144 (2009)Sliding Disks in the Plane., , и . Int. J. Comput. Geom. Appl., 18 (5): 373-387 (2008)Finding Nearest Larger Neighbors., , и . Efficient Algorithms, том 5760 из Lecture Notes in Computer Science, стр. 249-260. Springer, (2009)A PTAS for Cutting Out Polygons with Lines., , и . COCOON, том 4112 из Lecture Notes in Computer Science, стр. 176-185. Springer, (2006)A New Framework for Connected Components Labeling of Binary Images., и . IWCIA, том 7655 из Lecture Notes in Computer Science, стр. 90-102. Springer, (2012)