Kyle J. Fox is an Assistant Professor in the Department of Computer Science. His research interests include:

  • Algorithms and theory
  • Computational Geometry and topology
  • Combinatorial optimization and graph algorithms


2020 recipient of a five-year, $586,654 National Science Foundation Faculty Early Career Development (CAREER) Award to explore how the mathematical field of topology can be used to design more efficient and faster algorithms to solve difficult problems. Read more.

Works in Treasures @ UT Dallas are made available exclusively for educational purposes such as research or instruction. Literary rights, including copyright for published works held by the creator(s) or their heirs, or other third parties may apply. All rights are reserved unless otherwise indicated by the copyright owner(s).

Recent Submissions

  • Holiest Minimum-Cost Paths and Flows in Surface Graphs 

    Erickson, J.; Fox, Kyle J.; Lkhamsuren, L.
    Let G be an edge-weighted directed graph with n vertices embedded on an orientable surface of genus g. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows ...
  • An Efficient Algorithm for Computing High-Quality Paths Amid Polygonal Obstacles 

    Agarwal, P. K.; Fox, Kyle J.; Salzman, O.
    We study a path-planning problem amid a set O of obstacles in R², in which we wish to compute a short path between two points while also maintaining a high clearance from O; the clearance of a point is its distance from a ...
  • Computing the Gromov-Hausdorff Distance for Metric Trees 

    Agarwal, P. K.; Fox, Kyle J.; Nath, A.; Sidiropoulos, A.; Wang, Y.
    The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is NP-hard to approximate the GH distance better than a factor of 3 for geodesic metrics on a pair of ...