default search action
Carsten Gutwenger
Person information
- affiliation: Technical University of Dortmund, Department of Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j16]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
, Martin Nöllenburg
Progress on Partial Edge Drawings. J. Graph Algorithms Appl. 21(4): 757-786 (2017) - 2015
- [j15]Markus Chimani, Carsten Gutwenger:
Hypergraph and Minor Crossing Number Problems. J. Graph Algorithms Appl. 19(1): 191-222 (2015) - [j14]Timothy M. Chan, Fabrizio Frati
Drawing Partially Embedded and Simultaneously Planar Graphs. J. Graph Algorithms Appl. 19(2): 681-706 (2015) - 2014
- [c43]Carsten Gutwenger, Petra Mutzel
Practical Experience with Hanani-Tutte for Testing c-Planarity. ALENEX 2014: 86-97 - [c42]Carsten Gutwenger, Ulf Rüegg, Miro Spönemann, Reinhard von Hanxleden, Petra Mutzel:
Examining the Compactness of Automatically Generated Layouts for Practical Diagrams. ED/GViP@Diagrams 2014: 42-52 - [c41]Timothy M. Chan, Fabrizio Frati
Drawing Partially Embedded and Simultaneously Planar Graphs. GD 2014: 25-39 - [c40]Carsten Gutwenger, Maarten Löffler, Lev Nachmanson, Ignaz Rutter:
Graph Drawing Contest Report. GD 2014: 501-506 - [i5]Timothy M. Chan, Fabrizio Frati, Carsten Gutwenger, Anna Lubiw, Petra Mutzel, Marcus Schaefer:
Drawing Partially Embedded and Simultaneously Planar Graphs. CoRR abs/1410.8205 (2014) - 2013
- [j13]Martin Gronemann, Carsten Gutwenger, Michael Jünger, Petra Mutzel
Algorithm Engineering im Graphenzeichnen. Inform. Spektrum 36(2): 162-173 (2013) - [c39]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2013: 508-513 - [r2]Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel:
Crossings and Planarization. Handbook of Graph Drawing and Visualization 2013: 43-85 - [r1]Markus Chimani, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Karsten Klein, Petra Mutzel:
The Open Graph Drawing Framework (OGDF). Handbook of Graph Drawing and Visualization 2013: 543-569 - 2012
- [j12]Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. J. Graph Algorithms Appl. 16(3): 729-757 (2012) - [c38]Till Bruckdorfer, Sabine Cornelsen, Carsten Gutwenger, Michael Kaufmann, Fabrizio Montecchiani
Progress on Partial Edge Drawings. GD 2012: 67-78 - [c37]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2012: 575-579 - [i4]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
- [j11]Ulrik Brandes, Cesim Erten
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j10]Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong:
Upward Planarization Layout. J. Graph Algorithms Appl. 15(1): 127-155 (2011) - [c36]Markus Chimani, Carsten Gutwenger:
Advances in the Planarization Method: Effective Multiple Edge Insertions. GD 2011: 87-98 - [c35]Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow
The Open Graph Archive: A Community-Driven Effort. GD 2011: 435-440 - [c34]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2011: 449-455 - [i3]Christian Bachmaier, Franz-Josef Brandenburg, Philip Effinger, Carsten Gutwenger, Jyrki Katajainen, Karsten Klein, Miro Spönemann, Matthias Stegmaier, Michael Wybrow:
The Open Graph Archive: A Community-Driven Effort. CoRR abs/1109.1465 (2011) - 2010
- [b1]Carsten Gutwenger:
Application of SPQR-trees in the planarization approach for drawing graphs. Dortmund University of Technology, 2010 - [j9]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Layer-free upward crossing minimization. ACM J. Exp. Algorithmics 15 (2010) - [c33]Gereon Bartel, Carsten Gutwenger, Karsten Klein, Petra Mutzel
An Experimental Evaluation of Multilevel Layout Methods. GD 2010: 80-91 - [c32]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints. GD 2010: 141-152 - [c31]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2010: 406-411 - [c30]Sven Mallach
Improved Scalability by Using Hardware-Aware Thread Affinities. Facing the Multicore-Challenge 2010: 29-41
2000 – 2009
- 2009
- [j8]Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke
HONEI: A collection of libraries for numerical computations targeting multiple processor architectures. Comput. Phys. Commun. 180(12): 2534-2543 (2009) - [j7]Markus Chimani, Carsten Gutwenger:
Non-planar core reduction of graphs. Discret. Math. 309(7): 1838-1855 (2009) - [j6]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Experiments on exact crossing minimization using column generation. ACM J. Exp. Algorithmics 14 (2009) - [c29]Carsten Gutwenger, Petra Mutzel
On the Hardness and Approximability of Planar Biconnectivity Augmentation. COCOON 2009: 249-257 - [c28]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Upward Planarization Layout. GD 2009: 94-106 - [c27]Christian A. Duncan, Carsten Gutwenger, Lev Nachmanson, Georg Sander:
Graph Drawing Contest Report. GD 2009: 428-433 - [c26]Carsten Gutwenger, Petra Mutzel
Planar Biconnectivity Augmentation with Fixed Embedding. IWOCA 2009: 289-300 - [c25]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Inserting a vertex into a planar graph. SODA 2009: 375-383 - [i2]Danny van Dyk, Markus Geveler, Sven Mallach, Dirk Ribbrock, Dominik Göddeke, Carsten Gutwenger:
HONEI: A collection of libraries for numerical computations targeting multiple processor architectures. CoRR abs/0904.4152 (2009) - 2008
- [j5]Christoph Buchheim
A branch-and-cut approach to the crossing number problem. Discret. Optim. 5(2): 373-388 (2008) - [j4]Carsten Gutwenger, Karsten Klein, Petra Mutzel
Planarity Testing and Optimal Edge Insertion with Embedding Constraints. J. Graph Algorithms Appl. 12(1): 73-95 (2008) - [c24]Markus Chimani, Carsten Gutwenger, Mathias Jansen, Karsten Klein, Petra Mutzel
Computing Maximum C-Planar Subgraphs. GD 2008: 114-120 - [c23]J. Joseph Fowler, Carsten Gutwenger, Michael Jünger, Petra Mutzel
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges. GD 2008: 157-168 - [c22]Ugur Dogrusöz
Graph Drawing Contest Report. GD 2008: 453-458 - [c21]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Layer-Free Upward Crossing Minimization. WEA 2008: 55-68 - [i1]Mario Albrecht, Alejandro Estrella-Balderrama, Markus Geyer, Carsten Gutwenger, Karsten Klein, Oliver Kohlbacher, Michael Schulz:
08191 Working Group Summary - Visually Comparing a Set of Graphs. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - 2007
- [j3]Markus Chimani, Carsten Gutwenger, Petra Mutzel
On the Minimum Cut of Planarizations. Electron. Notes Discret. Math. 28: 177-184 (2007) - [c20]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c19]Markus Chimani, Carsten Gutwenger:
Algorithms for the Hypergraph and the Minor Crossing Number Problems. ISAAC 2007: 184-195 - 2006
- [c18]Carsten Gutwenger, Karsten Klein, Petra Mutzel
Planarity Testing and Optimal Edge Insertion with Embedding Constraints. GD 2006: 126-137 - [c17]Markus Chimani, Carsten Gutwenger, Petra Mutzel
Experiments on Exact Crossing Minimization Using Column Generation. WEA 2006: 303-315 - 2005
- [j2]Carsten Gutwenger, Petra Mutzel
Inserting an Edge into a Planar Graph. Algorithmica 41(4): 289-308 (2005) - [c16]Carsten Gutwenger, Markus Chimani:
Non-planar Core Reduction of Graphs. GD 2005: 223-234 - 2004
- [j1]Markus Eiglsperger, Carsten Gutwenger, Michael Kaufmann, Joachim Kupke, Michael Jünger, Sebastian Leipert, Karsten Klein, Petra Mutzel
Automatic layout of UML class diagrams in orthogonal style. Inf. Vis. 3(3): 189-208 (2004) - [p1]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel:
A Diagramming Software for UML Class Diagrams. Graph Drawing Software 2004: 257-278 - 2003
- [c15]Carsten Gutwenger, Petra Mutzel
An Experimental Study of Crossing Minimization Heuristics. GD 2003: 13-24 - [c14]Carsten Gutwenger, Joachim Kupke, Karsten Klein, Sebastian Leipert:
GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration. GD 2003: 123-128 - [c13]Carsten Gutwenger, Petra Mutzel
Graph Embedding with Minimum Depth and Maximum External Face. GD 2003: 259-272 - [c12]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
A New Approach for Visualizing UML Class Diagrams. SOFTVIS 2003: 179-188 - [c11]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). WG 2003: 261-272 - 2002
- [c10]Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel
Advances in C-Planarity Testing of Clustered Graphs. GD 2002: 220-235 - 2001
- [c9]Matthias Elf, Carsten Gutwenger, Michael Jünger, Giovanni Rinaldi:
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS. Computational Combinatorial Optimization 2001: 157-222 - [c8]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau
Graph Drawing Algorithm Engineering with AGD. Software Visualization 2001: 307-323 - [c7]Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
Caesar Automatic Layout of UML Class Diagrams. GD 2001: 461-462 - [c6]Carsten Gutwenger, Michael Jünger, Gunnar W. Klau
AGD: A Library of Algorithms for Graph Drawing. GD 2001: 473-474 - [c5]Carsten Gutwenger, Petra Mutzel, René Weiskircher:
Inserting an edge into a planar graph. SODA 2001: 246-255 - 2000
- [c4]Carsten Gutwenger, Petra Mutzel
A Linear Time Implementation of SPQR-Trees. GD 2000: 77-90
1990 – 1999
- 1998
- [c3]Carsten Gutwenger, Petra Mutzel
Planar Polyline Drawings with Good Angular Resolution. GD 1998: 167-182 - [c2]Petra Mutzel
A Library of Algorithms for Graph Drawing. GD 1998: 456-457 - 1997
- [c1]David Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher:
AGD-Library: A Library of Algorithms for Graph Drawing. WAE 1997: 112-123
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-08-05 20:14 CEST 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: