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

1 |
Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems |
Abboud, Amir et al. |
2022 |

2 |
Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem |
Bhattiprolu, Vijay et al. |
2022 |

3 |
A Constant-Factor Approximation for Weighted Bond Cover |
Kim, Eun Jung et al. |
2021 |

4 |
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion |
Ahn, Jungho et al. |
2020 |

5 |
Improved 3LIN Hardness via Linear Label Cover |
Harsha, Prahladh et al. |
2019 |

6 |
Tight FPT Approximations for k-Median and k-Means |
Cohen-Addad, Vincent et al. |
2019 |

7 |
Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities |
Lee, Euiwoong et al. |
2018 |

8 |
Understanding the Correlation Gap For Matchings |
Guruganesh, Guru et al. |
2018 |

9 |
Global and Fixed-Terminal Cuts in Digraphs |
Bérczi, Kristóf et al. |
2017 |

10 |
Improved Hardness for Cut, Interdiction, and Firefighter Problems |
Lee, Euiwoong |
2017 |

11 |
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere |
Bhattiprolu, Vijay et al. |
2017 |

12 |
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises |
Bhattiprolu, Vijay V. S. P. et al. |
2015 |

13 |
Inapproximability of H-Transversal/Packing |
Guruswami, Venkatesan et al. |
2015 |

14 |
Towards a Characterization of Approximation Resistance for Symmetric CSPs |
Guruswami, Venkatesan et al. |
2015 |