|
54
|
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
– Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi
- 1999
|
|
5
|
Clustered Graphs and C-planarity
– Qing-wen Feng, Peter Eades, Robert F. Cohen
- 1995
|
|
24
|
Algorithms for Drawing Clustered Graphs
– Qingwen Feng
- 1997
|
|
68
|
Multilevel Visualization of Clustered Graphs
– Peter Eades, Qingwen Feng
- 1997
|
|
21
|
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
– Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov
- 1998
|
|
1
|
Efficient Algorithms for Drawing Planar Graphs
– Md. Saidur Rahman
- 1999
|
|
5
|
From Algorithms to Working Programs On the Use of Program Checking in LEDA
– Kurt Mehlhorn, Stefan Näher
- 1998
|
|
2
|
Planar Drawing of Clustered Graphs
– Qing-wen Feng, Peter Eades, Robert F. Cohen
- 1995
|
|
1
|
Graph Embedding with Topological Cycle-Constraints
– Christoph Dornheim
- 1999
|
|
|
Drawing Clustered Graphs on an Orthogonal Grid (Extended Abstract)
– Peter Eades, Qingwen Feng
- 1997
|
|
4
|
Orthogonal Grid Drawing of Clustered Graphs
– Peter Eades, Qingwen Feng
- 1996
|
|
21
|
A Fast Multi-Dimensional Algorithm for Drawing Large Graphs
– Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
- 2000
|
|
34
|
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
– Pawel Gajer, Michael T. Goodrich, Stephen G. Kobourov
- 2000
|
|
3
|
Planarity testing and optimal edge insertion with embedding constraints
– Carsten Gutwenger, Karsten Klein, Petra Mutzel
- 2008
|
|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
|
PQ Trees, PC Trees, and Planar Graphs
– Wen-Lian Hsu, Ross M. McConnell
- 2001
|
|
3
|
I/O-Efficient Planar Separators and Applications
– Norbert Zeh
- 2001
|
|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
5
|
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
– Wen-lian Hsu
- 1995
|
