Julia Chuzhoy

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 49

Top Venues

Publications

Julia Chuzhoy, Sanjeev Khanna
Time via a Combinatorial Algorithm. CoRR (2024)
Julia Chuzhoy, Sanjeev Khanna
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. SODA (2024)
Julia Chuzhoy, Sanjeev Khanna
Time via a Combinatorial Algorithm. STOC (2024)
Julia Chuzhoy, Sanjeev Khanna
A Faster Combinatorial Algorithm for Maximum Bipartite Matching. CoRR (2023)
Julia Chuzhoy
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. SODA (2023)
Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. ITCS (2023)
Julia Chuzhoy, Ruimin Zhang
A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. CoRR (2023)
Julia Chuzhoy, Ruimin Zhang
A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. STOC (2023)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
New Hardness Results for Routing on Disjoint Paths. SIAM J. Comput. 51 (2) (2022)
Julia Chuzhoy
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. CoRR (2022)
Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg, Zihan Tan
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. CoRR (2022)
Julia Chuzhoy, Zihan Tan
A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs. CoRR (2022)
Julia Chuzhoy, Zihan Tan
A subpolynomial approximation algorithm for graph crossing number in low-degree graphs. STOC (2022)
Julia Chuzhoy, Thatchaphol Saranurak
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. SODA (2021)
Julia Chuzhoy, Zihan Tan
Towards tight(er) bounds for the Excluded Grid Theorem. J. Comb. Theory, Ser. B 146 (2021)
Julia Chuzhoy
Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time. CoRR (2021)
Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. Theory Comput. 17 (2021)
Julia Chuzhoy
Decremental all-pairs shortest paths in deterministic near-linear time. STOC (2021)
Julia Chuzhoy, Merav Parter, Zihan Tan
On Packing Low-Diameter Spanning Trees. ICALP (2020)
Julia Chuzhoy, Thatchaphol Saranurak
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition. CoRR (2020)
Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
Towards Better Approximation of Graph Crossing Number. CoRR (2020)
Julia Chuzhoy, Merav Parter, Zihan Tan
On Packing Low-Diameter Spanning Trees. CoRR (2020)
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. FOCS (2020)
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. APPROX-RANDOM (2020)
Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
Towards Better Approximation of Graph Crossing Number. FOCS (2020)
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees. CoRR (2019)
Julia Chuzhoy, Zihan Tan
Towards Tight(er) Bounds for the Excluded Grid Theorem. CoRR (2019)
Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. CoRR (2019)
Julia Chuzhoy, Zihan Tan
Towards Tight(er) Bounds for the Excluded Grid Theorem. SODA (2019)
Julia Chuzhoy, Rachit Nimavat
Large Minors in Expanders. CoRR (2019)
Julia Chuzhoy, Sanjeev Khanna
A New Algorithm for Decremental Single-Source Shortest Paths with Applications to Vertex-Capacitated Flow and Cut Problems. CoRR (2019)
Julia Chuzhoy, Sanjeev Khanna
A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems. STOC (2019)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
Almost polynomial hardness of node-disjoint paths in grids. STOC (2018)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. CoRR (2018)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary. ICALP (2018)
Julia Chuzhoy, Alexander Russell
Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Coomputer Science (FOCS 2014). SIAM J. Comput. 46 (1) (2017)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
New hardness results for routing on disjoint paths. STOC (2017)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. CoRR (2017)
Julia Chuzhoy, Alina Ene
On Approximating Maximum Independent Set of Rectangles. CoRR (2016)
Julia Chuzhoy, Shi Li
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. J. ACM 63 (5) (2016)
Julia Chuzhoy
Excluded Grid Theorem: Improved and Simplified (Invited Talk). SWAT (2016)
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou
-Route Cut Problem. ACM Trans. Algorithms 12 (1) (2016)
Chandra Chekuri, Julia Chuzhoy
Polynomial Bounds for the Grid-Minor Theorem. J. ACM 63 (5) (2016)
Julia Chuzhoy, Alina Ene
On Approximating Maximum Independent Set of Rectangles. FOCS (2016)
Julia Chuzhoy, David H. K. Kim, Shi Li
Improved approximation for node-disjoint paths in planar graphs. STOC (2016)
Julia Chuzhoy, David H. K. Kim, Rachit Nimavat
New Hardness Results for Routing on Disjoint Paths. CoRR (2016)
Julia Chuzhoy
Routing in Undirected Graphs with Constant Congestion. SIAM J. Comput. 45 (4) (2016)
Julia Chuzhoy, David H. K. Kim, Shi Li
Improved Approximation for Node-Disjoint Paths in Planar Graphs. CoRR (2016)
Julia Chuzhoy
Improved Bounds for the Excluded Grid Theorem. CoRR (2016)
Julia Chuzhoy, David H. K. Kim
On Approximating Node-Disjoint Paths in Grids. APPROX-RANDOM (2015)
Julia Chuzhoy
Excluded Grid Theorem: Improved and Simplified. STOC (2015)
Chandra Chekuri, Julia Chuzhoy
Degree-3 Treewidth Sparsifiers. SODA (2015)
Julia Chuzhoy
Improved Bounds for the Flat Wall Theorem. SODA (2015)
Julia Chuzhoy
Improved Bounds for the Flat Wall Theorem. CoRR (2014)
Chandra Chekuri, Julia Chuzhoy
Degree-3 Treewidth Sparsifiers. CoRR (2014)
Chandra Chekuri, Julia Chuzhoy
Polynomial bounds for the grid-minor theorem. STOC (2014)
Chandra Chekuri, Julia Chuzhoy
Polynomial Bounds for the Grid-Minor Theorem CoRR (2013)
Chandra Chekuri, Julia Chuzhoy
Large-treewidth graph decompositions and applications. STOC (2013)
Chandra Chekuri, Julia Chuzhoy
Large-Treewidth Graph Decompositions and Applications CoRR (2013)
MohammadHossein Bateni, Julia Chuzhoy
-Stroll Problems. Algorithmica 65 (3) (2013)
Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. APPROX-RANDOM (2012)
Julia Chuzhoy, Shi Li
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 CoRR (2012)
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou
-route cut problem. SODA (2012)
Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li
Approximation algorithms and hardness of integral concurrent flow. STOC (2012)
Julia Chuzhoy
On vertex sparsifiers with Steiner nodes. STOC (2012)
Julia Chuzhoy
Routing in undirected graphs with constant congestion. STOC (2012)
Julia Chuzhoy
On Vertex Sparsifiers with Steiner Nodes CoRR (2012)
Julia Chuzhoy, Shi Li
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. FOCS (2012)
Julia Chuzhoy, Sanjeev Khanna
log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. Theory Comput. 8 (1) (2012)
Julia Chuzhoy
An algorithm for the graph crossing number problem. STOC (2011)
Julia Chuzhoy
Routing in Undirected Graphs with Constant Congestion CoRR (2011)
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayaraghavan, Yuan Zhou
Approximation Algorithms and Hardness of the k-Route Cut Problem CoRR (2011)
Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos
On Graph Crossing Number and Edge Planarization. SODA (2011)
Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos
On Graph Crossing Number and Edge Planarization CoRR (2010)
Parinya Chalermsook, Julia Chuzhoy
Resource Minimization for Fire Containment. SODA (2010)
MohammadHossein Bateni, Julia Chuzhoy
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems. APPROX-RANDOM (2010)
Julia Chuzhoy
An Algorithm for the Graph Crossing Number Problem CoRR (2010)
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs. Comb. 30 (5) (2010)
Julia Chuzhoy, Paolo Codenotti
Resource Minimization Job Scheduling. APPROX-RANDOM (2009)
Parinya Chalermsook, Julia Chuzhoy
Maximum independent set of rectangles. SODA (2009)
Julia Chuzhoy, Paolo Codenotti
Erratum: Resource Minimization Job Scheduling. APPROX-RANDOM (2009)
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
On Allocating Goods to Maximize Fairness. FOCS (2009)
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khanna
On Allocating Goods to Maximize Fairness CoRR (2009)
Julia Chuzhoy, Sanjeev Khanna
An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design. FOCS (2009)
Julia Chuzhoy, Sanjeev Khanna
Polynomial flow-cut gaps and hardness of directed cut problems. J. ACM 56 (2) (2009)
Julia Chuzhoy, Sanjeev Khanna
log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design CoRR (2008)
Tanmoy Chakraborty, Julia Chuzhoy, Sanjeev Khanna
Network design for vertex connectivity. STOC (2008)
Julia Chuzhoy, Sanjeev Khanna
Algorithms for Single-Source Vertex Connectivity. FOCS (2008)
Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
On the approximability of some network design problems. ACM Trans. Algorithms 4 (2) (2008)
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms 3 (1) (2007)
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. 25 (6) (2007)
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electron. Colloquium Comput. Complex. 14 (113) (2007)
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
Hardness of routing with congestion in directed graphs. STOC (2007)
Julia Chuzhoy, Sanjeev Khanna
Polynomial flow-cut gaps and hardness of directed cut problems. STOC (2007)
Julia Chuzhoy, Joseph Naor
The Hardness of Metric Labeling. SIAM J. Comput. 36 (5) (2007)
Julia Chuzhoy, Rafail Ostrovsky, Yuval Rabani
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems. Math. Oper. Res. 31 (4) (2006)
Julia Chuzhoy, Joseph Naor
Covering Problems with Hard Capacities. SIAM J. Comput. 36 (2) (2006)
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
Embedding ultrametrics into low-dimensional spaces. SCG (2006)
Julia Chuzhoy, Sanjeev Khanna
Hardness of cut problems in directed graphs. STOC (2006)
Julia Chuzhoy, Sanjeev Khanna
Hardness of Directed Routing with Congestion. Electron. Colloquium Comput. Complex. 13 (109) (2006)

Julia Chuzhoy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Julia Chuzhoy