No. Title Author Year
1 Crossing-Optimal Extension of Simple Drawings Ganian, Robert et al. 2021
2 Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert et al. 2021
3 Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard et al. 2020
4 Extending Partial 1-Planar Drawings Eiben, Eduard et al. 2020
5 On Covering Segments with Unit Intervals Bergren, Dan et al. 2020
6 Group Activity Selection with Few Agent Types Ganian, Robert et al. 2019
7 Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eiben, Eduard et al. 2019
8 On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Ganian, Robert et al. 2018
9 Small Resolution Proofs for QBF using Dependency Treewidth Eiben, Eduard et al. 2018
10 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
11 On Structural Parameterizations of the Edge Disjoint Paths Problem Ganian, Robert et al. 2017
12 Towards a Polynomial Kernel for Directed Feedback Vertex Set Bergougnoux, Benjamin et al. 2017
13 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
14 Counting Linear Extensions: Parameterizations by Treewidth Eiben, Eduard et al. 2016
15 On Existential MSO and its Relation to ETH Ganian, Robert et al. 2016
16 On the Complexity Landscape of Connected f-Factor Problems Ganian, Robert et al. 2016
17 Meta-kernelization using Well-structured Modulators Eiben, Eduard et al. 2015
18 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
19 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
20 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
21 The Parameterized Complexity of Oriented Colouring Ganian, Robert 2009
Current Page :
Number of result pages: 1
Number of documents: 21


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