James R. Lee

According to our database1, James R. Lee authored at least 61 papers between 2003 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Flow-Cut Gaps and Face Covers in Planar Graphs.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Metrical task systems on trees via mirror descent and unfair gluing.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Pure entropic regularization for metrical task systems.
Proceedings of the Conference on Learning Theory, 2019

2018
k-server via multiscale entropic regularization.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Fusible HSTs and the Randomized k-Server Conjecture.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Covering the Large Spectrum and Generalized Riesz Products.
SIAM J. Discrete Math., 2017

Separators in Region Intersection Graphs.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Graph Bandwidth.
Encyclopedia of Algorithms, 2016

Approximate Constraint Satisfaction Requires Large LP Relaxations.
J. ACM, 2016

2015
A node-capacitated Okamura-Seymour theorem.
Math. Program., 2015

Lower Bounds on the Size of Semidefinite Programming Relaxations.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Talagrand's Convolution Conjecture on Gaussian Space.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities.
J. ACM, 2014

Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements.
Proceedings of the Innovations in Theoretical Computer Science, 2014

On the Power of Symmetric LP and SDP Relaxations.
Proceedings of the IEEE 29th Conference on Computational Complexity, 2014

2013
Dimension Reduction for Finite Trees in ℓ 1.
Discrete & Computational Geometry, 2013

A lower bound on dimension reduction for trees in \ell_1
CoRR, 2013

Pathwidth, trees, and random embeddings.
Combinatorica, 2013

On the 2-sum embedding conjecture.
Proceedings of the Symposuim on Computational Geometry 2013, 2013

2012
Multi-way spectral partitioning and higher-order cheeger inequalities.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Dimension reduction for finite trees in l1.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Eigenvectors of random graphs: Nodal Domains.
Random Struct. Algorithms, 2011

On the Optimality of Gluing over Scales.
Discrete & Computational Geometry, 2011

Dimension reduction for finite trees in L_1
CoRR, 2011

A Reformulation of the Arora-Rao-Vazirani Structure Theorem
CoRR, 2011

Near-optimal distortion bounds for embedding doubling spaces into L1.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Cover times, blanket times, and majorizing measures.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
Special Section On Foundations of Computer Science.
SIAM J. Comput., 2010

Eigenvalue bounds, spectral partitioning, and metrical deformations via flows.
J. ACM, 2010

Metric uniformization and spectral bounds for graphs
CoRR, 2010

Randomly removing g handles at once.
Comput. Geom., 2010

Almost Euclidean subspaces of l 1N VIA expander codes.
Combinatorica, 2010

Bilipschitz snowflakes and metrics of negative type.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Genus and the Geometry of the Cut Graph.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Volume Distortion for Subsets of Euclidean Spaces.
Discrete & Computational Geometry, 2009

On the geometry of graphs with a forbidden minor.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Higher Eigenvalues of Graphs.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
Graph Bandwidth.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Improved Approximation Algorithms for Minimum Weight Vertex Separators.
SIAM J. Comput., 2008

Coarse Differentiation and Multi-flows in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Almost Euclidean subspaces of lN1 via expander codes.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals.
Proceedings of the Approximation, 2008

2007
An improved approximation ratio for the minimum linear arrangement problem.
Inf. Process. Lett., 2007

Almost Euclidean subspaces of ℓ1N via expander codes.
Electronic Colloquium on Computational Complexity (ECCC), 2007

Fréchet Embeddings of Negative Type Metrics.
Discrete & Computational Geometry, 2007

The intrinsic dimensionality of graphs.
Combinatorica, 2007

Vertex cuts, random walks, and dimension reduction in series-parallel graphs.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Trees and Markov convexity.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Lp metrics on the Heisenberg group and the Goemans-Linial conjecture.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Algorithms on negatively curved spaces.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Volume distortion for subsets of Euclidean spaces: extended abstract.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
The black-box complexity of nearest-neighbor search.
Theor. Comput. Sci., 2005

Metric structures in L1: dimension, snowflakes, and average distortion.
Eur. J. Comb., 2005

Euclidean distortion and the sparsest cut.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On distance scales, embeddings, and efficient relaxations of the cut cone.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Hardness of Approximation for Vertex-Connectivity Network Design Problems.
SIAM J. Comput., 2004

Navigating nets: simple algorithms for proximity search.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Metric Structures in L1: Dimension, Snowflakes, and Average Distortion.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Measured Descent: A New Embedding Method for Finite Metrics.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Bounded Geometries, Fractals, and Low-Distortion Embeddings.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003


  Loading...