| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication | Bentert, Matthias et al. | 2023 |
| 2 | Using a Geometric Lens to Find k Disjoint Shortest Paths | Bentert, Matthias et al. | 2021 |
| 3 | Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters | Bentert, Matthias et al. | 2020 |
| 4 | An Adaptive Version of Brandes' Algorithm for Betweenness Centrality | Bentert, Matthias et al. | 2018 |
| 5 | Tree Containment With Soft Polytomies | Bentert, Matthias et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |