No. Title Author Year
1 Turbocharging Heuristics for Weak Coloring Numbers Dobler, Alexander et al. 2022
2 Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings Li, Shaohua et al. 2021
3 The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs Bellitto, Thomas et al. 2020
4 The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth Kowalik, Łukasz et al. 2020
5 On Computing Centroids According to the p-Norms of Hamming Distance Vectors Chen, Jiehua et al. 2019
6 Packing Directed Circuits Quarter-Integrally Masarík, Tomás et al. 2019
7 Cluster Editing in Multi-Layer and Temporal Graphs Chen, Jiehua et al. 2018
8 How Hard Is It to Satisfy (Almost) All Roommates? Chen, Jiehua et al. 2018
9 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
10 Finding Secluded Places of Special Interest in Graphs van Bevern, René et al. 2017
11 Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs Kanj, Iyad et al. 2016
12 Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems van Bevern, René et al. 2015
13 On Kernelization and Approximation for the Vector Connectivity Problem Kratsch, Stefan et al. 2015
14 The Parameterized Complexity of the Minimum Shared Edges Problem Fluschnik, Till et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 14

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