„Parameterized Algorithms“
Suchergebnisse
475 Treffer
-
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing
-
The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
-
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291)
-
Cluster Editing on Cographs and Related Classes
-
MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
-
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
-
The Computational Complexity of Factored Graphs
-
09511 Open Problems – Parameterized complexity and approximation algorithms
-
09511 Executive Summary – Parameterized complexity and approximation algorithms
-
09511 Abstracts Collection – Parameterized complexity and approximation algorithms
-
Parameterized Analysis of Online Steiner Tree Problems
-
09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms
-
09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms
-
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth
-
Sidestepping Barriers for Dominating Set in Parameterized Complexity
-
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks
-
Single Machine Scheduling with Few Deadlines
-
Finding Degree-Constrained Acyclic Orientations
-
An Improved Kernelization Algorithm for Trivially Perfect Editing
-
An FPT Algorithm for Temporal Graph Untangling