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
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized dynamic graph algorithms with polylogarithmic time per operation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
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)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Minimizing Diameters of Dynamic Trees
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Data structures for on-line updating of minimum spanning trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs
Unique maximum matching algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Kinetic connectivity of rectangles
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Minimum cuts in near-linear time
Journal of the ACM (JACM)
Near-optimal fully-dynamic graph connectivity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Kinetic connectivity for unit disks
Proceedings of the sixteenth annual symposium on Computational geometry
Simplified kinetic connectivity for rectangles and hypercubes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pattern matching for sets of segments
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Dynamic subgraph connectivity with geometric applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
The Dynamic Complexity of Transitive Closure Is In DynTC0
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Dynamic Graph Algorithms with Applications
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Voronoi Diagrams for Moving Disks and Applications
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Fully Dynamic Clustering of Metric Data Sets
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Incomplete Directed Perfect Phylogeny
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The dynamic complexity of transitive closure is in DynTC0
Theoretical Computer Science - Database theory
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Recognition of some perfectly orderable graph classes
Discrete Applied Mathematics
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
A new algorithm for normal dominance constraints
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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)
Theoretical Computer Science
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Optimal algorithms for detecting network stability
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms
Constraint reasoning and Kernel clustering for pattern decomposition with scaling
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint 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
Dynamic complexity theory revisited
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |