| No. |
Title |
Author |
Year |
| 1 |
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions |
Heeger, Klaus et al. |
2023 |
| 2 |
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions |
Bulteau, Laurent et al. |
2022 |
| 3 |
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time |
Schulz, Hjalmar et al. |
2022 |
| 4 |
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems |
Boehmer, Niclas et al. |
2022 |
| 5 |
Delay-Robust Routes in Temporal Graphs |
Füchsle, Eugen et al. |
2022 |
| 6 |
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives |
Kunz, Pascal et al. |
2022 |
| 7 |
Temporal Connectivity: Coping with Foreseen and Unforeseen Delays |
Füchsle, Eugen et al. |
2022 |
| 8 |
Temporal Unit Interval Independent Sets |
Hermelin, Danny et al. |
2022 |
| 9 |
There and Back Again: On Applying Data Reduction Rules by Undoing Others |
Figiel, Aleksander et al. |
2022 |
| 10 |
Binary Matrix Completion Under Diameter Constraints |
Koana, Tomohiro et al. |
2021 |
| 11 |
Parameterized Complexity (Dagstuhl Seminar 01311) |
Downey, Rodney G. et al. |
2021 |
| 12 |
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171) |
Casteigts, Arnaud et al. |
2021 |
| 13 |
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443) |
Bordewich, Magnus et al. |
2020 |
| 14 |
Application-Oriented Computational Social Choice (Dagstuhl Seminar 19381) |
Grandi, Umberto et al. |
2020 |
| 15 |
Computing Maximum Matchings in Temporal Graphs |
Mertzios, George B. et al. |
2020 |
| 16 |
Faster Binary Mean Computation Under Dynamic Time Warping |
Schaar, Nathan et al. |
2020 |
| 17 |
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs |
Fluschnik, Till et al. |
2020 |
| 18 |
Parameterized Algorithms for Matrix Completion with Radius Constraints |
Koana, Tomohiro et al. |
2020 |
| 19 |
Front Matter, Table of Contents, Preface, Conference Organization |
Niedermeier, Rolf et al. |
2019 |
| 20 |
LIPIcs, Volume 126, STACS'19, Complete Volume |
Niedermeier, Rolf et al. |
2019 |
| 21 |
Multistage Vertex Cover |
Fluschnik, Till et al. |
2019 |
| 22 |
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters |
Bredereck, Robert et al. |
2019 |
| 23 |
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality |
Bentert, Matthias et al. |
2018 |
| 24 |
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments |
Korenwein, Viatcheslav et al. |
2018 |
| 25 |
Front Matter, Table of Contents, Preface, Conference Organization |
Niedermeier, Rolf et al. |
2018 |
| 26 |
LIPIcs, Volume 96, STACS'18, Complete Volume |
Niedermeier, Rolf et al. |
2018 |
| 27 |
Parameterized Dynamic Cluster Editing |
Luo, Junjie et al. |
2018 |
| 28 |
The Complexity of Finding Small Separators in Temporal Graphs |
Zschoche, Philipp et al. |
2018 |
| 29 |
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs |
Bredereck, Robert et al. |
2017 |
| 30 |
The Power of Linear-Time Data Reduction for Maximum Matching |
Mertzios, George B. et al. |
2017 |
