معرفی
Julia Chuzhoy is a Manuel Blum Professor at the Toyota Technological Institute at Chicago (TTIC) and holds a part-time Professor appointment in the Department of Computer Science at the University of Chicago. She is a leading researcher in theoretical computer science with a focus on graph-related optimization problems and approximation algorithms.
Her research interests span theoretical computer science, particularly graph theory, approximation algorithms, dynamic algorithms, and hardness of approximation proofs. She has made significant contributions to graph minor theory, routing problems, and algorithmic graph theory.
Her recent publications demonstrate expertise in subpolynomial approximation algorithms for graph crossing number, hardness results for node-disjoint paths in grids, polynomial bounds for the grid-minor theorem, and routing in undirected graphs with constant congestion. Her work consistently addresses fundamental questions in algorithm design with strong theoretical foundations.
- NSF Career award
- Alfred P. Sloan research fellowship
- Multiple NSF grants (CCF-1318242, CCF-1616584, CCF-2006464, CCF-2402283)
- NSF HDR TRIPODS award 2216899
Professor Chuzhoy has advised several PhD students including Ron Mosenzon, Rachit Nimavat (expected graduation Summer 2023), Zihan Tan (graduated Spring 2022), David H.K. Kim (graduated Spring 2018), and Parinya Chalermsook (graduated Summer 2012). She has also mentored numerous summer interns from institutions including MIT, CMU, Princeton, and UIUC.
She is an active member of the theoretical computer science community, having served on program committees for major conferences including STOC (as PC chair in 2020), FOCS, and APPROX. She has also served on editorial boards for Algorithmica and SICOMP, and is a member of the SODA and ITCS steering committees.
