2026 Julia Chuzhoy: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	36	11408	11084	4686	4486	76	3209

Research.com Recognitions

2011 - Fellow of Alfred P. Sloan Foundation

Overview

Julia Chuzhoy is affiliated with the Toyota Technological Institute at Chicago in the United States. Their research contributions span primarily the field of Computer Science, with a focus on several subfields and research topics.

The main subfields of study for Julia Chuzhoy include:

Computational Theory and Mathematics
Computer Networks and Communications
Artificial Intelligence
Computer Graphics and Computer-Aided Design
Molecular Biology

Chuzhoy's research covers a range of topics, notably:

Complexity and Algorithms in Graphs
Advanced Graph Theory Research
Optimization and Search Problems
Interconnection Networks and Systems
Algorithms and Data Compression
Computational Geometry and Mesh Generation
Privacy-Preserving Technologies in Data

Their most frequent publication venues include:

arXiv (Cornell University)
Theory of Computing
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Journal of Combinatorial Theory Series B
Society for Industrial and Applied Mathematics eBooks

Recent papers authored by Julia Chuzhoy are as follows:

Towards tight(er) bounds for the Excluded Grid Theorem, 2020, Journal of Combinatorial Theory Series B
On Packing Low-Diameter Spanning Trees, 2020, arXiv (Cornell University)
Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition, 2021, Society for Industrial and Applied Mathematics eBooks
Untitled paper, 2021, Theory of Computing
On Packing Low-Diameter Spanning Trees, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent collaborators include:

Zihan Tan
Sanjeev Khanna
Merav Parter
Thatchaphol Saranurak
Rachit Nimavat

Julia Chuzhoy has received recognition as a Fellow of the Alfred P. Sloan Foundation in 2011.

Best Publications

Non-Cooperative Multicast and Facility Location Games

C. Chekuri;J. Chuzhoy;L. Lewin-Eytan;J. Naor

181
Citations
Polynomial Bounds for the Grid-Minor Theorem

Chandra Chekuri;Julia Chuzhoy

172
Citations
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

Julia Chuzhoy;Rafail Ostrovsky;Yuval Rabani

143
Citations
On Allocating Goods to Maximize Fairness

Deeparnab Chakrabarty;Julia Chuzhoy;Sanjeev Khanna

132
Citations
New hardness results for congestion minimization and machine scheduling

Julia Chuzhoy;Joseph (Seffi) Naor

126
Citations
Maximum independent set of rectangles

Parinya Chalermsook;Julia Chuzhoy

110
Citations
On the approximability of some network design problems

Julia Chuzhoy;Anupam Gupta;Joseph (Seffi) Naor;Amitabh Sinha

97
Citations
Covering Problems with Hard Capacities

Julia Chuzhoy

96
Citations
Polynomial flow-cut gaps and hardness of directed cut problems

Julia Chuzhoy;Sanjeev Khanna

91
Citations
An $O(k^3\log n)$-Approximation Algorithm for Vertex-Connectivity Survivable Network Design

Julia Chuzhoy;Sanjeev Khanna

90
Citations
Hardness of the undirected edge-disjoint paths problem with congestion

M. Andrews;J. Chuzhoy;Sanjeev Khanna;L. Zhang

88
Citations
Asymmetric k-center is log*n-hard to approximate

Julia Chuzhoy;Sudipto Guha;Eran Halperin;Sanjeev Khanna

83
Citations
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond

Julia Chuzhoy;Yu Gao;Jason Li;Danupon Nanongkai

83
Citations
Approximation algorithms for the job interval selection problem and related scheduling problems

J. Chuzhoy;R. Ostrovsky

82
Citations
Low-distortion embeddings of general metrics into the line

Mihai Bǎdoiu;Julia Chuzhoy;Piotr Indyk;Anastasios Sidiropoulos

79
Citations
Approximating k-median with non-uniform capacities

Julia Chuzhoy;Yuval Rabani

77
Citations
Network design for vertex connectivity

Tanmoy Chakraborty;Julia Chuzhoy;Sanjeev Khanna

75
Citations
Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs

Matthew Andrews;Julia Chuzhoy;Venkatesan Guruswami;Sanjeev Khanna

72
Citations
Routing in Undirected Graphs with Constant Congestion

Julia Chuzhoy

67
Citations
Machine minimization for scheduling jobs with interval constraints

J. Chuzhoy;S. Guha;S. Khanna;J.S. Naor

65
Citations
Large-treewidth graph decompositions and applications

Chandra Chekuri;Julia Chuzhoy

63
Citations
Towards tight(er) bounds for the Excluded Grid Theorem

Julia Chuzhoy;Zihan Tan

49
Citations

Frequent Co-Authors

Sanjeev Khanna University of Pennsylvania

Joseph (Seffi) Naor Technion – Israel Institute of Technology

Chandra Chekuri University of Illinois at Urbana-Champaign

Sudipto Guha University of Pennsylvania

Matthew Andrews Nokia (United States)

Kunal Talwar Apple (United States)

Venkatesan Guruswami University of California, Berkeley

Guy Kortsarz Rutgers, The State University of New Jersey

Piotr Indyk MIT

Ariel Orda Technion – Israel Institute of Technology

External Links

Personal website of Julia Chuzhoy Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online education opens many pathways to a rewarding career in computer science and related fields. Whether you’re seeking foundational knowledge or advanced expertise, there are flexible options tailored to diverse needs.

Those considering a graduate credential may review the most useful masters degrees to increase earning potential and job prospects. Meanwhile, newcomers and career switchers can start with associates degrees online, which offer a fast and cost-effective route to entry-level tech roles.

Budget is often a concern, but there are affordable online degree programs designed to minimize student debt while still providing quality education. If your academic history includes a lower GPA, you can still pursue your goals by targeting online schools that accept low gpa.

No matter your background or future plans, online degrees offer accessible and practical options, making it easier than ever to advance in computer science and technology careers.