default search action
Sabine Cornelsen
Person information
- affiliation: University of Konstanz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c29]Therese Biedl, Sabine Cornelsen, Jan Kratochvíl, Ignaz Rutter:
Constrained Outer-String Representations. GD 2024: 10:1-10:18 - [c28]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. GD 2024: 13:1-13:20 - [i15]Patrizio Angelini, Therese Biedl, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Seok-Hee Hong, Giuseppe Liotta, Maurizio Patrignani, Sergey Pupyrev, Ignaz Rutter, Alexander Wolff:
The Price of Upwardness. CoRR abs/2409.01475 (2024) - 2023
- [j22]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. Comput. Geom. Topol. 2(1): 7:1-7:15 (2023) - [j21]Patrizio Angelini
, Steven Chaplick
Morphing Triangle Contact Representations of Triangulations. Discret. Comput. Geom. 70(3): 991-1024 (2023) - [j20]Sabine Cornelsen, Gregor Diatzko:
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. J. Graph Algorithms Appl. 27(7): 523-540 (2023) - [c27]Sabine Cornelsen
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - [i14]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023) - [i13]Sabine Cornelsen, Gregor Diatzko:
Decomposing Triangulations into 4-Connected Components. CoRR abs/2308.16020 (2023) - 2022
- [j19]Patrizio Angelini, Steven Chaplick
Planar L-Drawings of Bimodal Graphs. J. Graph Algorithms Appl. 26(3): 307-334 (2022) - [j18]Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. J. Graph Algorithms Appl. 26(3): 353-361 (2022) - [c26]Sabine Cornelsen
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. GD 2022: 111-126 - [c25]Patrizio Angelini
On Upward-Planar L-Drawings of Graphs. MFCS 2022: 10:1-10:15 - [i12]Patrizio Angelini, Steven Chaplick
On Upward-Planar L-Drawings of Graphs. CoRR abs/2205.05627 (2022) - [i11]Sabine Cornelsen, Gregor Diatzko:
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs. CoRR abs/2208.13446 (2022) - 2021
- [j17]Jakob Geiger
ClusterSets: Optimizing Planar Clusters in Categorical Point Data. Comput. Graph. Forum 40(3): 471-481 (2021) - 2020
- [c24]Patrizio Angelini
Planar L-Drawings of Bimodal Graphs. GD 2020: 205-219 - [c23]Sabine Cornelsen
Drawing Shortest Paths in Geodetic Graphs. GD 2020: 333-340 - [i10]Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. CoRR abs/2008.07637 (2020) - [i9]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo:
Planar L-Drawings of Bimodal Graphs. CoRR abs/2008.07834 (2020)
2010 – 2019
- 2019
- [c22]Patrizio Angelini
Morphing Contact Representations of Graphs. SoCG 2019: 10:1-10:16 - [i8]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Vincenzo Roselli:
Morphing Contact Representations of Graphs. CoRR abs/1903.07595 (2019) - 2018
- [c21]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. GD 2018: 509-523 - [i7]Evmorfia N. Argyriou, Sabine Cornelsen, Henry Förster, Michael Kaufmann, Martin Nöllenburg, Yoshio Okamoto, Chrysanthi N. Raftopoulou, Alexander Wolff:
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity. CoRR abs/1808.10536 (2018) - 2017
- [j16]Michael A. Bekos
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. Algorithmica 79(2): 401-427 (2017) - [j15]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. J. Graph Algorithms Appl. 21(4): 757-786 (2017) - [j14]Jan Christoph Athenstädt, Sabine Cornelsen:
Planarity of Overlapping Clusterings Including Unions of Two Partitions. J. Graph Algorithms Appl. 21(6): 1057-1089 (2017) - [c20]Steven Chaplick
Planar L-Drawings of Directed Graphs. GD 2017: 465-478 - [i6]Steven Chaplick, Markus Chimani, Sabine Cornelsen, Giordano Da Lozzo, Martin Nöllenburg, Maurizio Patrignani, Ioannis G. Tollis, Alexander Wolff:
Planar L-Drawings of Directed Graphs. CoRR abs/1708.09107 (2017) - 2016
- [c19]Patrizio Angelini
Simultaneous Orthogonal Planarity. GD 2016: 532-545 - [i5]Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, Giuseppe Di Battista, Peter Eades, Philipp Kindermann, Jan Kratochvíl, Fabian Lipp, Ignaz Rutter:
Simultaneous Orthogonal Planarity. CoRR abs/1608.08427 (2016) - [i4]Jan Christoph Athenstädt, Sabine Cornelsen:
C-Planarity of Overlapping Clusterings Including Unions of Two Partitions. CoRR abs/1609.04606 (2016) - 2015
- [j13]Michael A. Bekos
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - 2014
- [c18]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. GD 2014: 198-209 - [i3]Michael A. Bekos, Sabine Cornelsen, Luca Grilli, Seok-Hee Hong, Michael Kaufmann:
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs. CoRR abs/1409.0461 (2014) - 2013
- [c17]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - [i2]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013) - 2012
- [j12]Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Path-based supports for hypergraphs. J. Discrete Algorithms 14: 248-261 (2012) - [j11]Ulrik Brandes, Sabine Cornelsen:
Guest Editor's Foreword. J. Graph Algorithms Appl. 16(1): 3-4 (2012) - [j10]Sabine Cornelsen, Andreas Karrenbauer
Accelerated Bend Minimization. J. Graph Algorithms Appl. 16(3): 635-650 (2012) - [c16]Sabine Cornelsen, Andreas Karrenbauer
Leveling the Grid. ALENEX 2012: 45-54 - [c15]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. GD 2012: 67-78 - [i1]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani, Martin Nöllenburg, Alexander Wolff:
Progress on Partial Edge Drawings. CoRR abs/1209.0830 (2012) - 2011
- [j9]Melanie Badent, Ulrik Brandes, Sabine Cornelsen:
More Canonical Ordering. J. Graph Algorithms Appl. 15(1): 97-126 (2011) - [c14]Sabine Cornelsen, Andreas Karrenbauer
Accelerated Bend Minimization. GD 2011: 111-122 - [e1]Ulrik Brandes, Sabine Cornelsen:
Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6502, Springer 2011, ISBN 978-3-642-18468-0 [contents] - 2010
- [c13]Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Path-Based Supports for Hypergraphs. IWOCA 2010: 20-33 - [c12]Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity. IWOCA 2010: 201-211
2000 – 2009
- 2009
- [j8]Sabine Cornelsen, Gabriele Di Stefano:
Treelike comparability graphs. Discret. Appl. Math. 157(8): 1711-1722 (2009) - [j7]Ulrik Brandes, Sabine Cornelsen:
Phylogenetic graph models beyond trees. Discret. Appl. Math. 157(10): 2361-2369 (2009) - [c11]Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen:
Leftist Canonical Ordering. GD 2009: 159-170 - 2007
- [j6]Sabine Cornelsen, Gabriele Di Stefano:
Track assignment. J. Discrete Algorithms 5(2): 250-261 (2007) - 2006
- [j5]Sabine Cornelsen, Dorothea Wagner:
Completely connected clustered graphs. J. Discrete Algorithms 4(2): 313-323 (2006) - 2005
- [j4]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) - 2004
- [j3]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) - [j2]Sabine Cornelsen, Thomas Schank, Dorothea Wagner:
Drawing Graphs on Two and Three Lines. J. Graph Algorithms Appl. 8(2): 161-177 (2004) - [c10]Sabine Cornelsen, Gabriele Di Stefano:
Platform Assignment. ATMOS 2004: 233-245 - [c9]Sabine Cornelsen, Gabriele Di Stefano:
Treelike Comparability Graphs: Characterization, Recognition, and Applications. WG 2004: 46-57 - 2003
- [b1]Sabine Cornelsen:
Drawing Families of Cuts in a Graph. University of Konstanz, Germany, 2003 - [j1]Ulrik Brandes, Sabine Cornelsen:
Visual Ranking of Link Structures. J. Graph Algorithms Appl. 7(2): 181-201 (2003) - [c8]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. GD 2003: 357-368 - [c7]Sabine Cornelsen, Dorothea Wagner:
Completely Connected Clustered Graphs. WG 2003: 168-179 - 2002
- [c6]Sabine Cornelsen, Thomas Schank, Dorothea Wagner:
Drawing Graphs on Two and Three Lines. GD 2002: 31-41 - 2001
- [c5]Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler
Visone. GD 2001: 463-464 - [c4]Ulrik Brandes, Sabine Cornelsen:
Visual Ranking of Link Structures. WADS 2001: 222-233 - [c3]Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner:
Planarity of the 2-Level Cactus Model. WG 2001: 91-102 - 2000
- [c2]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). GD 2000: 103-114
1990 – 1999
- 1999
- [c1]Ralf Brockenauer, Sabine Cornelsen:
Drawing Clusters and Hierarchies. Drawing Graphs 1999: 193-227
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: