Carsten Gutwenger

According to our database1, Carsten Gutwenger authored at least 50 papers between 1998 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Progress on Partial Edge Drawings.
J. Graph Algorithms Appl., 2017

2015
Hypergraph and Minor Crossing Number Problems.
J. Graph Algorithms Appl., 2015

Drawing Partially Embedded and Simultaneously Planar Graphs.
J. Graph Algorithms Appl., 2015

2014
Graph Drawing Contest Report.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Examining the Compactness of Automatically Generated Layouts for Practical Diagrams.
Proceedings of the Joint Proceedings of the Fourth International Workshop on Euler Diagrams and the First International Workshop on Graph Visualization in Practice co-located with Diagrams 2014, 2014

Practical Experience with Hanani-Tutte for Testing c-Planarity.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
The Open Graph Drawing Framework (OGDF).
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Crossings and Planarization.
Proceedings of the Handbook on Graph Drawing and Visualization., 2013

Algorithm Engineering im Graphenzeichnen.
Inform. Spektrum, 2013

2012
Advances in the Planarization Method: Effective Multiple Edge Insertions.
J. Graph Algorithms Appl., 2012

Graph Drawing Contest Report.
Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011
Upward Planarization Layout.
J. Graph Algorithms Appl., 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica, 2011

The Open Graph Archive: A Community-Driven Effort.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
Application of SPQR-trees in the planarization approach for drawing graphs.
PhD thesis, 2010

Layer-free upward crossing minimization.
ACM J. Exp. Algorithmics, 2010

Improved Scalability by Using Hardware-Aware Thread Affinities.
Proceedings of the Facing the Multicore-Challenge, 2010

Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

An Experimental Evaluation of Multilevel Layout Methods.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Experiments on exact crossing minimization using column generation.
ACM J. Exp. Algorithmics, 2009

Non-planar core reduction of graphs.
Discret. Math., 2009

HONEI: A collection of libraries for numerical computations targeting multiple processor architectures.
Comput. Phys. Commun., 2009

Inserting a vertex into a planar graph.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Planar Biconnectivity Augmentation with Fixed Embedding.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

On the Hardness and Approximability of Planar Biconnectivity Augmentation.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Planarity Testing and Optimal Edge Insertion with Embedding Constraints.
J. Graph Algorithms Appl., 2008

A branch-and-cut approach to the crossing number problem.
Discret. Optim., 2008

An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Graph Drawing Contest Report.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

Computing Maximum C-Planar Subgraphs.
Proceedings of the Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, 2008

08191 Working Group Summary - Visually Comparing a Set of Graphs.
Proceedings of the Graph Drawing with Applications to Bioinformatics and Social Sciences, 04.05., 2008

2007
On the Minimum Cut of Planarizations.
Electron. Notes Discret. Math., 2007

Algorithms for the Hypergraph and the Minor Crossing Number Problems.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2005
Inserting an Edge into a Planar Graph.
Algorithmica, 2005

2004
Automatic layout of UML class diagrams in orthogonal style.
Inf. Vis., 2004

A Diagramming Software for UML Class Diagrams.
Proceedings of the Graph Drawing Software, 2004

2003
Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A New Approach for Visualizing UML Class Diagrams.
Proceedings of the Proceedings ACM 2003 Symposium on Software Visualization, 2003

Graph Embedding with Minimum Depth and Maximum External Face.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

An Experimental Study of Crossing Minimization Heuristics.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Advances in C-Planarity Testing of Clustered Graphs.
Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001
AGD: A Library of Algorithms for Graph Drawing.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Caesar Automatic Layout of UML Class Diagrams.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graph Drawing Algorithm Engineering with AGD.
Proceedings of the Software Visualization, 2001

Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS.
Proceedings of the Computational Combinatorial Optimization, 2001

2000
A Linear Time Implementation of SPQR-Trees.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1998

Planar Polyline Drawings with Good Angular Resolution.
Proceedings of the Graph Drawing, 6th International Symposium, 1998


  Loading...