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

1 |
A New Conjecture on Hardness of 2-CSPâ€™s with Implications to Hardness of Densest k-Subgraph and Other Problems |
Chuzhoy, Julia et al. |
2023 |

2 |
On Diameter Approximation in Directed Graphs |
Abboud, Amir et al. |
2023 |

3 |
Approximation Algorithms for Min-Distance Problems in DAGs |
Dalirrooyfard, Mina et al. |
2021 |

4 |
Distributed Distance Approximation |
Ancona, Bertie et al. |
2021 |

5 |
Conditionally Optimal Approximation Algorithms for the Girth of a Directed Graph |
Dalirrooyfard, Mina et al. |
2020 |

6 |
Approximation Algorithms for Min-Distance Problems |
Dalirrooyfard, Mina et al. |
2019 |

7 |
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems |
Dalirrooyfard, Mina et al. |
2019 |