The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James R. Lee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guy Kortsarz, Robert Krauthgamer, James R. Lee
    Hardness of Approximation for Vertex-Connectivity Network-Design Problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:185-199 [Conf]
  2. James R. Lee
    Volume distortion for subsets of Euclidean spaces: extended abstract. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:207-216 [Conf]
  3. Anupam Gupta, Robert Krauthgamer, James R. Lee
    Bounded Geometries, Fractals, and Low-Distortion Embeddings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:534-543 [Conf]
  4. Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor
    Measured Descent: A New Embedding Method for Finite Metrics. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:434-443 [Conf]
  5. James R. Lee, Assaf Naor
    Lp metrics on the Heisenberg group and the Goemans-Linial conjecture. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:99-108 [Conf]
  6. Robert Krauthgamer, James R. Lee
    Algorithms on negatively curved spaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:119-132 [Conf]
  7. Robert Krauthgamer, James R. Lee
    The Black-Box Complexity of Nearest Neighbor Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:858-869 [Conf]
  8. James R. Lee, Manor Mendel, Assaf Naor
    Metric Structures in L1: Dimension, Snowflakes, and Average Distortion. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:401-412 [Conf]
  9. James R. Lee
    On distance scales, embeddings, and efficient relaxations of the cut cone. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:92-101 [Conf]
  10. Robert Krauthgamer, James R. Lee
    Navigating nets: simple algorithms for proximity search. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:798-807 [Conf]
  11. James R. Lee, Assaf Naor, Yuval Peres
    Trees and Markov convexity. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1028-1037 [Conf]
  12. Sanjeev Arora, James R. Lee, Assaf Naor
    Euclidean distortion and the sparsest cut. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:553-562 [Conf]
  13. Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee
    Improved approximation algorithms for minimum-weight vertex separators. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:563-572 [Conf]
  14. Robert Krauthgamer, James R. Lee
    The intrinsic dimensionality of graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:438-447 [Conf]
  15. James R. Lee, Manor Mendel, Assaf Naor
    Metric structures in L1: dimension, snowflakes, and average distortion. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:8, pp:1180-1190 [Journal]
  16. Uriel Feige, James R. Lee
    An improved approximation ratio for the minimum linear arrangement problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:1, pp:26-29 [Journal]
  17. Guy Kortsarz, Robert Krauthgamer, James R. Lee
    Hardness of Approximation for Vertex-Connectivity Network Design Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:3, pp:704-720 [Journal]
  18. Robert Krauthgamer, James R. Lee
    The black-box complexity of nearest-neighbor search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:262-276 [Journal]
  19. Yael Dekel, James R. Lee, Nathan Linial
    Eigenvectors of Random Graphs: Nodal Domains. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:436-448 [Conf]
  20. James R. Lee, Prasad Raghavendra
    Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:228-241 [Conf]
  21. Bo Brinkman, Adriana Karagiozova, James R. Lee
    Vertex cuts, random walks, and dimension reduction in series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:621-630 [Conf]
  22. Robert Krauthgamer, James R. Lee, Manor Mendel, Assaf Naor
    Measured descent: A new embedding method for finite metrics [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  23. Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. [Citation Graph (, )][DBLP]


  24. On the Optimality of Gluing over Scales. [Citation Graph (, )][DBLP]


  25. Randomly removing g handles at once. [Citation Graph (, )][DBLP]


  26. Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums. [Citation Graph (, )][DBLP]


  27. Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. [Citation Graph (, )][DBLP]


  28. Higher Eigenvalues of Graphs. [Citation Graph (, )][DBLP]


  29. Almost Euclidean subspaces of lN1 via expander codes. [Citation Graph (, )][DBLP]


  30. Genus and the Geometry of the Cut Graph. [Citation Graph (, )][DBLP]


  31. On the geometry of graphs with a forbidden minor. [Citation Graph (, )][DBLP]


  32. Bilipschitz snowflakes and metrics of negative type. [Citation Graph (, )][DBLP]


  33. The intrinsic dimensionality of graphs. [Citation Graph (, )][DBLP]


  34. Randomly removing g handles at once. [Citation Graph (, )][DBLP]


  35. Eigenvalue bounds, spectral partitioning, and metrical deformations via flows [Citation Graph (, )][DBLP]


  36. Pathwidth, trees, and random embeddings [Citation Graph (, )][DBLP]


  37. Randomly removing g handles at once [Citation Graph (, )][DBLP]


  38. Cover times, blanket times, and majorizing measures [Citation Graph (, )][DBLP]


  39. Metric uniformization and spectral bounds for graphs [Citation Graph (, )][DBLP]


  40. Volume Distortion for Subsets of Euclidean Spaces. [Citation Graph (, )][DBLP]


  41. Fréchet Embeddings of Negative Type Metrics. [Citation Graph (, )][DBLP]


  42. Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (, )][DBLP]


  43. Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (, )][DBLP]


  44. Almost Euclidean subspaces of $\ell_1^N$ via expander codes. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002