| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Delay-Robust Routes in Temporal Graphs | Füchsle, Eugen et al. | 2022 |
| 2 | Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives | Kunz, Pascal et al. | 2022 |
| 3 | Temporal Connectivity: Coping with Foreseen and Unforeseen Delays | Füchsle, Eugen et al. | 2022 |
| 4 | Parameterized Algorithms for Diverse Multistage Problems | Kellerhals, Leon et al. | 2021 |
| 5 | Temporal Reachability Minimization: Delaying vs. Deleting | Molter, Hendrik et al. | 2021 |
| 6 | The Complexity of Transitively Orienting Temporal Graphs | Mertzios, George B. et al. | 2021 |
| 7 | Using a Geometric Lens to Find k Disjoint Shortest Paths | Bentert, Matthias et al. | 2021 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |