| No. |
Title |
Author |
Year |
| 1 |
Lower Bounds for Conjunctive and Disjunctive Turing Kernels |
Burjons, Elisabet et al. |
2021 |
| 2 |
Online Simple Knapsack with Reservation Costs |
Böckenhauer, Hans-Joachim et al. |
2021 |
| 3 |
Parameterized Complexity (Dagstuhl Seminar 01311) |
Downey, Rodney G. et al. |
2021 |
| 4 |
An Open Pouring Problem |
Frei, Fabian et al. |
2020 |
| 5 |
First-Order Model-Checking in Random Graphs and Complex Networks |
Dreier, Jan et al. |
2020 |
| 6 |
Hard Problems on Random Graphs |
Dreier, Jan et al. |
2020 |
| 7 |
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size |
Dreier, Jan et al. |
2020 |
| 8 |
Randomization in Non-Uniform Finite Automata |
Ďuriš, Pavol et al. |
2020 |
| 9 |
Front Matter, Table of Contents, Preface, Conference Organization |
Rossmanith, Peter et al. |
2019 |
| 10 |
Hardness of FO Model-Checking on Random Graphs |
Dreier, Jan et al. |
2019 |
| 11 |
LIPIcs, Volume 138, MFCS'19, Complete Volume |
Rossmanith, Peter et al. |
2019 |
| 12 |
Motif Counting in Preferential Attachment Graphs |
Dreier, Jan et al. |
2019 |
| 13 |
The Complexity of Packing Edge-Disjoint Paths |
Dreier, Jan et al. |
2019 |
| 14 |
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem |
Chen, Li-Hsuan et al. |
2017 |
| 15 |
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) |
Kratsch, Stefan et al. |
2015 |
| 16 |
Lower Bounds on the Complexity of MSO_1 Model-Checking |
Ganian, Robert et al. |
2012 |
| 17 |
A Fine-grained Analysis of a Simple Independent Set Algorithm |
Kneis, Joachim et al. |
2009 |
