„Fixed-parameter Tractability“
Suchergebnisse
193 Treffer
-
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
-
A Unified FPT Framework for Crossing Number Problems
-
Courcelle’s Theorem for Lipschitz Continuity
-
Consistency Checking Problems: A Gateway to Parameterized Sample Complexity
-
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)
-
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
-
Backdoors to q-Horn
-
Fixed-Parameter Sensitivity Oracles
-
On the Treewidth of Triangulated 3-Manifolds
-
Combining Treewidth and Backdoors for CSP
-
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average
-
Parameterized Dynamic Cluster Editing
-
Fixed-Parameter Tractability of (n − k) List Coloring
-
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs
-
Parameterized Complexity Dichotomy for Steiner Multicut
-
Going Far From Degeneracy
-
On the Descriptive Complexity of Color Coding
-
A Parameterized Complexity View on Collapsing k-Cores
-
The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems
-
Small Resolution Proofs for QBF using Dependency Treewidth