Planarity Testing and Embedding (2004)

by Pier Francesco Cortese , Maurizio Patrignani
Citations:1 - 0 self

Active Bibliography

Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
65 Drawing Planar Graphs Using the Canonical Ordering – Goos Kant - 1996
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
Optimal Crossing Minimization . . . – Dietmar Ebner - 2005
1 Efficient Algorithms for Drawing Planar Graphs – Md. Saidur Rahman - 1999
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
11 Output-Sensitive Reporting of Disjoint Paths – Giuseppe Di Battista, Roberto Tamassia, Luca Vismara - 1996
1 Branch-and-Bound Techniques for the Maximum Planar Subgraph Problem – Robert Cimikowski - 1994
10 Graph Planarization and Skewness – Robert Cimikowski
Simplified O(n) Planarity Algorithms – John M. Boyer, Wendy Myrvold - 2001
13 A New Approach for Visualizing UML Class Diagrams – Carsten Gutwenger, Michael Jünger, Karsten Klein, Joachim Kupke, Sebastian Leipert, Petra Mutzel
PQ Trees, PC Trees, and Planar Graphs – Wen-Lian Hsu, Ross M. McConnell - 2001
Linear-time algorithms to color topological graphs – Warren D. Smith - 2005
81 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
1 I/O-Optimal Planar Embedding Using Graph Separators – Norbert Zeh - 2001
2 Where to Draw the Line – Ashim Garg - 1996
16 A Linear Algorithm for Analysis of Minimum Spanning and Shortest Path Trees of Planar Graphs – Heather Booth, Jeffery Westbrook - 1992
1 Angewandte Mathematik und Informatik Universit at zu K oln – Report No, Using Pq-trees, Sebastian Leipert, Michael Junger, Michael Junger, Petra Mutzel, Petra Mutzel - 1998