No. Title Author Year
1 Counting Temporal Paths Enright, Jessica et al. 2023
2 Delay-Robust Routes in Temporal Graphs Füchsle, Eugen et al. 2022
3 Hardness of Interval Scheduling on Unrelated Machines Hermelin, Danny et al. 2022
4 Temporal Connectivity: Coping with Foreseen and Unforeseen Delays Füchsle, Eugen et al. 2022
5 Temporal Unit Interval Independent Sets Hermelin, Danny et al. 2022
6 The Complexity of Computing Optimum Labelings for Temporal Connectivity Klobas, Nina et al. 2022
7 Temporal Reachability Minimization: Delaying vs. Deleting Molter, Hendrik et al. 2021
8 The Complexity of Transitively Orienting Temporal Graphs Mertzios, George B. et al. 2021
9 Computing Maximum Matchings in Temporal Graphs Mertzios, George B. et al. 2020
10 Finding Temporal Paths Under Waiting Time Constraints Casteigts, Arnaud et al. 2020
11 A Parameterized Complexity View on Collapsing k-Cores Luo, Junjie et al. 2019
12 Cluster Editing in Multi-Layer and Temporal Graphs Chen, Jiehua et al. 2018
13 Parameterized Dynamic Cluster Editing Luo, Junjie et al. 2018
14 The Complexity of Finding Small Separators in Temporal Graphs Zschoche, Philipp et al. 2018
15 Finding Secluded Places of Special Interest in Graphs van Bevern, René et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI