| No. |
Title |
Author |
Year |
| 1 |
List Colouring Trees in Logarithmic Space |
Bodlaender, Hans L. et al. |
2022 |
| 2 |
On the Complexity of Problems on Tree-Structured Graphs |
Bodlaender, Hans L. et al. |
2022 |
| 3 |
On the Parameterized Complexity of Computing Tree-Partitions |
Bodlaender, Hans L. et al. |
2022 |
| 4 |
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure |
Bodlaender, Hans L. et al. |
2022 |
| 5 |
Parameterized Complexities of Dominating and Independent Set Reconfiguration |
Bodlaender, Hans L. et al. |
2021 |
| 6 |
Parameterized Complexity of Scheduling Chains of Jobs with Delays |
Bodlaender, Hans L. et al. |
2020 |
| 7 |
Typical Sequences Revisited - Computing Width Parameters of Graphs |
Bodlaender, Hans L. et al. |
2020 |
| 8 |
Computing Treewidth on the GPU |
van der Zanden, Tom C. et al. |
2018 |
| 9 |
On the Exact Complexity of Polyomino Packing |
Bodlaender, Hans L. et al. |
2018 |
| 10 |
A Faster Parameterized Algorithm for Pseudoforest Deletion |
Bodlaender, Hans L. et al. |
2017 |
| 11 |
Cut and Count and Representative Sets on Branch Decompositions |
Pino, Willem J. A. et al. |
2017 |
| 12 |
Front Matter, Table of Contents, Preface, Conference Organization |
Larsen, Kim G. et al. |
2017 |
| 13 |
LIPIcs, Volume 83, MFCS'17, Complete Volume |
Larsen, Kim G. et al. |
2017 |
| 14 |
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity |
Bodlaender, Hans L. et al. |
2016 |
| 15 |
Subexponential Time Algorithms for Embedding H-Minor Free Graphs |
Bodlaender, Hans L. et al. |
2016 |
| 16 |
Definability Equals Recognizability for k-Outerplanar Graphs |
Jaffke, Lars et al. |
2015 |
| 17 |
Practical Algorithms for Linear Boolean-width |
ten Brinke, Chiel B. et al. |
2015 |
| 18 |
Graph Modification Problems (Dagstuhl Seminar 14071) |
Bodlaender, Hans L. et al. |
2014 |
| 19 |
Cross-Composition: A New Technique for Kernelization Lower Bounds |
Bodlaender, Hans L. et al. |
2011 |
| 20 |
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter |
Jansen, Bart M. P. et al. |
2011 |
| 21 |
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set |
van Rooij, Johan M. M. et al. |
2008 |
