Emily Kyle Fox

For More Information

• Emily's website

Education

• Ph.D. in Computer Science, University of Illinois Urbana-Champaign, 2013
• M.S. in Computer Science, University of Illinois Urbana-Champaign, 2010
• B.S. in Computer Science, University of Illinois Urbana-Champaign, 2008

Academic Positions

• Teaching Associate Professor, University of Illinois Urbana-Champaign, 2025-present
• Associate Professor, University of Texas at Dallas, Computer Science, 2023-2025
• Assistant Professor, University of Texas at Dallas, Computer Science, 2017-2023

Research Interests

• Algorithms
• Computational geometry and topology
• Graph algorithms

Selected Articles in Journals

• Clustering with faulty centers. Joint work with Hongyao Huang and Benjamin Raichel. Computational Geometry: Theory and Applications (CGTA), 117, Article 102052, 2024, special issue of invited papers from the 33rd International Symposium on Algorithms and Computation.
• Minimum cut and minimum k-cut in hypergraphs via branching contractions. Joint work with Debmalya Panigrahi and Fred Zhang. ACM Transactions on Algorithms (TALG), 19(2), Article No. 13, 2023.
• Minimum cuts in surface graphs. Joint work with Erin W. Chambers, Jeff Erickson, and Amir Nayyeri. SIAM Journal on Computing (SICOMP), 52(1), 156–195, 2023.
• Approximating the geometric edit distance. Joint work with Xinyi Li. Algorithmica, 84(9), 2395–2413, 2022.
• A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread. Joint work with Jiashuai Lu. Journal of Computational Geometry (JoCG), 13(1), 204–225, 2022.

Articles in Conference Proceedings

• A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs. Proceedings of the 32nd Annual European Symposium on Algorithms (ESA), 56:1–56:14, 2024.
• Fréchet edit distance. Joint work with Amir Nayyeri, Jonathan James Perry, and Benjamin Raichel. Proceedings of the 40th International Symposium on Computational Geometry (SoCG), 58:1-58:15, 2024.
• A deterministic near-linear time approximation scheme for geometric transportation. Joint work with Jiashuai Lu. Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS), 1301–1315, 2023.
• Approximating the (continuous) Fréchet distance. Joint work with Connor Colombe. Proceedings of the 37th International Symposium on Computational Geometry (SoCG), 26:1–26:14, 2021.
• Holiest minimum-cost paths and flows in surface graphs. Joint work with Jeff Erickson and Luvsandondov Lkhamsuren. Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC), 1319–1332, 2018.

Teaching Honors

• Best Teacher in Computer Science, Erik Jonsson School of Engineering and Computer Science, University of Texas at Dallas (2019-2020)

Research Honors

• National Science Foundation CAREER Award (CCF-1942597) (2020-2026)