- Parameterized Algorithms for MILPs with Small Treedepth2021 | Matematicko-fyzikální fakulta
- Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming2020 | Matematicko-fyzikální fakulta
- MATRICES OF OPTIMAL TREE-DEPTH AND A ROW-INVARIANT PARAMETERIZED ALGORITHM FOR INTEGER PROGRAMMING2022 | Matematicko-fyzikální fakulta
- Parameterized complexity of configuration integer programs2021 | Matematicko-fyzikální fakulta
- Parametrized Complexity of Length-Bounded Cuts and Multi-cuts2015 | Matematicko-fyzikální fakulta
- Voting and Bribing in Single-Exponential Time2017 | Matematicko-fyzikální fakulta
- PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES2021 | Matematicko-fyzikální fakulta
- Parameterized approximation schemes for steiner trees with small number of Steiner vertices2018 | Matematicko-fyzikální fakulta
- Parameterized Complexity of Length-bounded Cuts and Multicuts2018 | Matematicko-fyzikální fakulta
- Parameterized Inapproximability of Independent Set in H-Free Graphs +12020 | Matematicko-fyzikální fakulta
- Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming2022 | Matematicko-fyzikální fakulta
- On the Parameterization of Rational Ringed Surfaces and Rational Canal Surfaces2014 | Matematicko-fyzikální fakulta
- Target Set Selection in Dense Graph Classes +12018 | Matematicko-fyzikální fakulta
- Solving Integer Linear Programs with a Small Number of Global Variables and Constraints2017 | Matematicko-fyzikální fakulta
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity2019 | Matematicko-fyzikální fakulta