A data structure for dynamic trees
Journal of Computer and System Sciences
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sampling to provide or to bound: with applications to fully dynamic graph algorithms
Proceedings of the workshop on Randomized algorithms and computation
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Dynamic subgraph connectivity with geometric applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Finding planar regions in a terrain: in practice and with a guarantree
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Single-strip triangulation of manifolds with arbitrary topology
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Computing large planar regions in terrains, with an application to fracture surfaces
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Lower bounds for dynamic connectivity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Finding the shortest bottleneck edge in a parametric minimum spanning tree
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On dynamic bit-probe complexity
Theoretical Computer Science
Dynamic connectivity for axis-parallel rectangles
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An algorithm for computing simple k-factors
Information Processing Letters
Efficient algorithms for computing Reeb graphs
Computational Geometry: Theory and Applications
Computing the Map of Geometric Minimal Cuts
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Topology control in constant rate mobile ad hoc networks
Wireless Networks
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
New data structures for subgraph connectivity
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
GD'10 Proceedings of the 18th international conference on Graph drawing
Don't rush into a union: take time to find your roots
Proceedings of the forty-third annual ACM symposium on Theory of computing
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Analyzing graph structure via linear measurements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On dynamic bit-probe complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Improved maintenance of molecular surfaces using dynamic graph connectivity
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A deterministic o(m log m) time algorithm for the reeb graph
Proceedings of the twenty-eighth annual symposium on Computational geometry
Research paper: The saga of minimum spanning trees
Computer Science Review
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |