From post

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.

 

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

Simultaneous Orthogonal Planarity, , , , , , , , , и . Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, том 9801 из Lecture Notes in Computer Science, стр. 532--545. Springer, (сентября 2016)Simultaneous Orthogonal Planarity, , , , , , , , , и . Proc. 24th Int. Sympos. Graph Drawing Network Vis. (GD'16), 9801, стр. 532-545. Springer, (2016)Drawing Clusters and Hierarchies., и . Drawing Graphs, том 2025 из Lecture Notes in Computer Science, стр. 193-227. Springer, (1999)How to draw the minimum cuts of a planar graph., , , и . Comput. Geom., 29 (2): 117-133 (2004)Drawing Shortest Paths in Geodetic Graphs., , , , , , и . J. Graph Algorithms Appl., 26 (3): 353-361 (2022)Decomposing Triangulations into 4-Connected Components., и . CoRR, (2023)Visual Ranking of Link Structures., и . WADS, том 2125 из Lecture Notes in Computer Science, стр. 222-233. Springer, (2001)The Parametrized Complexity of the Segment Number., , , , , и . GD (2), том 14466 из Lecture Notes in Computer Science, стр. 97-113. Springer, (2023)Planar Confluent Orthogonal Drawings of 4-Modal Digraphs., и . GD, том 13764 из Lecture Notes in Computer Science, стр. 111-126. Springer, (2022)Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles., , и . J. Graph Algorithms Appl., 9 (1): 99-115 (2005)