- Optimal discretization is fixed-parameter tractable2021 | Faculty of Mathematics and Physics
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs +12006 | Faculty of Mathematics and Physics
- Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem2020 | Faculty of Mathematics and Physics
- Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory2022 | Faculty of Mathematics and Physics
- Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory2020 | Faculty of Mathematics and Physics
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)2016 | Faculty of Mathematics and Physics
- LARGE INDEPENDENT SETS IN TRIANGLE-FREE PLANAR GRAPHS2017 | Faculty of Mathematics and Physics
- The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems2016 | Faculty of Mathematics and Physics
- A Unifying Framework for Manipulation Problems2018 | Faculty of Mathematics and Physics
- MATRICES OF OPTIMAL TREE-DEPTH AND A ROW-INVARIANT PARAMETERIZED ALGORITHM FOR INTEGER PROGRAMMING2022 | Faculty of Mathematics and Physics
- Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming2022 | Faculty of Mathematics and Physics
- Parameterized complexity of distance labeling and uniform channel assignment problems2018 | Faculty of Mathematics and Physics
- On Algorithms Employing Treewidth for L-bounded Cut Problems2018 | Faculty of Mathematics and Physics
- New Bounds on Augmenting Steps of Block-Structured Integer Programs2020 | Faculty of Mathematics and Physics
- On extended formulations for parameterized steiner trees2021 | Faculty of Mathematics and Physics
- Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming2020 | Faculty of Mathematics and Physics
- Parameterized Complexity of Arc-Weighted Directed Steiner Problems +12009 | Faculty of Mathematics and Physics
- FPT Algorithms for Diverse Collections of Hitting Sets2019 | Faculty of Mathematics and Physics
- Parameterized resiliency problems2019 | Faculty of Mathematics and Physics
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width2012 | Faculty of Mathematics and Physics
- Deciding first order properties of matroids2012 | Faculty of Mathematics and Physics
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs2018 | Faculty of Mathematics and Physics
- Multi-Party Campaigning2021 | Faculty of Mathematics and Physics
- Scheduling meets n-fold integer programming2018 | Faculty of Mathematics and Physics
- Structural sparsity2016 | Faculty of Mathematics and Physics
- Large Independent Sets in Triangle-Free Planar Graphs2014 | Faculty of Mathematics and Physics
- First-Order Interpretations of Bounded Expansion Classes +12018 | Faculty of Mathematics and Physics