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


DROPS-Home | Imprint | Privacy Published by LZI