No. | Title | Author | Year |
---|---|---|---|
1 | Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs | Charalampopoulos, Panagiotis et al. | 2020 |
2 | Min-Cost Flow in Unit-Capacity Planar Graphs | Karczmarz, Adam et al. | 2019 |
3 | Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs | Karczmarz, Adam et al. | 2019 |
4 | Decremental SPQR-trees for Planar Graphs | Holm, Jacob et al. | 2018 |
5 | Improved Bounds for Shortest Paths in Dense Distance Graphs | Gawrychowski, Pawel et al. | 2018 |
6 | Contracting a Planar Graph Efficiently | Holm, Jacob et al. | 2017 |
7 | A Simple Mergeable Dictionary | Karczmarz, Adam | 2016 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 7 |