Travelled to:1 × Finland
9 × USA
Collaborated with:A.Sidiropoulos R.Krauthgamer M.Moharrami P.Raghavendra D.Steurer M.Mendel S.O.Gharan L.Trevisan J.Ding Y.Peres B.Brinkman A.Karagiozova S.Arora A.Naor U.Feige M.T.Hajiaghayi
Talks about:graph (3) distort (2) vertex (2) bound (2) time (2) cut (2) semidefinit (1) bilipschitz (1) forbidden (1) euclidean (1)
Person: James R. Lee
DBLP: Lee:James_R=
Contributed to:
20152013201220112010200920072005
20042003Wrote 12 papers:
- STOC-2015-LeeRS #bound #programming
- Lower Bounds on the Size of Semidefinite Programming Relaxations (JRL, PR, DS), pp. 567–576.
- STOC-2013-LeeMM #theorem
- A node-capacitated okamura-seymour theorem (JRL, MM, MM), pp. 495–504.
- STOC-2012-LeeGT #clustering #higher-order #multi
- Multi-way spectral partitioning and higher-order cheeger inequalities (JRL, SOG, LT), pp. 1117–1130.
- STOC-2011-DingLP #metric
- Cover times, blanket times, and majorizing measures (JD, JRL, YP), pp. 61–70.
- STOC-2011-LeeS #bound
- Near-optimal distortion bounds for embedding doubling spaces into L1 (JRL, AS), pp. 765–772.
- STOC-2010-LeeM #metric
- Bilipschitz snowflakes and metrics of negative type (JRL, MM), pp. 621–630.
- STOC-2009-LeeS #geometry #graph #on the
- On the geometry of graphs with a forbidden minor (JRL, AS), pp. 245–254.
- STOC-2007-BrinkmanKL #graph #random #reduction
- Vertex cuts, random walks, and dimension reduction in series-parallel graphs (BB, AK, JRL), pp. 621–630.
- STOC-2005-AroraLN
- Euclidean distortion and the sparsest cut (SA, JRL, AN), pp. 553–562.
- STOC-2005-FeigeHL #algorithm #approximate
- Improved approximation algorithms for minimum-weight vertex separators (UF, MTH, JRL), pp. 563–572.
- ICALP-2004-KrauthgamerL #black box #complexity #nearest neighbour
- The Black-Box Complexity of Nearest Neighbor Search (RK, JRL), pp. 858–869.
- STOC-2003-KrauthgamerL #graph
- The intrinsic dimensionality of graphs (RK, JRL), pp. 438–447.