| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 15 |       | Sabine Cornelsen, Dorothea Wagner: Completely connected clustered graphs. J. Discrete Algorithms 4(2): 313-323 (2006) |
| 14 | | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. J. Graph Algorithms Appl. 9(1): 99-115 (2005) |
| 11 | | Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner: How to draw the minimum cuts of a planar graph. Comput. Geom. 29(2): 117-133 (2004) |
| 10 | | Sabine Cornelsen, Thomas Schank, Dorothea Wagner: Drawing Graphs on Two and Three Lines. J. Graph Algorithms Appl. 8(2): 161-177 (2004) |
| 9 | | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. Graph Drawing 2003: 357-368 |
| 8 | | Sabine Cornelsen, Dorothea Wagner: Completely Connected Clustered Graphs. WG 2003: 168-179 |
| 6 | | Sabine Cornelsen, Thomas Schank, Dorothea Wagner: Drawing Graphs on Two and Three Lines. Graph Drawing 2002: 31-41 |
| 5 | | Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner: Visone. Graph Drawing 2001: 463-464 |
| 3 | | Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner: Planarity of the 2-Level Cactus Model. WG 2001: 91-102 |
| 2 | | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). Graph Drawing 2000: 103-114 |
Selection of 10 from 26 records - Sabine Cornelsen has 16 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page