No. Title Author Year
1 On Covering Segments with Unit Intervals Bergren, Dan et al. 2020
2 Bisection of Bounded Treewidth Graphs by Convolutions Eiben, Eduard et al. 2019
3 Complexity of the Steiner Network Problem with Respect to the Number of Terminals Eiben, Eduard et al. 2019
4 Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eiben, Eduard et al. 2019
5 How to Navigate Through Obstacles? Eiben, Eduard et al. 2018
6 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
7 Small Resolution Proofs for QBF using Dependency Treewidth Eiben, Eduard et al. 2018
8 Lossy Kernels for Hitting Subgraphs Eiben, Eduard et al. 2017
9 Towards a Polynomial Kernel for Directed Feedback Vertex Set Bergougnoux, Benjamin et al. 2017
10 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
11 Counting Linear Extensions: Parameterizations by Treewidth Eiben, Eduard et al. 2016
12 Meta-kernelization using Well-structured Modulators Eiben, Eduard et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 12


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