The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
SIAM Journal on Computing
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh 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
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On Euclidean Embeddings and Bandwidth Minimization
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
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
The all-or-nothing multicommodity flow problem
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
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
On the impossibility of dimension reduction in l1
Journal of the ACM (JACM)
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Plane embeddings of planar graph metrics
Proceedings of the twenty-second annual symposium on Computational geometry
Volume distortion for subsets of Euclidean spaces: extended abstract
Proceedings of the twenty-second annual symposium on Computational geometry
Metric structures in L1: dimension, snowflakes, and average distortion
European Journal of Combinatorics
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
European Journal of Combinatorics
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Embedding metric spaces in their intrinsic dimension
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
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
On low dimensional local embeddings
SODA '09 Proceedings of the twentieth 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
On the Optimality of Gluing over Scales
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
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)
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
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
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
Volume in general metric spaces
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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
Bandwidth and low dimensional embedding
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Dimensionality reduction: beyond the Johnson-Lindenstrauss bound
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Embedding bounded bandwidth graphs into ℓ1
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
Bandwidth and low dimensional embedding
Theoretical Computer Science
On the embeddability of random walk distances
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |