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

1 |
A Local-To-Global Theorem for Congested Shortest Paths |
Akmal, Shyan et al. |
2023 |

2 |
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity |
Akmal, Shyan et al. |
2023 |

3 |
Faster Detours in Undirected Graphs |
Akmal, Shyan et al. |
2023 |

4 |
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity |
Akmal, Shyan et al. |
2022 |

5 |
Faster Algorithms for Bounded Tree Edit Distance |
Akmal, Shyan et al. |
2021 |

6 |
Improved Approximation for Longest Common Subsequence over Small Alphabets |
Akmal, Shyan et al. |
2021 |