- Parameterized Complexity of Generalized Domination Problems2010 | Faculty of Mathematics and Physics
- Parameterized Complexity of Untangling Knots2022 | Faculty of Mathematics and Physics
- Integer programming in parameterized complexity: Five miniatures2022 | Faculty of Mathematics and Physics, Central Library of Charles University
- Parameterized complexity of generalized domination problems2012 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Deletion Problems2017 | Faculty of Mathematics and Physics
- The Parameterized Complexity of the Survivable Network Design Problem2022 | Faculty of Mathematics and Physics
- Parameterized complexity of coloring problems: Treewidth versus vertex cover2011 | Faculty of Mathematics and Physics
- Parameterized Complexity of Arc-Weighted Directed Steiner Problems +12011 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics
- A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms2020 | Faculty of Mathematics and Physics
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Extended abstract)2009 | Faculty of Mathematics and Physics
- Parameterized Complexity of Synchronization and Road Coloring2015 | Faculty of Mathematics and Physics
- Parameterized complexity of configuration integer programs2021 | Faculty of Mathematics and Physics
- Parameterized complexity of distance labeling and uniform channel assignment problems2018 | Faculty of Mathematics and Physics
- Parameterized Complexity of Length-bounded Cuts and Multicuts2018 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Vertex Evaluation Problems2019 | Faculty of Mathematics and Physics
- What Makes Equitable Connected Partition Easy2010 | Faculty of Mathematics and Physics
- Partitioning Graphs into Induced Subgraphs2017 | Faculty of Mathematics and Physics
- Target Set Selection in Dense Graph Classes +12018 | Faculty of Mathematics and Physics
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs2018 | Faculty of Mathematics and Physics
- Parameterized Problems Related to Seidel''s Switching2011 | Faculty of Mathematics and Physics
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines2020 | Faculty of Mathematics and Physics
- Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory2020 | Faculty of Mathematics and Physics
- Algorithmic Properties of Sparse Digraphs2019 | Faculty of Mathematics and Physics
- The Parametrized Complexity of the Segment Number2024 | Faculty of Mathematics and Physics
- Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity2019 | Faculty of Mathematics and Physics
- Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth2015 | Faculty of Mathematics and Physics
- Notes on complexity of packing coloring2018 | Faculty of Mathematics and Physics