|
5
|
Poutré: Alpha-algorithms for incremental planarity testing (preliminary version). STOC
– Johannes A La
- 1994
|
|
11
|
Lower bounds for dynamic connectivity
– Erik D. Demaine
- 2004
|
|
10
|
Amnon Nissenzweig: Sparsification - a technique for speeding up dynamic graph algorithms
– David Eppstein, Zvi Galil, Giuseppe F Italiano
- 1997
|
|
3
|
Valerie King: Randomized dynamic graph algorithms with polylogarithmic time per operation. STOC
– Monika Rauch Henzinger
- 1995
|
|
3
|
Endre Tarjan, Jeffery Westbrook, Moti Yung: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph
– David Eppstein, Giuseppe F Italiano, Roberto Tamassia, Robert
- 1992
|
|
3
|
Thorup: Near-optimal fully-dynamic graph connectivity
– Mikkel
|
|
4
|
de Lichtenberg, Mikkel Thorup: Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
– Jacob Holm, Kristian
- 2001
|
|
3
|
Thorup: Decremental Dynamic Connectivity
– Mikkel
- 1999
|
|
3
|
Thorup: Fully-dynamic min-cut
– Mikkel
|
|
5
|
Decremental 2- and 3- connectivity of planar graphs. Algorithmica
– D Giammarresi, G F Italiano
- 1996
|
|
76
|
Graph minors XX. Wagner's conjecture
– Neil Robertson, P. D. Seymour
- 2004
|
|
2
|
Poutré, Monika Rauch: Fully Dynamic Planarity Testing
– Giuseppe F Italiano, Johannes A La
- 1993
|
|
2
|
R.Grossi Optimal Worst-case Operations for Implicit Cache-Oblivious Search Trees
– G Franseschini
|
|
2
|
I.Munro, R.Raman, V.Raman, S.Rao Representing Trees of Higher Degree, Algorithmica 43(4
– E Demaine D Benoit
|
|
2
|
I.Munro Eifficent Suffix Trees on Secondary Storage
– D Clark
- 1996
|
|
61
|
Membership in constant time and almost-minimum space
– A Brodnik, J I Munro
- 1999
|
|
7
|
A simplified and dynamic unified structure
– Mihai Bădoiu, Erik D. Demaine
- 2004
|
|
36
|
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
– Richard Cole
|
|
27
|
Sequential access in splay trees takes linear time
– R E Tarjan
- 1985
|
