Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard.
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee: Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard. CoRR abs/1701.00146 (2017)
View ArticleAlmost-polynomial ratio ETH-hardness of approximating densest k-subgraph.
Pasin Manurangsi: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph. STOC 2017: 954-961
View ArticleApproximation Algorithms for Label Cover and The Log-Density Threshold.
Eden Chlamtác, Pasin Manurangsi, Dana Moshkovitz, Aravindan Vijayaraghavan: Approximation Algorithms for Label Cover and The Log-Density Threshold. SODA 2017: 900-919
View ArticleAn Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for...
Haris Angelidakis, Yury Makarychev, Pasin Manurangsi: An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut. IPCO 2017: 39-50
View ArticleComputing an Approximately Optimal Agreeable Set of Items.
Pasin Manurangsi, Warut Suksompong: Computing an Approximately Optimal Agreeable Set of Items. IJCAI 2017: 338-344
View ArticleInapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and...
Pasin Manurangsi: Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis. ICALP 2017: 79:1-79:14
View ArticleA Birthday Repetition Theorem and Complexity of Approximating Dense CSPs.
Pasin Manurangsi, Prasad Raghavendra: A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. ICALP 2017: 78:1-78:15
View ArticleClik here to view.
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More.
Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan: From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS...
View ArticleInapproximability of VC Dimension and Littlestone's Dimension.
Pasin Manurangsi, Aviad Rubinstein: Inapproximability of VC Dimension and Littlestone's Dimension. COLT 2017: 1432-1460
View ArticleAsymptotic existence of fair divisions for groups.
Pasin Manurangsi, Warut Suksompong: Asymptotic existence of fair divisions for groups. Math. Soc. Sci. 89: 100-108 (2017)
View ArticleEven 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard.
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Pasin Manurangsi, Anak Yodpinyanee: Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard. J. Inf. Process. 25: 682-694 (2017)
View ArticleClik here to view.
Improved Approximation Algorithms for Projection Games.
Pasin Manurangsi, Dana Moshkovitz: Improved Approximation Algorithms for Projection Games. Algorithmica 77(2): 555-594 (2017)
View ArticleOn Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic.
Karthik C. S., Pasin Manurangsi: On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. Electron. Colloquium Comput. Complex. TR18 (2018)
View ArticleETH-Hardness of Approximating 2-CSPs and Directed Steiner Network.
Irit Dinur, Pasin Manurangsi: ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. Electron. Colloquium Comput. Complex. TR18 (2018)
View ArticleParameterized Intractability of Even Set and Shortest Vector Problem from...
Arnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi: Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH. Electron. Colloquium Comput. Complex. TR18 (2018)
View ArticleOn Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic.
Karthik C. S., Pasin Manurangsi: On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. CoRR abs/1812.00901 (2018)
View ArticleWhen Do Envy-Free Allocations Exist?
Pasin Manurangsi, Warut Suksompong: When Do Envy-Free Allocations Exist? CoRR abs/1811.01630 (2018)
View ArticleThe Computational Complexity of Training ReLU(s).
Pasin Manurangsi, Daniel Reichman: The Computational Complexity of Training ReLU(s). CoRR abs/1810.04207 (2018)
View ArticleA Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and...
Pasin Manurangsi: A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation. CoRR abs/1810.03792 (2018)
View ArticleMultitasking Capacity: Hardness Results and Improved Constructions.
Noga Alon, Jonathan D. Cohen, Thomas L. Griffiths, Pasin Manurangsi, Daniel Reichman, Igor Shinkar, Tal Wagner, Alexander Y. Ku: Multitasking Capacity: Hardness Results and Improved Constructions. CoRR...
View Article