A data structure for dynamic trees
Journal of Computer and System Sciences
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fully dynamic algorithms for 2-edge connectivity
SIAM Journal on Computing
Separator based sparsification for dynamic planar graph algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved data structures for fully dynamic biconnectivity
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Using randomized sparsification to approximate minimum cuts
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Approximating Minimum Cuts under Insertions
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Perspectives on database theory
ACM SIGACT News
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An empirical study of dynamic graph algorithms
Journal of Experimental Algorithmics (JEA)
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
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Experimental analysis of dynamic algorithms for the single source shortest paths problem
Journal of Experimental Algorithmics (JEA)
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
An empirical study of dynamic graph algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On certificates and lookahead in dynamic graph problems
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Experimental analysis of dynamic minimum spanning tree algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal fully-dynamic graph connectivity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Fully Dynamic Maintenance of k-Connectivity in Parallel
IEEE Transactions on Parallel and Distributed Systems
Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
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 Dynamic Algorithms for Transitive Closure
Journal of Experimental Algorithmics (JEA)
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
Theoretical Computer Science
Journal of Experimental Algorithmics (JEA)
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
Theoretical Computer Science
| Hi-index | 0.00 |