A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
The maximum concurrent flow problem
Journal of the ACM (JACM)
Improved routing strategies with succinct tables
Journal of Algorithms
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
Decomposing graphs into regions of small diameter
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Routing with polynomial communication-space trade-off
SIAM Journal on Discrete Mathematics
Improved bounds on the max-flow min-cut ratio for multicommodity flows
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
New graph decompositions and fast emulations in hypercubes and butterflies
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth 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
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
New approximation techniques for some ordering problems
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)
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Girth and euclidean distortion
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A lower bound on the distortion of embedding planar metrics into Euclidean space
Proceedings of the eighteenth annual symposium on Computational geometry
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On average distortion of embedding metrics into the line and into L1
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
Efficient location area planning for personal communication systems
Proceedings of the 9th annual international conference on Mobile computing and networking
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A tight upper bound on the probabilistic embedding of series-parallel graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On conditions for constant throughput in wireless networks
ACM Transactions on Sensor Networks (TOSN)
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
Efficient location area planning for personal communication systems
IEEE/ACM Transactions on Networking (TON)
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
An improved approximation ratio for the minimum linear arrangement problem
Information Processing Letters
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Metric clustering via consistent labeling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing
Randomly removing g handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
Journal of the ACM (JACM)
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Hard metrics from Cayley graphs of Abelian groups
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Good quality virtual realization of unit ball graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
How to complete a doubling metric
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Randomly removing g handles at once
Computational Geometry: Theory and Applications
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Flow-cut gaps for integer and fractional multiflows
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
Vertex sparsifiers: new results from old techniques
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
SIAM Journal on Discrete Mathematics
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fault-tolerant spanners: better and simpler
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized compact routing in decomposable metrics
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Quantum Information & Computation
Multicommodity flows and cuts in polymatroidal networks
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Compact routing for graphs excluding a fixed minor
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Multi-way spectral partitioning and higher-order cheeger inequalities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast balanced partitioning is hard even on grids and trees
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A node-capacitated okamura-seymour theorem
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.00 |