Charles Joseph Argue

Charles Joseph Argue is a Lecturer in Mathematics at Yale University since July 2022, specializing in Algorithms, Combinatorics, and Optimization. He received his PhD in Mathematics from Carnegie Mellon University, where he was advised by Anupam Gupta.

• Specialties: Online algorithms, convex geometry, convex optimization, combinatorial optimization
• Current research focuses on information-theoretic questions in algorithms, convex optimization, and their applications to theoretical computer science.

The trends in his publications emphasize algorithmic design for convex and combinatorial optimization problems, with significant contributions to competitive algorithms for convex body chasing and packing integer programs. His work spans both theoretical foundations and practical applications.

Scientific awards include:

• SODA 2020 Best Paper
• SODA 2019 Best Paper

At Carnegie Mellon University, he taught courses in multivariate analysis, matrix algebra, discrete mathematics, and calculus. Since 2016, he has coached the Western Pennsylvania ARML Team, mentoring high school and middle school students in mathematics competitions.