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