| No. |
Title |
Author |
Year |
| 1 |
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth |
Kanté, Mamadou Moustapha et al. |
2020 |
| 2 |
Front Matter, Table of Contents, Preface, Conference Organization |
Paul, Christophe et al. |
2020 |
| 3 |
Hierarchical Clusterings of Unweighted Graphs |
Høgemo, Svein et al. |
2020 |
| 4 |
LIPIcs, Vol. 154, STACS 2020, Complete Volume |
Paul, Christophe et al. |
2020 |
| 5 |
Connected Search for a Lazy Robber |
Adler, Isolde et al. |
2019 |
| 6 |
Front Matter, Table of Contents, Preface, Conference Organization |
Paul, Christophe et al. |
2019 |
| 7 |
Front Matter, Table of Contents, Preface, Conference Organization |
Niedermeier, Rolf et al. |
2019 |
| 8 |
LIPIcs, Volume 115, IPEC'18, Complete Volume |
Paul, Christophe et al. |
2019 |
| 9 |
LIPIcs, Volume 126, STACS'19, Complete Volume |
Niedermeier, Rolf et al. |
2019 |
| 10 |
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter |
Baste, Julien et al. |
2018 |
| 11 |
Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs |
Barbero, Florian et al. |
2017 |
| 12 |
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion |
Kanté, Mamadou Moustapha et al. |
2015 |
| 13 |
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
Kim, Eun Jung et al. |
2015 |
| 14 |
Explicit Linear Kernels via Dynamic Programming |
Garnero, Valentin et al. |
2014 |
| 15 |
Obtaining a Bipartite Graph by Contracting Few Edges |
Heggernes, Pinar et al. |
2011 |
| 16 |
Kernels for Feedback Arc Set In Tournaments |
Bessy, Stéphane et al. |
2009 |
