Efficient Algorithms for Drawing Planar Graphs (1999)

by Md. Saidur Rahman
Citations:1 - 0 self

Active Bibliography

Drawings and Independent Spanning Trees – Kazuyuki Miura - 2001
25 Algorithms for Drawing Clustered Graphs – Qingwen Feng - 1997
65 Drawing Planar Graphs Using the Canonical Ordering – Goos Kant - 1996
15 Upward Planar Drawing of Single Source Acyclic Digraphs – Michael D. Hutton - 1990
22 Planar Polyline Drawings with Good Angular Resolution – Carsten Gutwenger, Petra Mutzel - 1998
2 Where to Draw the Line – Ashim Garg - 1996
31 On Linear Layouts of Graphs – Vida Dujmovic, David R. Wood - 2004
On the Volume and Resolution of 3-Dimensional Convex Graph Drawing (Extended Abstract) – Marek Chrobak, Michael T. Goodrich, Roberto Tamassia
2 A Simple Linear Time Algorithm for Embedding Maximal Planar Graphs – Hermann Stamm-wilbrandt - 1993
7 A Simple Linear Time Algorithm for Proper Box Rectangular Drawing of Plane Graphs – Xin He - 2000
10 Really straight graph drawings – Vida Dujmović, Matthew Suderman, David R. Wood - 2004
11 Output-Sensitive Reporting of Disjoint Paths – Giuseppe Di Battista, Roberto Tamassia, Luca Vismara - 1996
19 A Numerical Optimization Approach to General Graph Drawing – Daniel Tunkelang - 1999
5 Planar Graphs with Topological Constraints – Christoph Dornheim - 2002
3 Parallel Computation and Graphical Visualization of the Minimum Crossing Number of a Graph – Umid Tadjiev - 1998
27 Three-Dimensional Orthogonal Graph Drawing – David R. Wood - 2000
Constrained Planarity • Deletion and Partition Problems • – Maurizio Patrignani, Upward Planarity Outerplanarity
VAP-free planarity, planarity and EAP-free planarity testing of dynamic graphs – Jose Caceres, Juan C. Dana, Alberto Marquez
1 Planarity Testing and Embedding – Pier Francesco Cortese, Maurizio Patrignani - 2004