„Parameterized Complexity“
Suchergebnisse
665 Treffer
-
Connecting the Dots (with Minimum Crossings)
-
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms
-
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
-
Parameterized Algorithms for List K-Cycle
-
Parameterized Algorithms and Kernels for Rainbow Matching
-
Multi-Clique-Width
-
Hardness of Traversing Gadget Systems with Small Bandwidth
-
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover
-
An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions
-
Delay-Robust Routes in Temporal Graphs
-
Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
-
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters
-
On Girth and the Parameterized Complexity of Token Sliding and Token Jumping
-
Parameterized Dynamic Data Structure for Split Completion
-
A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items
-
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
-
On the Complexity of Problems on Tree-Structured Graphs
-
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
-
Meta-kernelization using Well-structured Modulators
-
Connecting Vertices by Independent Trees