Improved Approximation Algorithms for Projection Games - (Extended Abstract).
Pasin Manurangsi, Dana Moshkovitz: Improved Approximation Algorithms for Projection Games - (Extended Abstract). ESA 2013: 683-694
View ArticleImproved Approximation Algorithms for Projection Games.
Pasin Manurangsi, Dana Moshkovitz: Improved Approximation Algorithms for Projection Games. CoRR abs/1408.4048 (2014)
View ArticleDissection with the Fewest Pieces is Hard, Even to Approximate.
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee: Dissection with the Fewest Pieces is Hard, Even to Approximate. CoRR abs/1512.06706...
View ArticleNear-Optimal UGC-hardness of Approximating Max k-CSP_R.
Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan: Near-Optimal UGC-hardness of Approximating Max k-CSP_R. CoRR abs/1511.06558 (2015)
View ArticleApproximating Dense Max 2-CSPs.
Pasin Manurangsi, Dana Moshkovitz: Approximating Dense Max 2-CSPs. CoRR abs/1507.08348 (2015)
View ArticleDissection with the Fewest Pieces is Hard, Even to Approximate.
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Jayson Lynch, Pasin Manurangsi, Mikhail Rudoy, Anak Yodpinyanee: Dissection with the Fewest Pieces is Hard, Even to Approximate. JCDCGG 2015: 37-48
View ArticleApproximating Dense Max 2-CSPs.
Pasin Manurangsi, Dana Moshkovitz: Approximating Dense Max 2-CSPs. APPROX-RANDOM 2015: 396-415
View ArticleAlmost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph.
Pasin Manurangsi: Almost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph. Electron. Colloquium Comput. Complex. TR16 (2016)
View ArticleAlmost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph.
Pasin Manurangsi: Almost-Polynomial Ratio ETH-Hardness of Approximating Densest $k$-Subgraph. CoRR abs/1611.05991 (2016)
View ArticleAn Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for...
Haris Angelidakis, Yury Makarychev, Pasin Manurangsi: An Improved Integrality Gap for the Calinescu-Karloff-Rabani Relaxation for Multiway Cut. CoRR abs/1611.05530 (2016)
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. CoRR abs/1607.02986 (2016)
View ArticleClik here to view.
Near-Optimal UGC-hardness of Approximating Max k-CSP_R.
Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan: Near-Optimal UGC-hardness of Approximating Max k-CSP_R. APPROX-RANDOM 2016: 15:1-15:28
View ArticleOn the Parameterized Complexity of Approximating Dominating Set.
Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi: On the Parameterized Complexity of Approximating Dominating Set. Electron. Colloquium Comput. Complex. TR17 (2017)
View ArticleOn the Parameterized Complexity of Approximating Dominating Set.
Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi: On the Parameterized Complexity of Approximating Dominating Set. CoRR abs/1711.11029 (2017)
View ArticleFrom 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. CoRR...
View ArticleParameterized Approximation Algorithms for Directed Steiner Network Problems.
Rajesh Chitnis, Andreas Emil Feldmann, Pasin Manurangsi: Parameterized Approximation Algorithms for Directed Steiner Network Problems. CoRR abs/1707.06499 (2017)
View ArticleAsymptotic Existence of Fair Divisions for Groups.
Pasin Manurangsi, Warut Suksompong: Asymptotic Existence of Fair Divisions for Groups. CoRR abs/1706.08219 (2017)
View ArticleInapproximability of VC Dimension and Littlestone's Dimension.
Pasin Manurangsi, Aviad Rubinstein: Inapproximability of VC Dimension and Littlestone's Dimension. CoRR abs/1705.09517 (2017)
View ArticleInapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest...
Pasin Manurangsi: Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis. CoRR abs/1705.03581 (2017)
View ArticleComputing an Approximately Optimal Agreeable Set of Items.
Pasin Manurangsi, Warut Suksompong: Computing an Approximately Optimal Agreeable Set of Items. CoRR abs/1705.02748 (2017)
View Article