Planarity Testing and Embedding (2004)

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

Active Bibliography

6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
17 Graph Augmentation And Related Problems: Theory And Practice – Tsan-Sheng Hsu - 1993
1 Efficient Algorithms for Drawing Planar Graphs – Md. Saidur Rahman - 1999
65 Drawing Planar Graphs Using the Canonical Ordering – Goos Kant - 1996
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
78 Upward Planarity Testing – Ashim Garg, Roberto Tamassia - 1995
1 I/O-Optimal Planar Embedding Using Graph Separators – Norbert Zeh - 2001
Optimal Crossing Minimization . . . – Dietmar Ebner - 2005
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
unknown title – unknown authors
PQ-trees and the Set of All Distinct Planar Embeddings of a Graph – Ma Tthias Stallmann
2 Drawing Database Schemas – Giuseppe Di Battista, Walter Didimo, Maurizio Patrignani, Maurizio Pizzonia
3 I/O-Efficient Planar Separators and Applications – Norbert Zeh - 2001
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997