Faculty

Institution

Unit

Venue

Julia Chuzhoy

Manuel Blum Professor Professor

Toyota Technological Institute at Chicago

Affiliations

Toyota Technological Institute at Chicago

Julia Chuzhoy is currently serving as a Toyota Technological Institute At Chicago Manuel Blum Professor Professor at Toyota Technological Institute At Chicago.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Julia Chuzhoy

Toyota Technological Institute at Chicago

Manuel Blum Professor Professor

You can click a keyword to filter the displayed items

applied mathematics computer science graph theory combinatorial optimization discrete algorithms mathematical optimization combinatorics computational complexity combinatorial theory mathematics machine learning computational optimization network routing combinatorial algorithm maximum bipartite matching systems engineering asymptotic analysis formal methods approximation theory extremal graph theory structural graph theory network optimization complexity theory vehicle routing problems network routing algorithm graph algorithms optimization problems polynomial flow-cut gaps directed cut problems approximation algorithms fairness networked system design fair resource allocation resource allocation cost allocations graph minors lower bounds extremal combinatorics discrete optimization traffic flow algorithmic game theory price of anarchy network games survivable network constructive approximation graph processing routing protocols directed graphs concurrent engineering hardness matching technique grid-minor theorem polynomial bounds grid minor maximum independent set nash equilibrium non-cooperative multicast multicast game network design vertex connectivity single-source vertex connectivity unlimited supply technology mathematical programming numerical analysis intelligent computing global optimization data science design optimization mathematical logic computer engineering multidisciplinary optimization global networks complex systems theoretical computer science automated deduction network science philosophy of mathematics network analysis automated reasoning scientific computing informatics computational mathematics numerical mathematics theory of computation numerical algorithms computational geometry natural computing pure mathematics computational engineering computational science system science discrete mathematics logic in computer science general systems memetic computing computational intelligence engineering

Notable Scholarly Works

Notable Federal Grants

Collaborators

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs. Society for Industrial and Applied Mathematics eBooks (2026)

Breaking the 𝑂(𝑚𝑛)-Time Barrier for Vertex-Weighted Global Minimum Cut. (2025)

A Faster Combinatorial Algorithm for Maximum Bipartite Matching. Society for Industrial and Applied Mathematics eBooks (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingengineeringapplied mathematicscombinatorial algorithm

Maximum Bipartite Matching in $N^{2+O(1)}$ Time via a Combinatorial Algorithm. arXiv (Cornell University) (2024)

Chuzhoy, JuliaKhanna, Sanjeev

matching techniqueapplied mathematicsparticle physicsmaximum bipartite matchingcombinatorial algorithm

Maximum Bipartite Matching in 𝑛 2+𝑜(1) Time via a Combinatorial Algorithm. (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingcombinatorial algorithmapplied mathematicsmachine learning

A Distanced Matching Game, Decremental Apsp in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. Society for Industrial and Applied Mathematics eBooks (2023)

Julia Chuzhoy

decremental apspcombinatorial optimizationdeterministic algorithmscomputer sciencediscrete mathematicsgraph cut problemsdiscrete algorithmsdistanced matching gameoptimization problems

A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. (2023)

A New Conjecture on Hardness of 2-Csp’s With Implications to Hardness of Densest K-Subgraph and Other Problems. arXiv (Cornell University) (2022)

Chuzhoy, JuliaDalirrooyfard, MinaGrinberg, VadimTan, Zihan

other problemsapplied mathematicshardness

A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs. (2022)

Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time. arXiv (Cornell University) (2021)

1
2
3
4
5
6
7
10 / page

Julia Chuzhoy

Manuel Blum Professor Professor

Toyota Technological Institute at Chicago

Affiliations

Toyota Technological Institute at Chicago

Julia Chuzhoy is currently serving as a Toyota Technological Institute At Chicago Manuel Blum Professor Professor at Toyota Technological Institute At Chicago.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Julia Chuzhoy

Toyota Technological Institute at Chicago

Manuel Blum Professor Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs. Society for Industrial and Applied Mathematics eBooks (2026)

Breaking the 𝑂(𝑚𝑛)-Time Barrier for Vertex-Weighted Global Minimum Cut. (2025)

A Faster Combinatorial Algorithm for Maximum Bipartite Matching. Society for Industrial and Applied Mathematics eBooks (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingengineeringapplied mathematicscombinatorial algorithm

Maximum Bipartite Matching in $N^{2+O(1)}$ Time via a Combinatorial Algorithm. arXiv (Cornell University) (2024)

Chuzhoy, JuliaKhanna, Sanjeev

matching techniqueapplied mathematicsparticle physicsmaximum bipartite matchingcombinatorial algorithm

Maximum Bipartite Matching in 𝑛 2+𝑜(1) Time via a Combinatorial Algorithm. (2024)

Julia ChuzhoySanjeev Khanna

maximum bipartite matchingcombinatorial algorithmapplied mathematicsmachine learning

A Distanced Matching Game, Decremental Apsp in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems. Society for Industrial and Applied Mathematics eBooks (2023)

Julia Chuzhoy

decremental apspcombinatorial optimizationdeterministic algorithmscomputer sciencediscrete mathematicsgraph cut problemsdiscrete algorithmsdistanced matching gameoptimization problems

A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest Paths. (2023)

A New Conjecture on Hardness of 2-Csp’s With Implications to Hardness of Densest K-Subgraph and Other Problems. arXiv (Cornell University) (2022)

Chuzhoy, JuliaDalirrooyfard, MinaGrinberg, VadimTan, Zihan

other problemsapplied mathematicshardness

A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs. (2022)

Decremental All-Pairs Shortest Paths in Deterministic Near-Linear Time. arXiv (Cornell University) (2021)

1
2
3
4
5
6
7
10 / page