No. Title Author Year
1 On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure Fertin, Guillaume et al. 2018
2 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
3 The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration Dell, Holger et al. 2018
4 Beyond Adjacency Maximization: Scaffold Filling for New String Distances Bulteau, Laurent et al. 2017
5 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
6 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
7 Graph Motif Problems Parameterized by Dual Fertin, Guillaume et al. 2016
8 Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs Kanj, Iyad et al. 2016
9 Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems van Bevern, René et al. 2015
10 Parameterized Complexity of Critical Node Cuts Hermelin, Danny et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 11

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