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

1 |
A Scaling Algorithm for Weighted f-Factors in General Graphs |
Duan, Ran et al. |
2020 |

2 |
Roundtrip Spanners with (2k-1) Stretch |
Cen, Ruoxu et al. |
2020 |

3 |
Faster Algorithms for All Pairs Non-Decreasing Paths Problem |
Duan, Ran et al. |
2019 |

4 |
An Improved Algorithm for Incremental DFS Tree in Undirected Graphs |
Chen, Lijie et al. |
2018 |

5 |
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time |
Duan, Ran et al. |
2018 |

6 |
Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs |
Duan, Ran et al. |
2018 |

7 |
Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs |
Duan, Ran et al. |
2018 |