No. Title Author Year
1 Parameterized Algorithms for Diverse Multistage Problems Kellerhals, Leon et al. 2021
2 Temporal Reachability Minimization: Delaying vs. Deleting Molter, Hendrik et al. 2021
3 The Complexity of Transitively Orienting Temporal Graphs Mertzios, George B. et al. 2021
4 The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing Kellerhals, Leon et al. 2021
5 Using a Geometric Lens to Find k Disjoint Shortest Paths Bentert, Matthias et al. 2021
6 Computing Maximum Matchings in Temporal Graphs Mertzios, George B. et al. 2020
7 Finding Temporal Paths Under Waiting Time Constraints Casteigts, Arnaud et al. 2020
8 Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs Fluschnik, Till et al. 2020
9 Multistage Vertex Cover Fluschnik, Till et al. 2019
10 Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments Korenwein, Viatcheslav et al. 2018
11 The Complexity of Finding Small Separators in Temporal Graphs Zschoche, Philipp et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 11


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