( en | de | ru )

 

Disambiguation of "Cornelsen, Sabine"

Author of the publication

copydeleteadd this publication to your clipboard
Visone.

, , , , , , , and . GD, volume 2265 of Lecture Notes in Computer Science, page 463-464. Springer, (2001)

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.

Sabine Cornelsen

Sabine Cornelsen

Jan Cornelsen

Inge Cornelsen

Hans Cornelsen

 

Other publications of authors with the same name

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