#### Filter Results:

- Full text PDF available (28)

#### Publication Year

2013

2019

- This year (18)
- Last 5 years (38)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Pasin Manurangsi
- ICALP
- 2017

The Small Set Expansion Hypothesis (SSEH) is a conjecture which roughly states that it is NPhard to distinguish between a graph with a small set of vertices whose expansion is almost zero and one inâ€¦ (More)

- Pasin Manurangsi, Prasad Raghavendra
- ICALP
- 2017

A (kÃ— l)-birthday repetition GkÃ—l of a two-prover game G is a game in which the two provers are sent random sets of questions from G of sizes k and l respectively. These two sets are sampledâ€¦ (More)

- S. KarthikC., Bundit Laekhanukit, Pasin Manurangsi
- STOC
- 2017

We study the parameterized complexity of approximating the <i>k</i>-Dominating Set (domset) problem where an integer <i>k</i> and a graph <i>G</i> on <i>n</i> vertices are given as input, and theâ€¦ (More)

- Pasin Manurangsi, Daniel Reichman
- ArXiv
- 2018

We consider the computational complexity of training depth-2 neural networks composed of rectified linear units (ReLUs). We show that, even for the case of a single ReLU, finding a set of weightsâ€¦ (More)

- Pasin Manurangsi, Warut Suksompong
- IJCAI
- 2017

We study the problem of finding a small subset of items that is agreeable to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shownâ€¦ (More)

We study the problem of deleting the smallest set S of vertices (resp. edges) from a given graph G such that the induced subgraph (resp. subgraph) G \ S belongs to some class H. We consider the caseâ€¦ (More)

- Pasin Manurangsi
- 2015

The projection games problem (also known as LABEL COVER) is a problem of great significance in the field of hardness of approximation since almost all NP-hardness of approximation results known todayâ€¦ (More)

- Pasin Manurangsi
- Algorithms
- 2018

The Small Set Expansion Hypothesis is a conjecture which roughly states that it is NP-hard to distinguish between a graph with a small subset of vertices whose (edge) expansion is almost zero and oneâ€¦ (More)

- Pasin Manurangsi
- STOC
- 2016

In the Densest <i>k</i>-Subgraph (D<i>k</i>S) problem, given an undirected graph <i>G</i> and an integer <i>k</i>, the goal is to find a subgraph of <i>G</i> on <i>k</i> vertices that containsâ€¦ (More)

- Parinya Chalermsook, Marek Cygan, +4 authors Luca Trevisan
- IEEE 58th Annual Symposium on Foundations ofâ€¦
- 2017

We consider questions that arise from the intersection between theareas of approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The questions, whichâ€¦ (More)