| No. |
Title |
Author |
Year |
| 1 |
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming |
Briański, Marcin et al. |
2022 |
| 2 |
Scheduling Kernels via Configuration LP |
Knop, Dušan et al. |
2022 |
| 3 |
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines |
Koutecký, Martin et al. |
2020 |
| 4 |
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming |
Chan, Timothy F. N. et al. |
2020 |
| 5 |
New Bounds on Augmenting Steps of Block-Structured Integer Programs |
Chen, Lin et al. |
2020 |
| 6 |
Integer Programming in Parameterized Complexity: Three Miniatures |
Gavenciak, Tomás et al. |
2019 |
| 7 |
A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs |
Koutecký, Martin et al. |
2018 |
| 8 |
Evaluating and Tuning n-fold Integer Programming |
Altmanová, Katerina et al. |
2018 |
| 9 |
Combinatorial n-fold Integer Programming and Applications |
Knop, Dusan et al. |
2017 |
| 10 |
Voting and Bribing in Single-Exponential Time |
Knop, Dusan et al. |
2017 |
| 11 |
Extension Complexity, MSO Logic, and Treewidth |
Kolman, Petr et al. |
2016 |
