Data structures and network algorithms
Data structures and network algorithms
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
Information Processing Letters
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphs
SIAM Journal on Computing
Applications of a poset representation to edge connectivity and graph rigidity
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A linear time 2 + &&egr; approximation algorithm for edge connectivity
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth 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
Improved approximation algorithms for uniform connectivity problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Approximating s-t minimum cuts in Õ(n2) time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Minimum cuts in near-linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
Combining labeled and unlabeled data with co-training
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Implementing a fully polynomial time approximation scheme for all terminal network reliability
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the Number of Minimum Cuts in a Graph
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Weighted random sampling with a reservoir
Information Processing Letters
Efficient algorithms for computing all low s-t edge connectivities and related problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Perfect matchings via uniform sampling in regular bipartite graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Graph Sparsification in the Semi-streaming Model
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Weighted random sampling with a reservoir
Information Processing Letters
Perfect matchings via uniform sampling in regular bipartite graphs
ACM Transactions on Algorithms (TALG)
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
Local graph sparsification for scalable clustering
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Analyzing graph structure via linear measurements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Graph sketches: sparsification, spanners, and subgraphs
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Hi-index | 0.00 |