| No. |
Title |
Author |
Year |
| 1 |
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations |
Blažej, Václav et al. |
2022 |
| 2 |
Scheduling Kernels via Configuration LP |
Knop, Dušan et al. |
2022 |
| 3 |
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View |
Hušek, Radek et al. |
2020 |
| 4 |
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters |
Bentert, Matthias et al. |
2020 |
| 5 |
Recognizing Proper Tree-Graphs |
Chaplick, Steven et al. |
2020 |
| 6 |
Complexity of the Steiner Network Problem with Respect to the Number of Terminals |
Eiben, Eduard et al. |
2019 |
| 7 |
Integer Programming in Parameterized Complexity: Three Miniatures |
Gavenciak, Tomás et al. |
2019 |
| 8 |
Parameterized Complexity of Fair Vertex Evaluation Problems |
Knop, Dusan et al. |
2019 |
| 9 |
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters |
Bredereck, Robert et al. |
2019 |
| 10 |
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints |
Knop, Dusan et al. |
2019 |
| 11 |
Evaluating and Tuning n-fold Integer Programming |
Altmanová, Katerina et al. |
2018 |
| 12 |
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices |
Dvorák, Pavel et al. |
2018 |
| 13 |
Target Set Selection in Dense Graph Classes |
Dvorák, Pavel et al. |
2018 |
| 14 |
Combinatorial n-fold Integer Programming and Applications |
Knop, Dusan et al. |
2017 |
| 15 |
Voting and Bribing in Single-Exponential Time |
Knop, Dusan et al. |
2017 |
