 | 2009 |
|---|
| 37 |       | Alexander Jaffe,
James R. Lee,
Mohammad Moharrami:
On the Optimality of Gluing over Scales.
APPROX-RANDOM 2009: 190-201 |
| 36 | | James R. Lee,
Anastasios Sidiropoulos:
On the geometry of graphs with a forbidden minor.
STOC 2009: 245-254 |
| 35 | | Glencora Borradaile,
James R. Lee,
Anastasios Sidiropoulos:
Randomly removing g handles at once.
Symposium on Computational Geometry 2009: 371-376 |
| 34 | | James R. Lee,
Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings
CoRR abs/0910.1409: (2009) |
| 33 | | James R. Lee:
Volume Distortion for Subsets of Euclidean Spaces.
Discrete & Computational Geometry 41(4): 590-615 (2009) |
| 2008 |
|---|
| 32 | | Venkatesan Guruswami,
James R. Lee,
Avi Wigderson:
Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.
APPROX-RANDOM 2008: 444-454 |
| 31 | | Punyashloka Biswal,
James R. Lee,
Satish Rao:
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.
FOCS 2008: 751-760 |
| 30 | | Amit Chakrabarti,
Alexander Jaffe,
James R. Lee,
Justin Vincent:
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.
FOCS 2008: 761-770 |
| 29 | | Venkatesan Guruswami,
James R. Lee,
Alexander A. Razborov:
Almost Euclidean subspaces of lN1 via expander codes.
SODA 2008: 353-362 |
| 28 | | James R. Lee:
Graph Bandwidth.
Encyclopedia of Algorithms 2008 |
| 27 | | Punyashloka Biswal,
James R. Lee,
Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
CoRR abs/0808.0148: (2008) |
| 26 | | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 15(060): (2008) |
| 25 | | Uriel Feige,
MohammadTaghi Hajiaghayi,
James R. Lee:
Improved Approximation Algorithms for Minimum Weight Vertex Separators.
SIAM J. Comput. 38(2): 629-657 (2008) |
| 2007 |
|---|
| 24 | | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
APPROX-RANDOM 2007: 228-241 |
| 23 | | Yael Dekel,
James R. Lee,
Nathan Linial:
Eigenvectors of Random Graphs: Nodal Domains.
APPROX-RANDOM 2007: 436-448 |
| 22 | | Bo Brinkman,
Adriana Karagiozova,
James R. Lee:
Vertex cuts, random walks, and dimension reduction in series-parallel graphs.
STOC 2007: 621-630 |
| 21 | | Sanjeev Arora,
James R. Lee,
Assaf Naor:
Fréchet Embeddings of Negative Type Metrics.
Discrete & Computational Geometry 38(4): 726-739 (2007) |
| 20 | | Venkatesan Guruswami,
James R. Lee,
Alexander A. Razborov:
Almost Euclidean subspaces of $\ell_1^N$ via expander codes.
Electronic Colloquium on Computational Complexity (ECCC) 14(086): (2007) |
| 19 | | Uriel Feige,
James R. Lee:
An improved approximation ratio for the minimum linear arrangement problem.
Inf. Process. Lett. 101(1): 26-29 (2007) |
| 2006 |
|---|
| 18 | | Robert Krauthgamer,
James R. Lee:
Algorithms on negatively curved spaces.
FOCS 2006: 119-132 |
| 17 | | James R. Lee,
Assaf Naor:
Lp metrics on the Heisenberg group and the Goemans-Linial conjecture.
FOCS 2006: 99-108 |
| 16 | | James R. Lee,
Assaf Naor,
Yuval Peres:
Trees and Markov convexity.
SODA 2006: 1028-1037 |
| 15 | | James R. Lee:
Volume distortion for subsets of Euclidean spaces: extended abstract.
Symposium on Computational Geometry 2006: 207-216 |
| 2005 |
|---|
| 14 | | James R. Lee:
On distance scales, embeddings, and efficient relaxations of the cut cone.
SODA 2005: 92-101 |
| 13 | | Sanjeev Arora,
James R. Lee,
Assaf Naor:
Euclidean distortion and the sparsest cut.
STOC 2005: 553-562 |
| 12 | | Uriel Feige,
Mohammad Taghi Hajiaghayi,
James R. Lee:
Improved approximation algorithms for minimum-weight vertex separators.
STOC 2005: 563-572 |
| 11 | | James R. Lee,
Manor Mendel,
Assaf Naor:
Metric structures in L1: dimension, snowflakes, and average distortion.
Eur. J. Comb. 26(8): 1180-1190 (2005) |
| 10 | | Robert Krauthgamer,
James R. Lee:
The black-box complexity of nearest-neighbor search.
Theor. Comput. Sci. 348(2-3): 262-276 (2005) |
| 2004 |
|---|
| 9 | | Robert Krauthgamer,
James R. Lee,
Manor Mendel,
Assaf Naor:
Measured Descent: A New Embedding Method for Finite Metrics.
FOCS 2004: 434-443 |
| 8 | | Robert Krauthgamer,
James R. Lee:
The Black-Box Complexity of Nearest Neighbor Search.
ICALP 2004: 858-869 |
| 7 | | James R. Lee,
Manor Mendel,
Assaf Naor:
Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.
LATIN 2004: 401-412 |
| 6 | | Robert Krauthgamer,
James R. Lee:
Navigating nets: simple algorithms for proximity search.
SODA 2004: 798-807 |
| 5 | | Robert Krauthgamer,
James R. Lee,
Manor Mendel,
Assaf Naor:
Measured descent: A new embedding method for finite metrics
CoRR abs/cs/0412008: (2004) |
| 4 | | Guy Kortsarz,
Robert Krauthgamer,
James R. Lee:
Hardness of Approximation for Vertex-Connectivity Network Design Problems.
SIAM J. Comput. 33(3): 704-720 (2004) |
| 2003 |
|---|
| 3 | | Anupam Gupta,
Robert Krauthgamer,
James R. Lee:
Bounded Geometries, Fractals, and Low-Distortion Embeddings.
FOCS 2003: 534-543 |
| 2 | | Robert Krauthgamer,
James R. Lee:
The intrinsic dimensionality of graphs.
STOC 2003: 438-447 |
| 2002 |
|---|
| 1 | | Guy Kortsarz,
Robert Krauthgamer,
James R. Lee:
Hardness of Approximation for Vertex-Connectivity Network-Design Problems.
APPROX 2002: 185-199 |
