( en | de | ru )

 

Disambiguation of "Chuzhoy, Julia"

Author of the publication

copydeleteadd this publication to your clipboard
On the approximability of some network design problems.

, , , and . SODA, page 943-951. SIAM, (2005)

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

New hardness results for congestion minimization and machine scheduling., and . J. ACM, 53 (5): 707-721 (2006)Large-Treewidth Graph Decompositions.. Encyclopedia of Algorithms, (2016)Polynomial bounds for the grid-minor theorem., and . STOC, page 60-69. ACM, (2014)Asymmetric k-center is log* n-hard to approximate., , , , , and . STOC, page 21-27. ACM, (2004)Pinning down the Strong Wilber 1 Bound for Binary Search Trees., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 33:1-33:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Resource Minimization Job Scheduling., and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 70-83. Springer, (2009)A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems., , , and . CoRR, (2022)Decremental all-pairs shortest paths in deterministic near-linear time.. STOC, page 626-639. ACM, (2021)A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems., , , and . ITCS, volume 251 of LIPIcs, page 38:1-38:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Maximum independent set of rectangles., and . SODA, page 892-901. SIAM, (2009)