Julia Chuzhoy

Julia Chuzhoy is an Israeli mathematician and computer scientist,

Chuzhoy studied computer science at Technion in Haifa from 1995 , where she received her master’s degree in 2000 (Thesis: Approximation algorithms for hard cut problems) and received her doctorate from Joseph Naor (Seffi Naor) in 2004 ( Hardness of Approximation and New Approximability Classes ) Als She spent three years as a post-doctoral student at the Massachusetts Institute of Technology with Piotr Indyk and Madhu Sudan , at the University of Pennsylvania with Sanjeev Khanna and at the Institute for Advanced Study with Avi Wigderson . She is an Associate Professor at the Toyota Technological Institute in Chicago.

It deals with approximation algorithms in combinatorial optimization and the limits of approximability as well as with graph theory.

With Chekuri in 2013 she proved the polynomial dependence of the size of the graph minors of a grid graph on the tree width. This provided a quantitative version of the grid minor theorem by Neil Robertson and Paul Seymour , which states that every graph whose tree width is large enough in relation to the size (number of vertices) of a grid graph H contains this as a minor.

In 2014 she was invited speaker at the International Congress of Mathematicians in Seoul (Cuts and Integral Routing in Graphs, an Approximation Algorithmist's Perspective). In 2011 she was a Sloan Fellow and in 2009 she received an NSF Career Award.

Fonts (selection)

• with Li Shi: A polylogarithimic approximation algorithm for edge-disjoint paths with congestion, IEEE 53rd Annual Symposium on Foundations of Computer Science — FOCS 2012, pp. 233–242 (received the Best Paper Award from FOCS 2012)
• with Chandra Chekuri: Polynomial bounds for the grid-minor theorem, Journal of the ACM, Volume 63, 2016, pp. 1–65, Arxiv 2013

Web links

• Homepage

Individual evidence

1. ↑ Julia Chuzhoy in the Mathematics Genealogy Project (English)