The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Temporal logic replication for dynamically reconfigurable FPGA partitioning
Proceedings of the 2002 international symposium on Physical design
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection
Journal of Global Optimization
Improved results for directed multicut
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Randomized Algorithm for Flow Shop Scheduling
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the k-multicut problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Integrality gaps for sparsest cut and minimum linear arrangement problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An O(√n)-approximation algorithm for directed sparsest cut
Information Processing Letters
On the max-flow min-cut ratio for directed multicommodity flows
Theoretical Computer Science
On conditions for constant throughput in wireless networks
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
The multi-multiway cut problem
Theoretical Computer Science
Improved approximation for directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Faster approximation schemes for fractional multicommodity flow problems
ACM Transactions on Algorithms (TALG)
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
On partitioning graphs via single commodity flows
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
IEEE/ACM Transactions on Networking (TON)
Journal of Artificial Intelligence Research
An O(n)-approximation algorithm for directed sparsest cut
Information Processing Letters
Discrete Applied Mathematics
Proceedings of the forty-second ACM symposium on Theory of computing
Region growing for multi-route cuts
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time
SIAM Journal on Computing
Managing data transfers in computer clusters with orchestra
Proceedings of the ACM SIGCOMM 2011 conference
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
SIAM Journal on Computing
Approximate duality of multicommodity multiroute flows and cuts: single source case
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Polynomiality of sparsest cuts with fixed number of sources
Operations Research Letters
A greedy algorithm for multicut and integral multiflow in rooted trees
Operations Research Letters
Unsupervised sparse matrix co-clustering for marketing and sales intelligence
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
A PRG for lipschitz functions of polynomials with applications to sparsest cut
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Structured recursive separator decompositions for planar graphs in linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Maximum edge-disjoint paths in k-sums of graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.02 |