Inserting an Edge Into a Planar Graph (2000)

Cached

Download Links

by Carsten Gutwenger , Petra Mutzel , René Weiskircher
Venue:Algorithmica
Citations:17 - 8 self

Active Bibliography

2 Drawing Database Schemas – Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
Bend Minimization in Planar Orthogonal Drawings Using Integer Programming – Petra Mutzel, René Weiskircher - 2004
6 Planarity testing and optimal edge insertion with embedding constraints – Carsten Gutwenger, Karsten Klein, Petra Mutzel - 2008
Drawing Databbase Schemas – Giuseppe Di Battista , Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia - 2002
Crossings and Planarization – Christoph Buchheim, Markus Chimani, Carsten Gutwenger, Michael Jünger, Petra Mutzel - 2004
3 Non-Planar Core Reduction of Graphs – Carsten Gutwenger, Markus Chimani
Optimal Crossing Minimization . . . – Dietmar Ebner - 2005
14 Graph Drawing – Roberto Tamassia - 1997
1 Contractions, Removals and How to Certify 3-Connectivity in Linear Time – Jens M. Schmidt
1 A planarity test via construction sequences – Jens M. Schmidt
5 A linear time algorithm for finding a maximal planar subgraph based on PC-trees – Wen-lian Hsu - 2005
12 An Approach for Mixed Upward Planarization – Markus Eiglsperger, Frank Eppinger, Michael Kaufmann - 2003
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
67 Drawing Planar Graphs Using the Canonical Ordering – Goos Kant - 1996
2 GRID: An Interactive Tool for Computing Orthogonal Drawings With the Minimum Number of Bends – Walter Didimo, Antonio Leonforte - 1998
5 Computing Orthogonal Drawings in a Variable Embedding Setting – Walter Didimo, Giuseppe Liotta - 1998
22 Planar Polyline Drawings with Good Angular Resolution – Carsten Gutwenger, Petra Mutzel - 1998
13 A New Approach for Visualizing UML Class Diagrams – Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
64 A Better Heuristic for Orthogonal Graph Drawings – Therese Biedl, Goos Kant - 1998