|
3
|
Fully Dynamic Planarity Testing with Applications
– Zvi Galil, et al.
|
|
62
|
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph
– David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert E. Tarjan, Jeffery Westbrook, Moti Yung
- 1992
|
|
|
Persistence, Offline Algorithms, and Space Compaction
– David Eppstein
- 1991
|
|
12
|
I/O-Efficient Algorithms for Shortest Path Related Problems
– Norbert Ralf Zeh
- 2002
|
|
|
Planarity Testing and Embedding
– Pier Francesco Cortese, Maurizio Patrignani
- 2004
|
|
16
|
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
– David Eppstein
- 1994
|
|
15
|
Finding the k Smallest Spanning Trees
– David Eppstein
- 1992
|
|
13
|
Swapping a failing edge of a single source shortest paths tree is good and fast
– Enrico Nardelli, Guido Proietti, Peter Widmayer
- 1999
|
|
73
|
Ambivalent Data Structures For Dynamic 2-Edge-Connectivity And k Smallest Spanning Trees
– Greg N. Frederickson
- 1991
|
|
48
|
Dynamic Graph Algorithms
– David Eppstein, Zvi Galil, Giuseppe F. Italiano
- 1999
|
|
65
|
Nearest Common Ancestors: A survey and a new distributed algorithm
– Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe
- 2002
|
|
2
|
Combine and Conquer
– Robert F. Cohen, Robert F. Cohen, Roberto Tamassia, Roberto Tamassia
- 1992
|
|
2
|
Improved Data Structures for Fully Dynamic Biconnectivity
– Monika Rauch Henzinger
- 1997
|
|
3
|
I/O-Efficient Planar Separators and Applications
– Norbert Zeh
- 2001
|
|
6
|
Fully Dynamic Biconnectivity in Graphs
– M. R. Henzinger
- 1992
|
|
3
|
Data Structures for Two-Edge Connectivity in Planar Graphs
– John Hershberger, Monika Rauch, Subhash Suri
- 1994
|
|
17
|
An O(m log n)-Time Algorithm for the Maximal Planar Subgraph Problem
– Jiazhen Cai, Xiaofeng Han, Robert E. Tarjan
- 1993
|
|
16
|
Fast Incremental Planarity Testing
– Jeffery Westbrook
- 1992
|
|
|
PQ Trees, PC Trees, and Planar Graphs
– Wen-Lian Hsu, Ross M. McConnell
- 2001
|
