 | 2012 |
| 58 |  | James R. Lee,
Arnaud de Mesmay,
Mohammad Moharrami:
Dimension reduction for finite trees in l1.
SODA 2012: 43-50 |
| 57 |  | James R. Lee,
Shayan Oveis Gharan,
Luca Trevisan:
Multi-way spectral partitioning and higher-order cheeger inequalities.
STOC 2012: 1117-1130 |
| 2011 |
| 56 |  | Jian Ding,
James R. Lee,
Yuval Peres:
Cover times, blanket times, and majorizing measures.
STOC 2011: 61-70 |
| 55 |  | James R. Lee,
Anastasios Sidiropoulos:
Near-optimal distortion bounds for embedding doubling spaces into L1.
STOC 2011: 765-772 |
| 54 |  | Sanjeev Arora,
James R. Lee,
Sushant Sachdeva:
A Reformulation of the Arora-Rao-Vazirani Structure Theorem
CoRR abs/1102.1456: (2011) |
| 53 |  | James R. Lee,
Arnaud de Mesmay,
Mohammad Moharrami:
Dimension reduction for finite trees in L_1
CoRR abs/1108.2290: (2011) |
| 52 |  | James R. Lee,
Shayan Oveis Gharan,
Luca Trevisan:
Multi-way spectral partitioning and higher-order Cheeger inequalities
CoRR abs/1111.1055: (2011) |
| 51 |  | Alexander Jaffe,
James R. Lee,
Mohammad Moharrami:
On the Optimality of Gluing over Scales.
Discrete & Computational Geometry 46(2): 270-282 (2011) |
| 50 |  | Yael Dekel,
James R. Lee,
Nathan Linial:
Eigenvectors of random graphs: Nodal Domains.
Random Struct. Algorithms 39(1): 39-58 (2011) |
| 2010 |
| 49 |  | James R. Lee,
Anastasios Sidiropoulos:
Genus and the Geometry of the Cut Graph.
SODA 2010: 193-201 |
| 48 |  | James R. Lee,
Mohammad Moharrami:
Bilipschitz snowflakes and metrics of negative type.
STOC 2010: 621-630 |
| 47 |  | Glencora Borradaile,
James R. Lee,
Anastasios Sidiropoulos:
Randomly removing g handles at once
CoRR abs/1003.1426: (2010) |
| 46 |  | Jian Ding,
James R. Lee,
Yuval Peres:
Cover times, blanket times, and majorizing measures
CoRR abs/1004.4371: (2010) |
| 45 |  | Jonathan A. Kelner,
James R. Lee,
Gregory N. Price,
Shang-Hua Teng:
Metric uniformization and spectral bounds for graphs
CoRR abs/1008.3594: (2010) |
| 44 |  | Venkatesan Guruswami,
James R. Lee,
Alexander A. Razborov:
Almost Euclidean subspaces of l 1N VIA expander codes.
Combinatorica 30(1): 47-68 (2010) |
| 43 |  | Glencora Borradaile,
James R. Lee,
Anastasios Sidiropoulos:
Randomly removing g handles at once.
Comput. Geom. 43(8): 655-662 (2010) |
| 42 |  | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
Discrete & Computational Geometry 43(2): 346-362 (2010) |
| 41 |  | Punyashloka Biswal,
James R. Lee,
Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows.
J. ACM 57(3): (2010) |
| 40 |  | James R. Lee,
Christopher Umans:
Special Section On Foundations of Computer Science.
SIAM J. Comput. 39(6): 2397 (2010) |
| 2009 |
| 39 |  | Alexander Jaffe,
James R. Lee,
Mohammad Moharrami:
On the Optimality of Gluing over Scales.
APPROX-RANDOM 2009: 190-201 |
| 38 |  | Jonathan A. Kelner,
James R. Lee,
Gregory N. Price,
Shang-Hua Teng:
Higher Eigenvalues of Graphs.
FOCS 2009: 735-744 |
| 37 |  | James R. Lee,
Anastasios Sidiropoulos:
On the geometry of graphs with a forbidden minor.
STOC 2009: 245-254 |
| 36 |  | Glencora Borradaile,
James R. Lee,
Anastasios Sidiropoulos:
Randomly removing g handles at once.
Symposium on Computational Geometry 2009: 371-376 |
| 35 |  | James R. Lee,
Anastasios Sidiropoulos:
Pathwidth, trees, and random embeddings
CoRR abs/0910.1409: (2009) |
| 34 |  | James R. Lee:
Volume Distortion for Subsets of Euclidean Spaces.
Discrete & Computational Geometry 41(4): 590-615 (2009) |
| 2008 |
| 33 |  | Venkatesan Guruswami,
James R. Lee,
Avi Wigderson:
Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.
APPROX-RANDOM 2008: 444-454 |
| 32 |  | Punyashloka Biswal,
James R. Lee,
Satish Rao:
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.
FOCS 2008: 751-760 |
| 31 |  | Amit Chakrabarti,
Alexander Jaffe,
James R. Lee,
Justin Vincent:
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.
FOCS 2008: 761-770 |
| 30 |  | Venkatesan Guruswami,
James R. Lee,
Alexander A. Razborov:
Almost Euclidean subspaces of lN1 via expander codes.
SODA 2008: 353-362 |
| 29 |  | James R. Lee:
Graph Bandwidth.
Encyclopedia of Algorithms 2008 |
| 28 |  | Punyashloka Biswal,
James R. Lee,
Satish Rao:
Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
CoRR abs/0808.0148: (2008) |
| 27 |  | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 15(060): (2008) |
| 26 |  | Uriel Feige,
MohammadTaghi Hajiaghayi,
James R. Lee:
Improved Approximation Algorithms for Minimum Weight Vertex Separators.
SIAM J. Comput. 38(2): 629-657 (2008) |
| 2007 |
| 25 |  | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
APPROX-RANDOM 2007: 228-241 |
| 24 |  | Yael Dekel,
James R. Lee,
Nathan Linial:
Eigenvectors of Random Graphs: Nodal Domains.
APPROX-RANDOM 2007: 436-448 |
| 23 |  | Bo Brinkman,
Adriana Karagiozova,
James R. Lee:
Vertex cuts, random walks, and dimension reduction in series-parallel graphs.
STOC 2007: 621-630 |
| 22 |  | Robert Krauthgamer,
James R. Lee:
The intrinsic dimensionality of graphs.
Combinatorica 27(5): 551-585 (2007) |
| 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 |