A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Post-mortem black-box correctness tests for basic parallel data structures
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Dominator tree verification and vertex-disjoint paths
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient management of transient station failures in linear radio communication networks with bases
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
The "Not-Too-Heavy Spanning Tree" Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Optimal MST maintenance for transient deletion of every node in planar graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Stability of networks in stretchable graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The weighted spanning tree constraint revisited
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
Research paper: The saga of minimum spanning trees
Computer Science Review
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
Distributed computation of all node replacements of a minimum spanning tree
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |