PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Manurangsi, Pasin"

Author of the publication

copydeleteadd this publication to your clipboard
Multitasking Capacity: Hardness Results and Improved Constructions.

, , , , , , , and . CoRR, (2018)

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.

No persons found for author name Manurangsi, Pasin
add a person with the name Manurangsi, Pasin
 

Other publications of authors with the same name

A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs., and . CoRR, (2016)Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis.. CoRR, (2017)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , and . FOCS, page 743-754. IEEE Computer Society, (2017)Improved Approximation Algorithms for Projection Games - (Extended Abstract)., and . ESA, volume 8125 of Lecture Notes in Computer Science, page 683-694. Springer, (2013)When Do Envy-Free Allocations Exist?, and . AAAI, page 2109-2116. AAAI Press, (2019)Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut., and . APPROX-RANDOM, volume 116 of LIPIcs, page 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem).. CoRR, (2019)Computing a small agreeable set of indivisible items., and . Artif. Intell., (2019)Parameterized Intractability of Even Set and Shortest Vector Problem., , , , , , , and . CoRR, (2019)Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis.. Algorithms, 11 (1): 10 (2018)