A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Introduction to algorithms
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
Computing edge-connectivity in multigraphs and capacitated graphs
SIAM Journal on Discrete Mathematics
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth 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 randomized sparsification to approximate minimum cuts
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A new approach to the minimum cut problem
Journal of the ACM (JACM)
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
Finding maximum flows in undirected graphs seems easier than bipartite matching
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Better random sampling algorithms for flows in undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximating the minimum bisection size (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Random sampling in residual graphs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An analysis of graph cut size for transductive learning
ICML '06 Proceedings of the 23rd international conference on Machine learning
A combinatorial, primal-dual approach to semidefinite programs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Graph sparsification by effective resistances
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding sparse cuts locally using evolving sets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Proceedings of the forty-first annual ACM symposium on Theory of computing
Graph partitioning using single commodity flows
Journal of the ACM (JACM)
Graph Sparsification in the Semi-streaming Model
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On computing minimum (s,t)-cuts in digraphs
Information Processing Letters
Extensions and limits to vertex sparsification
Proceedings of the forty-second ACM symposium on Theory of computing
Subgraph sparsification and nearly optimal ultrasparsifiers
Proceedings of the forty-second ACM symposium on Theory of computing
Sparse reliable graph backbones
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on 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
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
SlimCuts: graphcuts for high resolution images using graph reduction
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Spectral Sparsification of Graphs
SIAM Journal on Computing
Sparse reliable graph backbones
Information and Computation
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Spectral sparsification via random spanners
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Analyzing graph structure via linear measurements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On the communication and streaming complexity of maximum bipartite matching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
How user behavior is related to social affinity
Proceedings of the fifth ACM international conference on Web search and data mining
The laplacian paradigm: emerging algorithms for massive graphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Graph sketches: sparsification, spanners, and subgraphs
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Graph Sparsification by Effective Resistances
SIAM Journal on Computing
A matrix hyperbolic cosine algorithm and applications
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Ranking and sparsifying a connection graph
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Graph coarsening for path finding in cybersecurity graphs
Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
Spectral sparsification of graphs: theory and algorithms
Communications of the ACM
| Hi-index | 0.02 |