James R. Lee

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
i13		James R. Lee, Mohammad Moharrami: A lower bound on dimension reduction for trees in \ell_1. CoRR abs/1302.6542 (2013)
	2012
c31		James R. Lee, Arnaud de Mesmay, Mohammad Moharrami: Dimension reduction for finite trees in l₁. SODA 2012: 43-50
c30		James R. Lee, Shayan Oveis Gharan, Luca Trevisan: Multi-way spectral partitioning and higher-order cheeger inequalities. STOC 2012: 1117-1130
i12		James R. Lee, Manor Mendel, Mohammad Moharrami: A node-capacitated Okamura-Seymour theorem. CoRR abs/1209.2744 (2012)
	2011
j15		Alexander Jaffe, James R. Lee, Mohammad Moharrami: On the Optimality of Gluing over Scales. Discrete & Computational Geometry 46(2): 270-282 (2011)
j14		Yael Dekel, James R. Lee, Nathan Linial: Eigenvectors of random graphs: Nodal Domains. Random Struct. Algorithms 39(1): 39-58 (2011)
c29		Jian Ding, James R. Lee, Yuval Peres: Cover times, blanket times, and majorizing measures. STOC 2011: 61-70
c28		James R. Lee, Anastasios Sidiropoulos: Near-optimal distortion bounds for embedding doubling spaces into L₁. STOC 2011: 765-772
i11		Sanjeev Arora, James R. Lee, Sushant Sachdeva: A Reformulation of the Arora-Rao-Vazirani Structure Theorem. CoRR abs/1102.1456 (2011)
i10		James R. Lee, Arnaud de Mesmay, Mohammad Moharrami: Dimension reduction for finite trees in L_1. CoRR abs/1108.2290 (2011)
i9		James R. Lee, Shayan Oveis Gharan, Luca Trevisan: Multi-way spectral partitioning and higher-order Cheeger inequalities. CoRR abs/1111.1055 (2011)
	2010
j13		Venkatesan Guruswami, James R. Lee, Alexander A. Razborov: Almost Euclidean subspaces of l ₁^N VIA expander codes. Combinatorica 30(1): 47-68 (2010)
j12		Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. Comput. Geom. 43(8): 655-662 (2010)
j11		James R. Lee, Prasad Raghavendra: Coarse Differentiation and Multi-flows in Planar Graphs. Discrete & Computational Geometry 43(2): 346-362 (2010)
j10		Punyashloka Biswal, James R. Lee, Satish Rao: Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. J. ACM 57(3) (2010)
j9		James R. Lee, Christopher Umans: Special Section On Foundations of Computer Science. SIAM J. Comput. 39(6): 2397 (2010)
c27		James R. Lee, Anastasios Sidiropoulos: Genus and the Geometry of the Cut Graph. SODA 2010: 193-201
c26		James R. Lee, Mohammad Moharrami: Bilipschitz snowflakes and metrics of negative type. STOC 2010: 621-630
i8		Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. CoRR abs/1003.1426 (2010)
i7		Jian Ding, James R. Lee, Yuval Peres: Cover times, blanket times, and majorizing measures. CoRR abs/1004.4371 (2010)
i6		Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng: Metric uniformization and spectral bounds for graphs. CoRR abs/1008.3594 (2010)
	2009
j8		James R. Lee: Volume Distortion for Subsets of Euclidean Spaces. Discrete & Computational Geometry 41(4): 590-615 (2009)
c25		Alexander Jaffe, James R. Lee, Mohammad Moharrami: On the Optimality of Gluing over Scales. APPROX-RANDOM 2009: 190-201
c24		Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos: Randomly removing g handles at once. Symposium on Computational Geometry 2009: 371-376
c23		Jonathan A. Kelner, James R. Lee, Gregory N. Price, Shang-Hua Teng: Higher Eigenvalues of Graphs. FOCS 2009: 735-744
c22		James R. Lee, Anastasios Sidiropoulos: On the geometry of graphs with a forbidden minor. STOC 2009: 245-254
i5		James R. Lee, Anastasios Sidiropoulos: Pathwidth, trees, and random embeddings. CoRR abs/0910.1409 (2009)
	2008
j7		Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee: Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008)
c21		Venkatesan Guruswami, James R. Lee, Avi Wigderson: Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. APPROX-RANDOM 2008: 444-454
c20		Punyashloka Biswal, James R. Lee, Satish Rao: Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. FOCS 2008: 751-760
c19		Amit Chakrabarti, Alexander Jaffe, James R. Lee, Justin Vincent: Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. FOCS 2008: 761-770
c18		Venkatesan Guruswami, James R. Lee, Alexander A. Razborov: Almost Euclidean subspaces of l^N₁ via expander codes. SODA 2008: 353-362
r1		James R. Lee: Graph Bandwidth. Encyclopedia of Algorithms 2008
i4		Punyashloka Biswal, James R. Lee, Satish Rao: Eigenvalue bounds, spectral partitioning, and metrical deformations via flows. CoRR abs/0808.0148 (2008)
i3		James R. Lee, Prasad Raghavendra: Coarse Differentiation and Multi-flows in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 15(060) (2008)
	2007
j6		Robert Krauthgamer, James R. Lee: The intrinsic dimensionality of graphs. Combinatorica 27(5): 551-585 (2007)
j5		Sanjeev Arora, James R. Lee, Assaf Naor: Fréchet Embeddings of Negative Type Metrics. Discrete & Computational Geometry 38(4): 726-739 (2007)
j4		Uriel Feige, James R. Lee: An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1): 26-29 (2007)
c17		James R. Lee, Prasad Raghavendra: Coarse Differentiation and Multi-flows in Planar Graphs. APPROX-RANDOM 2007: 228-241
c16		Yael Dekel, James R. Lee, Nathan Linial: Eigenvectors of Random Graphs: Nodal Domains. APPROX-RANDOM 2007: 436-448
c15		Bo Brinkman, Adriana Karagiozova, James R. Lee: Vertex cuts, random walks, and dimension reduction in series-parallel graphs. STOC 2007: 621-630
i2		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)
	2006
c14		James R. Lee: Volume distortion for subsets of Euclidean spaces: extended abstract. Symposium on Computational Geometry 2006: 207-216
c13		James R. Lee, Assaf Naor: Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. FOCS 2006: 99-108
c12		Robert Krauthgamer, James R. Lee: Algorithms on negatively curved spaces. FOCS 2006: 119-132
c11		James R. Lee, Assaf Naor, Yuval Peres: Trees and Markov convexity. SODA 2006: 1028-1037
	2005
j3		James R. Lee, Manor Mendel, Assaf Naor: Metric structures in L₁: dimension, snowflakes, and average distortion. Eur. J. Comb. 26(8): 1180-1190 (2005)
j2		Robert Krauthgamer, James R. Lee: The black-box complexity of nearest-neighbor search. Theor. Comput. Sci. 348(2-3): 262-276 (2005)
c10		James R. Lee: On distance scales, embeddings, and efficient relaxations of the cut cone. SODA 2005: 92-101
c9		Sanjeev Arora, James R. Lee, Assaf Naor: Euclidean distortion and the sparsest cut. STOC 2005: 553-562
c8		Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee: Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572
	2004
j1		Guy Kortsarz, Robert Krauthgamer, James R. Lee: Hardness of Approximation for Vertex-Connectivity Network Design Problems. SIAM J. Comput. 33(3): 704-720 (2004)
c7		Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor: Measured Descent: A New Embedding Method for Finite Metrics. FOCS 2004: 434-443
c6		Robert Krauthgamer, James R. Lee: The Black-Box Complexity of Nearest Neighbor Search. ICALP 2004: 858-869
c5		James R. Lee, Manor Mendel, Assaf Naor: Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. LATIN 2004: 401-412
c4		Robert Krauthgamer, James R. Lee: Navigating nets: simple algorithms for proximity search. SODA 2004: 798-807
i1		Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor: Measured descent: A new embedding method for finite metrics. CoRR abs/cs/0412008 (2004)
	2003
c3		Anupam Gupta, Robert Krauthgamer, James R. Lee: Bounded Geometries, Fractals, and Low-Distortion Embeddings. FOCS 2003: 534-543
c2		Robert Krauthgamer, James R. Lee: The intrinsic dimensionality of graphs. STOC 2003: 438-447
	2002
c1		Guy Kortsarz, Robert Krauthgamer, James R. Lee: Hardness of Approximation for Vertex-Connectivity Network-Design Problems. APPROX 2002: 185-199

Coauthor Index

1	Sanjeev Arora	[i11] [j5] [c9]
2	Punyashloka Biswal	[j10] [c20] [i4]
3	Glencora Borradaile	[j12] [i8] [c24]
4	Bo Brinkman	[c15]
5	Amit Chakrabarti	[c19]
6	Yael Dekel	[j14] [c16]
7	Jian Ding	[c29] [i7]
8	Uriel Feige	[j7] [j4] [c8]
9	Shayan Oveis Gharan	[c30] [i9]
10	Anupam Gupta	[c3]
11	Venkatesan Guruswami	[j13] [c21] [c18] [i2]
12	Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi)	[j7] [c8]
13	Alexander Jaffe	[j15] [c25] [c19]
14	Adriana Karagiozova	[c15]
15	Jonathan A. Kelner	[i6] [c23]
16	Guy Kortsarz	[j1] [c1]
17	Robert Krauthgamer	[j6] [c12] [j2] [j1] [c7] [c6] [c4] [i1] [c3] [c2] [c1]
18	Nathan Linial (Nati Linial)	[j14] [c16]
19	Manor Mendel	[i12] [j3] [c7] [c5] [i1]
20	Arnaud de Mesmay	[c31] [i10]
21	Mohammad Moharrami	[i13] [c31] [i12] [j15] [i10] [c26] [c25]
22	Assaf Naor	[j5] [c13] [c11] [j3] [c9] [c7] [c5] [i1]
23	Yuval Peres	[c29] [i7] [c11]
24	Gregory N. Price	[i6] [c23]
25	Prasad Raghavendra	[j11] [i3] [c17]
26	Satish Rao	[j10] [c20] [i4]
27	Alexander A. Razborov	[j13] [c18] [i2]
28	Sushant Sachdeva	[i11]
29	Anastasios Sidiropoulos	[c28] [j12] [c27] [i8] [c24] [c22] [i5]
30	Shang-Hua Teng	[i6] [c23]
31	Luca Trevisan	[c30] [i9]
32	Christopher Umans	[j9]
33	Justin Vincent	[c19]
34	Avi Wigderson	[c21]

Last update Wed May 22 18:04:11 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page