| 2026 | SODA | Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs. | Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi |
| 2026 | STOC | A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching. | Julia Chuzhoy, Sanjeev Khanna, Junkai Song |
| 2025 | SODA | Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition. | Julia Chuzhoy, Merav Parter |
| 2025 | STOC | Breaking the O(m | Julia Chuzhoy, Ohad Trabelsi |
| 2024 | SODA | A Faster Combinatorial Algorithm for Maximum Bipartite Matching. | Julia Chuzhoy, Sanjeev Khanna |
| 2024 | STOC | Maximum Bipartite Matching in n | Julia Chuzhoy, Sanjeev Khanna |
| 2023 | SODA | A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. | Julia Chuzhoy |
| 2023 | STOC | A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. | Julia Chuzhoy, Ruimin Zhang |
| 2022 | STOC | A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. | Julia Chuzhoy, Zihan Tan |
| 2021 | SODA | Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. | Julia Chuzhoy, Thatchaphol Saranurak |
| 2021 | STOC | Decremental all-pairs shortest paths in deterministic near-linear time. | Julia Chuzhoy |
| 2020 | FOCS | A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. | Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak |
| 2020 | FOCS | Towards Better Approximation of Graph Crossing Number. | Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan |
| 2020 | ICALP | On Packing Low-Diameter Spanning Trees. | Julia Chuzhoy, Merav Parter, Zihan Tan |
| 2019 | SODA | Towards Tight(er) Bounds for the Excluded Grid Theorem. | Julia Chuzhoy, Zihan Tan |
| 2019 | STOC | A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. | Julia Chuzhoy, Sanjeev Khanna |
| 2018 | ICALP | Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2018 | STOC | Almost polynomial hardness of node-disjoint paths in grids. | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2017 | STOC | New hardness results for routing on disjoint paths. | Julia Chuzhoy, David H. K. Kim, Rachit Nimavat |
| 2016 | FOCS | On Approximating Maximum Independent Set of Rectangles. | Julia Chuzhoy, Alina Ene |
| 2016 | STOC | Improved approximation for node-disjoint paths in planar graphs. | Julia Chuzhoy, David H. K. Kim, Shi Li |
| 2015 | SODA | Degree-3 Treewidth Sparsifiers. | Chandra Chekuri, Julia Chuzhoy |
| 2015 | SODA | Improved Bounds for the Flat Wall Theorem. | Julia Chuzhoy |
| 2015 | STOC | Excluded Grid Theorem: Improved and Simplified. | Julia Chuzhoy |
| 2014 | STOC | Polynomial bounds for the grid-minor theorem. | Chandra Chekuri, Julia Chuzhoy |
| 2013 | STOC | Large-treewidth graph decompositions and applications. | Chandra Chekuri, Julia Chuzhoy |
| 2012 | FOCS | A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. | Julia Chuzhoy, Shi Li |
| 2012 | SODA | Approximation algorithms and hardness of the | Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou |
| 2012 | STOC | Approximation algorithms and hardness of integral concurrent flow. | Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li |
| 2012 | STOC | On vertex sparsifiers with Steiner nodes. | Julia Chuzhoy |
| 2012 | STOC | Routing in undirected graphs with constant congestion. | Julia Chuzhoy |
| 2011 | SODA | On Graph Crossing Number and Edge Planarization. | Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos |
| 2011 | STOC | An algorithm for the graph crossing number problem. | Julia Chuzhoy |
| 2010 | SODA | Resource Minimization for Fire Containment. | Parinya Chalermsook, Julia Chuzhoy |
| 2009 | FOCS | On Allocating Goods to Maximize Fairness. | Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna |
| 2009 | FOCS | An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. | Julia Chuzhoy, Sanjeev Khanna |
| 2009 | SODA | Maximum independent set of rectangles. | Parinya Chalermsook, Julia Chuzhoy |
| 2008 | FOCS | Algorithms for Single-Source Vertex Connectivity. | Julia Chuzhoy, Sanjeev Khanna |
| 2008 | STOC | Network design for vertex connectivity. | Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna |
| 2007 | STOC | Hardness of routing with congestion in directed graphs. | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
| 2007 | STOC | Polynomial flow-cut gaps and hardness of directed cut problems. | Julia Chuzhoy, Sanjeev Khanna |
| 2006 | STOC | Hardness of cut problems in directed graphs. | Julia Chuzhoy, Sanjeev Khanna |
| 2005 | FOCS | Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion. | Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang |
| 2005 | SODA | On the approximability of some network design problems. | Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha |
| 2005 | SODA | Approximating k-median with non-uniform capacities. | Julia Chuzhoy, Yuval Rabani |
| 2005 | STOC | Low-distortion embeddings of general metrics into the line. | Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos |
| 2004 | FOCS | Machine Minimization for Scheduling Jobs with Interval Constraints. | Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor |
| 2004 | FOCS | The Hardness of Metric Labeling. | Julia Chuzhoy, Joseph Naor |
| 2004 | STOC | Asymmetric k-center is log | Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor |
| 2004 | STOC | New hardness results for congestion minimization and machine scheduling. | Julia Chuzhoy, Joseph Naor |
| 2003 | ICALP | Algorithmic Aspects of Bandwidth Trading. | Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor |
| 2002 | FOCS | Covering Problems with Hard Capacities. | Julia Chuzhoy, Joseph Naor |
| 2001 | FOCS | Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. | Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani |