Author of the publication

LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.

, , and . SODA, page 1964-1979. SIAM, (2017)

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

Recoverable values for independent sets., and . Random Struct. Algorithms, 46 (1): 142-159 (2015)On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank One Perturbations of Gaussian Tensors., , and . IEEE Trans. Inf. Theory, 63 (3): 1572-1579 (2017)Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs., , and . CoRR, (2016)How Many Neurons Does it Take to Approximate the Maximum?, , and . CoRR, (2023)A Graph-Theoretic Approach to Multitasking., , , , , , , and . CoRR, (2016)Multitasking Capacity: Hardness Results and Improved Constructions., , , , , , , and . CoRR, (2018)LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs., , and . SODA, page 1964-1979. SIAM, (2017)On the Limitation of Spectral Methods: From the Gaussian Hidden Clique Problem to Rank-One Perturbations of Gaussian Tensors., , and . NIPS, page 217-225. (2015)On The Extraction of Training Imagery from Very Large Remote Sensing Datasets for Deep Convolutional Segmenatation Networks., , , , and . IGARSS, page 6895-6898. IEEE, (2018)String Matching: Communication, Circuits, and Learning., , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)