ℹ️
🇬🇧
Search
Search for publications relevant for "W[1]-hardness"
W[1]-hardness
Publication
Class
Person
Publication
Programmes
Export current view
publication
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts
2015 |
Faculty of Mathematics and Physics
publication
Coal reserves available for current exploitation by the operating mines in the Czech Republic. Part 1. hard coal
1993 |
First Faculty of Medicine, Faculty of Mathematics and Physics
publication
Parameterized Complexity of Length-bounded Cuts and Multicuts
2018 |
Faculty of Mathematics and Physics
publication
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
2016 |
Faculty of Mathematics and Physics
publication
A Tight Lower Bound for Steiner Orientation
2018 |
Faculty of Mathematics and Physics
publication
A Tight Lower Bound for Planar Steiner Orientation
2019 |
Faculty of Mathematics and Physics
publication
Generalized k-Center: Distinguishing Doubling and Highway Dimension
2022 |
Faculty of Mathematics and Physics
publication
The Parameterized Complexity of the Survivable Network Design Problem
2022 |
Faculty of Mathematics and Physics
publication
The Parameterized Hardness of the k-Center Problem in Transportation Networks
+1
2020 |
Faculty of Mathematics and Physics
publication
Parameterized Complexity of Fair Vertex Evaluation Problems
2019 |
Faculty of Mathematics and Physics
publication
Parameterized extension complexity of independent set and related problems
2018 |
Faculty of Mathematics and Physics
publication
What Makes Equitable Connected Partition Easy
2010 |
Faculty of Mathematics and Physics
publication
Target Set Selection in Dense Graph Classes
+1
2018 |
Faculty of Mathematics and Physics
publication
Parameterized shifted combinatorial optimization
2019 |
Faculty of Mathematics and Physics
publication
Parameterized Complexity of Fair Deletion Problems
2017 |
Faculty of Mathematics and Physics
publication
Parameterized approximation schemes for steiner trees with small number of Steiner vertices
2018 |
Faculty of Mathematics and Physics
publication
PARAMETERIZED APPROXIMATION SCHEMES FOR STEINER TREES WITH SMALL NUMBER OF STEINER VERTICES
2021 |
Faculty of Mathematics and Physics
publication
Parameterized complexity of fair deletion problems
2020 |
Faculty of Mathematics and Physics
publication
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
2020 |
Faculty of Mathematics and Physics
publication
Parameterized Inapproximability of Independent Set in H-Free Graphs
2023 |
Faculty of Mathematics and Physics