| No. |
Title |
Author |
Year |
| 1 |
First Order Logic on Pathwidth Revisited Again |
Lampis, Michael |
2023 |
| 2 |
Parameterized Max Min Feedback Vertex Set |
Lampis, Michael et al. |
2023 |
| 3 |
Structural Parameterizations for Two Bounded Degree Problems Revisited |
Lampis, Michael et al. |
2023 |
| 4 |
Determining a Slater Winner Is Complete for Parallel Access to NP |
Lampis, Michael |
2022 |
| 5 |
Hedonic Games and Treewidth Revisited |
Hanaka, Tesshu et al. |
2022 |
| 6 |
Digraph Coloring and Distance to Acyclicity |
Harutyunyan, Ararat et al. |
2021 |
| 7 |
Filling Crosswords Is Very Hard |
Gourvès, Laurent et al. |
2021 |
| 8 |
Fine-Grained Meta-Theorems for Vertex Integrity |
Lampis, Michael et al. |
2021 |
| 9 |
Minimum Stable Cut and Treewidth |
Lampis, Michael |
2021 |
| 10 |
(In)approximability of Maximum Minimal FVS |
Dublois, Louis et al. |
2020 |
| 11 |
Grundy Distinguishes Treewidth from Pathwidth |
Belmonte, Rémy et al. |
2020 |
| 12 |
New Algorithms for Mixed Dominating Set |
Dublois, Louis et al. |
2020 |
| 13 |
Token Sliding on Split Graphs |
Belmonte, Rémy et al. |
2019 |
| 14 |
Finer Tight Bounds for Coloring on Clique-Width |
Lampis, Michael |
2018 |
| 15 |
How Bad is the Freedom to Flood-It? |
Belmonte, Rémy et al. |
2018 |
| 16 |
Multistage Matchings |
Bampis, Evripidis et al. |
2018 |
| 17 |
New Results on Directed Edge Dominating Set |
Belmonte, Rémy et al. |
2018 |
| 18 |
On the Parameterized Complexity of Red-Blue Points Separation |
Bonnet, Édouard et al. |
2018 |
| 19 |
Parameterized (Approximate) Defective Coloring |
Belmonte, Rémy et al. |
2018 |
| 20 |
Parameterized Orientable Deletion |
Hanaka, Tesshu et al. |
2018 |
| 21 |
Treewidth with a Quantifier Alternation Revisited |
Lampis, Michael et al. |
2018 |
| 22 |
Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center |
Katsikarelis, Ioannis et al. |
2017 |
| 23 |
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse |
Fotakis, Dimitris et al. |
2016 |
| 24 |
Time-Approximation Trade-offs for Inapproximable Problems |
Bonnet, Édouard et al. |
2016 |
| 25 |
Complexity and Approximability of Parameterized MAX-CSPs |
Dell, Holger et al. |
2015 |
| 26 |
Periodic Metro Scheduling |
Bampas, Evangelos et al. |
2006 |
