( en | de | ru )

 

Disambiguation of "Chuzhoy, Julia"

Author of the publication

copydeleteadd this publication to your clipboard
Polynomial Bounds for the Grid-Minor Theorem

, and . CoRR, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Guenter Julian

Otto Julian

Ernst Julian

Klaus Julian

Aldo Alfredo Julian

 

Other publications of authors with the same name

On the approximability of some network design problems., , , and . SODA, page 943-951. SIAM, (2005)Polynomial Bounds for the Grid-Minor Theorem, and . CoRR, (2013)Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary., , and . ICALP, volume 107 of LIPIcs, page 38:1-38:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)An O(k3log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design., and . Theory of Computing, 8 (1): 401-413 (2012)A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems.. SODA, page 2122-2213. SIAM, (2023)Deterministic Algorithms for Decremental Shortest Paths via Layered Core Decomposition., and . SODA, page 2478-2496. SIAM, (2021)On Approximating Maximum Independent Set of Rectangles., and . FOCS, page 820-829. IEEE Computer Society, (2016)The Hardness of Metric Labeling., and . FOCS, page 108-114. IEEE Computer Society, (2004)On Packing Low-Diameter Spanning Trees., , and . ICALP, volume 168 of LIPIcs, page 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond., , , , , and . CoRR, (2019)