| No. |
Title |
Author |
Year |
| 1 |
Classes of Intersection Digraphs with Good Algorithmic Properties |
Jaffke, Lars et al. |
2022 |
| 2 |
Hierarchical Clusterings of Unweighted Graphs |
Høgemo, Svein et al. |
2020 |
| 3 |
Typical Sequences Revisited - Computing Width Parameters of Graphs |
Bodlaender, Hans L. et al. |
2020 |
| 4 |
Front Matter, Table of Contents, Preface, Conference Organization |
Jansen, Bart M. P. et al. |
2019 |
| 5 |
Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width |
Jaffke, Lars et al. |
2019 |
| 6 |
LIPIcs, Volume 148, IPEC'19, Complete Volume |
Jansen, Bart M. P. et al. |
2019 |
| 7 |
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width |
Jaffke, Lars et al. |
2018 |
| 8 |
Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width |
Jaffke, Lars et al. |
2018 |
| 9 |
On Satisfiability Problems with a Linear Structure |
Gaspers, Serge et al. |
2017 |
| 10 |
Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set |
Jeong, Jisu et al. |
2015 |
