No. Title Author Year
1 Colored Cut Games Morawietz, Nils et al. 2020
2 Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Koana, Tomohiro et al. 2020
3 Exploiting c-Closure in Kernelization Algorithms for Graph Problems Koana, Tomohiro et al. 2020
4 Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs Grüttemeier, Niels et al. 2020
5 String Factorizations Under Various Collision Constraints Grüttemeier, Niels et al. 2020
6 Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms Komusiewicz, Christian et al. 2019
7 On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure Fertin, Guillaume et al. 2018
8 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
9 The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration Dell, Holger et al. 2018
10 Beyond Adjacency Maximization: Scaffold Filling for New String Distances Bulteau, Laurent et al. 2017
11 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
12 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
13 Graph Motif Problems Parameterized by Dual Fertin, Guillaume et al. 2016
14 Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs Kanj, Iyad et al. 2016
15 Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems van Bevern, René et al. 2015
16 Parameterized Complexity of Critical Node Cuts Hermelin, Danny et al. 2015
17 A Cubic-Vertex Kernel for Flip Consensus Tree Komusiewicz, Christian et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 17

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