My research interests include combinatorics, convex geometry, algorithms, computational complexity.

Papers

  • My doctoral dissertation, entitled "The Computational Complexity of Convex Bodies."
  • A Positive Semidefinite Approximation of the Traveling Salesman Polytope
    Discrete and Computational Geometry 38 (2007), p. 15-28
  • The computational complexity of convex bodies
    with Alexander Barvinok, math.MG/0610325 (to appear in Proceedings of the conference "Discrete and Computational Geometry: Twenty Years Later", Contemporary Math)
  • An Efficient Approximation of the Traveling Salesman Polytope Using Lifting Methods
    math.CO/0610385





    Back to Prof. Veomett's mainpage