No. |
Title |
Author |
Year |
---|

1 |
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation |
Manurangsi, Pasin |
2018 |

2 |
Average Whenever You Meet: Opportunistic Protocols for Community Detection |
Becchetti, Luca et al. |
2018 |

3 |
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network |
Dinur, Irit et al. |
2018 |

4 |
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut |
Manurangsi, Pasin et al. |
2018 |

5 |
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic |
C. S., Karthik et al. |
2018 |

6 |
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems |
Chitnis, Rajesh et al. |
2018 |

7 |
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH |
Bhattacharyya, Arnab et al. |
2018 |

8 |
Sherali-Adams Integrality Gaps Matching the Log-Density Threshold |
Chlamtác, Eden et al. |
2018 |

9 |
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs |
Manurangsi, Pasin et al. |
2017 |

10 |
Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis |
Manurangsi, Pasin |
2017 |

11 |
Near-Optimal UGC-hardness of Approximating Max k-CSP_R |
Manurangsi, Pasin et al. |
2016 |

12 |
Approximating Dense Max 2-CSPs |
Manurangsi, Pasin et al. |
2015 |