| No. |
Title |
Author |
Year |
| 1 |
When You Come at the King You Best Not Miss |
Lachish, Oded et al. |
2022 |
| 2 |
A General Kernelization Technique for Domination and Independence Problems in Sparse Classes |
Einarson, Carl et al. |
2020 |
| 3 |
Domination Above r-Independence: Does Sparseness Help? |
Einarson, Carl et al. |
2019 |
| 4 |
Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness |
Nadara, Wojciech et al. |
2018 |
| 5 |
Parameterized Algorithms for Zero Extension and Metric Labelling Problems |
Reidl, Felix et al. |
2018 |
| 6 |
Being Even Slightly Shallow Makes Life Hard |
Muzi, Irene et al. |
2017 |
| 7 |
k-Distinct In- and Out-Branchings in Digraphs |
Gutin, Gregory et al. |
2017 |
| 8 |
Path-Contractions, Edge Deletions and Connectivity Preservation |
Gutin, Gregory et al. |
2017 |
| 9 |
Kernelization and Sparseness: the Case of Dominating Set |
Drange, Pål Grønås et al. |
2016 |
| 10 |
Fast Biclustering by Dual Parameterization |
Drange, Pål Grønås et al. |
2015 |
