No. Title Author Year
1 A Graph-Theoretic Formulation of Exploratory Blockmodeling Bille, Alexander et al. 2023
2 On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric Holznigenkemper, Jana et al. 2023
3 On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem Komusiewicz, Christian et al. 2023
4 Covering Many (Or Few) Edges with k Vertices in Sparse Graphs Koana, Tomohiro et al. 2022
5 Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard Komusiewicz, Christian et al. 2022
6 Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial Komusiewicz, Christian et al. 2022
7 Essentially Tight Kernels For (Weakly) Closed Graphs Koana, Tomohiro et al. 2021
8 Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration Golovach, Petr A. et al. 2021
9 Colored Cut Games Morawietz, Nils et al. 2020
10 Computing Dense and Sparse Subgraphs of Weakly Closed Graphs Koana, Tomohiro et al. 2020
11 Exploiting c-Closure in Kernelization Algorithms for Graph Problems Koana, Tomohiro et al. 2020
12 Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs Grüttemeier, Niels et al. 2020
13 String Factorizations Under Various Collision Constraints Grüttemeier, Niels et al. 2020
14 Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms Komusiewicz, Christian et al. 2019
15 On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure Fertin, Guillaume et al. 2018
16 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
17 The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration Dell, Holger et al. 2018
18 Beyond Adjacency Maximization: Scaffold Filling for New String Distances Bulteau, Laurent et al. 2017
19 Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping Komusiewicz, Christian et al. 2017
20 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
21 Graph Motif Problems Parameterized by Dual Fertin, Guillaume et al. 2016
22 Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs Kanj, Iyad et al. 2016
23 Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems van Bevern, René et al. 2015
24 Parameterized Complexity of Critical Node Cuts Hermelin, Danny et al. 2015
25 A Cubic-Vertex Kernel for Flip Consensus Tree Komusiewicz, Christian et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 25

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