No. Title Author Year
1 A Unifying Framework for Characterizing and Computing Width Measures Eiben, Eduard et al. 2022
2 Bounding and Computing Obstacle Numbers of Graphs Balko, Martin et al. 2022
3 Finding a Cluster in Incomplete Data Eiben, Eduard et al. 2022
4 Front Matter, Table of Contents, Preface, Conference Organization Szeider, Stefan et al. 2022
5 LIPIcs, Volume 241, MFCS 2022, Complete Volume Szeider, Stefan et al. 2022
6 Parameterized Algorithms for Upward Planarity Chaplick, Steven et al. 2022
7 The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Ganian, Robert et al. 2022
8 Weighted Model Counting with Twin-Width Ganian, Robert et al. 2022
9 Crossing-Optimal Extension of Simple Drawings Ganian, Robert et al. 2021
10 Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293) Ganian, Robert et al. 2021
11 Extending Nearly Complete 1-Planar Drawings in Polynomial Time Eiben, Eduard et al. 2020
12 Extending Partial 1-Planar Drawings Eiben, Eduard et al. 2020
13 On Covering Segments with Unit Intervals Bergren, Dan et al. 2020
14 Group Activity Selection with Few Agent Types Ganian, Robert et al. 2019
15 Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth Eiben, Eduard et al. 2019
16 On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem Ganian, Robert et al. 2018
17 Small Resolution Proofs for QBF using Dependency Treewidth Eiben, Eduard et al. 2018
18 Combining Treewidth and Backdoors for CSP Ganian, Robert et al. 2017
19 On Structural Parameterizations of the Edge Disjoint Paths Problem Ganian, Robert et al. 2017
20 Towards a Polynomial Kernel for Directed Feedback Vertex Set Bergougnoux, Benjamin et al. 2017
21 A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion Eiben, Eduard et al. 2016
22 Counting Linear Extensions: Parameterizations by Treewidth Eiben, Eduard et al. 2016
23 On Existential MSO and its Relation to ETH Ganian, Robert et al. 2016
24 On the Complexity Landscape of Connected f-Factor Problems Ganian, Robert et al. 2016
25 Meta-kernelization using Well-structured Modulators Eiben, Eduard et al. 2015
26 Lower Bounds on the Complexity of MSO_1 Model-Checking Ganian, Robert et al. 2012
27 Clique-width: When Hard Does Not Mean Impossible Ganian, Robert et al. 2011
28 Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width Ganian, Robert et al. 2010
29 The Parameterized Complexity of Oriented Colouring Ganian, Robert 2009
Current Page :
Number of result pages: 1
Number of documents: 29


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