- FPT Inapproximability of Directed Cut and Connectivity Problems2019 | Faculty of Mathematics and Physics
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs +12006 | Faculty of Mathematics and Physics
- FPT Algorithms for Diverse Collections of Hitting Sets2019 | Faculty of Mathematics and Physics
- MSOL restricted contractibility to planar graphs2017 | Faculty of Mathematics and Physics
- Extension Complexity, MSO Logic, and Treewidth2016 | Faculty of Mathematics and Physics
- TIGHT BOUNDS FOR PLANAR STRONGLY CONNECTED STEINER SUBGRAPH WITH FIXED NUMBER OF TERMINALS (AND EXTENSIONS)2020 | Faculty of Mathematics and Physics
- Variablity of the left vertebral artery - accidental autopsy finding and prevalence arch in the population2021 | Faculty of Medicine in Pilsen, First Faculty of Medicine
- Partitioning Graphs into Induced Subgraphs2017 | Faculty of Mathematics and Physics
- New Bounds on Augmenting Steps of Block-Structured Integer Programs2020 | Faculty of Mathematics and Physics
- Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem2020 | Faculty of Mathematics and Physics
- Parameterized resiliency problems2019 | 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 Length-bounded Cuts and Multicuts2018 | Faculty of Mathematics and Physics
- Parametrized Complexity of Length-Bounded Cuts and Multi-cuts2015 | Faculty of Mathematics and Physics
- The Parameterized Complexity of the Survivable Network Design Problem2022 | Faculty of Mathematics and Physics
- Anti-Path Cover on Sparse Graph Classes2016 | Faculty of Mathematics and Physics
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs2014 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Deletion Problems2017 | Faculty of Mathematics and Physics
- Parameterized complexity of fair deletion problems2020 | Faculty of Mathematics and Physics
- On Algorithms Employing Treewidth for L-bounded Cut Problems2018 | Faculty of Mathematics and Physics
- The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems2016 | Faculty of Mathematics and Physics
- Parameterized complexity of distance labeling and uniform channel assignment problems2018 | Faculty of Mathematics and Physics
- Efficient fully dynamic elimination forests with applications to detecting long paths and cycles2021 | 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
- Combinatorial problems on H-graphs2017 | Faculty of Mathematics and Physics
- Polynomial time approximation schemes for clustering in low highway dimension graphs2021 | Faculty of Mathematics and Physics
- MSOL Restricted Contractibility to Planar Graphs2012 | Faculty of Mathematics and Physics
- Parameterized Complexity of Fair Vertex Evaluation Problems2019 | Faculty of Mathematics and Physics
- Notes on complexity of packing coloring2018 | Faculty of Mathematics and Physics
