| No. |
Title |
Author |
Year |
| 1 |
Front Matter, Table of Contents, Preface, Conference Organization |
Berenbrink, Petra et al. |
2023 |
| 2 |
LIPIcs, Volume 254, STACS 2023, Complete Volume |
Berenbrink, Petra et al. |
2023 |
| 3 |
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth |
Bergougnoux, Benjamin et al. |
2023 |
| 4 |
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k |
Kanté, Mamadou Moustapha et al. |
2022 |
| 5 |
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth |
Kanté, Mamadou Moustapha et al. |
2020 |
| 6 |
Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs |
Conte, Alessio et al. |
2019 |
| 7 |
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints |
Bergougnoux, Benjamin et al. |
2019 |
| 8 |
On Maximal Cliques with Connectivity Constraints in Directed Graphs |
Conte, Alessio et al. |
2017 |
| 9 |
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion |
Kanté, Mamadou Moustapha et al. |
2015 |
