Ph.D. Student at Georgia Tech in Algorithms, Combinatorics, and Optimization (ACO)
Advised by Sahil Singla
Office: Klaus Advanced Computing Building 2116
Email: kpatton33 (at) gatech (dot) edu
Research Interests: Online algorithms, online resource allocation, stochastic optimization, prophet inequalities.
Papers and Preprints
- Online Resource Allocation with Concave Diminishing Returns Objectives
- Kalen Patton.
- SODA 2026.
- Best Student Paper.
- Online Combinatorial Optimization with Graphical Dependencies
- Zhimeng Gao, Evangelia Gergatsouli, Kalen Patton, and Sahil Singla.
- Preprint.
- Intergral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
- Thomas Kesselheim, Marco Molinaro, Kalen Patton, and Sahil Singla.
- FOCS 2025.
- The Online Submodular Assignment Problem
- Daniel Hathcock, Billy Jin, Kalen Patton, Sherry Sarkar, and Michael Zlatin.
- FOCS 2024.
- Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
- Vasilis Livanos, Kalen Patton, and Sahil Singla.
- EC 2024.
- Submodular Norms with Applications To Online Facility Location and Stochastic Probing
- Kalen Patton, Matteo Russo, and Sahil Singla.
- APPROX/RANDOM 2023.
- Prague Dimension of Random Graphs
- He Guo, Kalen Patton, and Lutz Warnke.
- Combinatorica 43, 853–884. 2023.
- Markov Chain-based Sampling for Exploring RNA Secondary Structure under the Nearest Neighbor Thermodynamic Model
- Anna Kirkpatrick, Kalen Patton, Prasad Tetali, and Cassie Mitchell.
- Mathematical and Computational Applications. 25(4), 67. 2020.
Presentations and Talks
- Online Resource Allocation with Concave, Diminishing-Returns Objectives
- SODA. Vancouver, Canada. Jan 12, 2026.
- Trends in Approximation and Online Algorithms (TAO). University of Sydney. Dec 18, 2025.
- Junior Theorists Workshop. Northwestern University. Dec 8, 2025.
- ACO seminar, Georgia Tech. Aug 29, 2025.
- Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
- FOCS. Dec. 15, 2025.
- Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
- ACO seminar, Georgia Tech. Oct 18, 2024.
- EC. July 10, 2024
- Online Matroid Intersection: How to Fill a Matroid with Water.
- ACO seminar, Georgia Tech. Dec 1, 2023.
- Submodular Norms with Applications.
- APPROX. Sept. 12, 2023.
- Prague Dimension of Random Graphs.
- British Combinatorics Conference. July 9, 2021.
- Analysis of Algorithms Conference. June 17, 2021.
- Graduate Student Combinatorics Conference, UMN. Apr 25, 2021.
- SUMS conference, JMU. Dec 5, 2020.
- ACO student seminar, Georgia Tech. Nov 20, 2020.
- Young Mathematicians Conference, OSU. Aug 16, 2020.
Awards
- SODA 2026 Best Student Paper Award. Society for Industrial and Applied Mathematics. 2026.
- ACO-ARC Research Fellowship. Georgia Tech, Algorithms and Randomness Center. 2025.
- David L. Brown Fellowship. Georgia Tech, School of Mathematics. 2023.
- Robert A. Pierotti Memorial Scholarship. Georgia Tech, College of Sciences. 2021.
- Provost’s Academic Excellence Award (Love Award Finalist). Georgia Tech, College of Science. 2021.
- Provost’s Academic Excellence Award. Georgia Tech, College of Computing. 2021.