Author of the publication

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.

 

Other publications of authors with the same name

Integrality gaps for sparsest cut and minimum linear arrangement problems., , , and . STOC, page 537-546. ACM, (2006)Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs., and . CoRR, (2013)Stochastic Vehicle Routing with Recourse., , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 411-423. Springer, (2012)Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors., and . Electron. Colloquium Comput. Complex., (2014)Quasi-Random PCP and Hardness of 2-Catalog Segmentation.. FSTTCS, volume 8 of LIPIcs, page 447-458. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)PAC Learning Linear Thresholds from Label Proportions., , and . CoRR, (2023)Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs., and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 327-338. Springer, (2011)Hardness of Embedding Metric Spaces of Equal Size., and . APPROX-RANDOM, volume 4627 of Lecture Notes in Computer Science, page 218-227. Springer, (2007)Algorithms and Hardness for Learning Linear Thresholds from Label Proportions.. NeurIPS, (2022)SDP Integrality Gaps with Local ell_1-Embeddability., and . FOCS, page 565-574. IEEE Computer Society, (2009)