No. Title Author Year
1 A Polynomial Kernel for 3-Leaf Power Deletion Ahn, Jungho et al. 2020
2 A Polynomial Kernel for Line Graph Deletion Eiben, Eduard et al. 2020
3 A Polynomial Kernel for Paw-Free Editing Eiben, Eduard et al. 2020
4 Component Order Connectivity in Directed Graphs Bang-Jensen, Jørgen et al. 2020
5 Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard et al. 2020
6 Extending Partial 1-Planar Drawings Eiben, Eduard et al. 2020
7 On Covering Segments with Unit Intervals Bergren, Dan et al. 2020
8 Removing Connected Obstacles in the Plane Is FPT Eiben, Eduard et al. 2020
9 Bisection of Bounded Treewidth Graphs by Convolutions Eiben, Eduard et al. 2019
10 Complexity of the Steiner Network Problem with Respect to the Number of Terminals Eiben, Eduard et al. 2019
11 Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eiben, Eduard et al. 2019
12 How to Navigate Through Obstacles? Eiben, Eduard et al. 2018
13 Lossy Kernels for Connected Dominating Set on Sparse Graphs Eiben, Eduard et al. 2018
14 Small Resolution Proofs for QBF using Dependency Treewidth Eiben, Eduard et al. 2018
15 Lossy Kernels for Hitting Subgraphs Eiben, Eduard et al. 2017
16 Towards a Polynomial Kernel for Directed Feedback Vertex Set Bergougnoux, Benjamin et al. 2017
17 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
18 Counting Linear Extensions: Parameterizations by Treewidth Eiben, Eduard et al. 2016
19 Meta-kernelization using Well-structured Modulators Eiben, Eduard et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 19


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