„parameterized Complexity“
Suchergebnisse
665 Treffer
-
Minimum Consistent Subset in Trees and Interval Graphs
-
On the Parameterized Complexity of Diverse SAT
-
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
-
When Can Cluster Deletion with Bounded Weights Be Solved Efficiently?
-
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
-
Knapsack with Vertex Cover, Set Cover, and Hitting Set
-
Mimicking Networks for Constrained Multicuts in Hypergraphs
-
The Parameterized Complexity Of Extending Stack Layouts
-
Parameterized Quantum Query Algorithms for Graph Problems
-
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
-
Parameterized Complexity of MinCSP over the Point Algebra
-
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs
-
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds
-
Worst-Case to Expander-Case Reductions: Derandomized and Generalized
-
CSPs with Few Alien Constraints
-
RNA Inverse Folding Can Be Solved in Linear Time for Structures Without Isolated Stacks or Base Pairs
-
On the Complexity of the Median and Closest Permutation Problems
-
On the Complexity of Community-Aware Network Sparsification
-
Parameterized Vertex Integrity Revisited
-
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs