Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis von Manurangsi, Pasin

Volltext

Generalized kings and single-elimination winners in random tournaments von Manurangsi, Pasin, Suksompong, Warut

Volltext

The Price of Fairness for Indivisible Goods von Bei, Xiaohui, Lu, Xinhang, Manurangsi, Pasin, Suksompong, Warut

Volltext

Asymptotic existence of fair divisions for groups von Manurangsi, Pasin, Suksompong, Warut

Volltext

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms von Feldmann, Andreas Emil, Karthik C. S., Karthik C., Lee, Euiwoong, Manurangsi, Pasin

Volltext

On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic von Karthik, C. S., Manurangsi, Pasin

Volltext

Improved Approximation Algorithms for Projection Games von Manurangsi, Pasin, Moshkovitz, Dana

Volltext

Improved lower bound for differentially private facility location von Manurangsi, Pasin

Volltext

A note on hardness of computing recursive teaching dimension von Manurangsi, Pasin

Volltext

Linear discrepancy is Π2-hard to approximate von Manurangsi, Pasin

Volltext

Linear discrepancy is Pi(2)-hard to approximate von Manurangsi, Pasin

Volltext

A note on degree vs gap of Min-Rep Label Cover and improved inapproximability for connectivity problems von Manurangsi, Pasin

Volltext

Fixing knockout tournaments with seeds von Manurangsi, Pasin, Suksompong, Warut

Volltext

Almost envy-freeness for groups: Improved bounds via discrepancy theory von Manurangsi, Pasin, Suksompong, Warut

Volltext

Computing a small agreeable set of indivisible items von Manurangsi, Pasin, Suksompong, Warut

Volltext

CLOSING GAPS IN ASYMPTOTIC FAIR DIVISION von Manurangsi, Pasin, Suksompong, Warut

Volltext

WHEN DO ENVY-FREE ALLOCATIONS EXIST? von Manurangsi, Pasin, Suksompong, Warut

Volltext

Approximation and hardness of Shift-Bribery von Faliszewski, Piotr, Manurangsi, Pasin, Sornat, Krzysztof

Volltext

On the Parameterized Complexity of Approximating Dominating Set von S., Karthik C., Laekhanukit, Bundit, Manurangsi, Pasin

Volltext

On the complexity of fair house allocation von Kamiyama, Naoyuki, Manurangsi, Pasin, Suksompong, Warut

Volltext