„parameterized complexity“
Suchergebnisse
665 Treffer
-
Graph Search Trees and the Intermezzo Problem
-
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints
-
State Canonization and Early Pruning in Width-Based Automated Theorem Proving
-
Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems Under ETH
-
Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number
-
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
-
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness
-
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations
-
A Tight Monte-Carlo Algorithm for Steiner Tree Parameterized by Clique-Width
-
Exponential Lower Bounds via Exponential Sums
-
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces
-
Finding Diverse Strings and Longest Common Subsequences in a Graph
-
Parameterized Complexity of Submodular Minimization Under Uncertainty
-
Stability in Graphs with Matroid Constraints
-
Correlation Clustering with Vertex Splitting
-
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
-
On the Parameterized Complexity of Motion Planning for Rectangular Robots
-
Constrained and Ordered Level Planarity Parameterized by the Number of Levels
-
Partial Temporal Vertex Cover with Bounded Activity Intervals
-
On the Complexity of Temporal Arborescence Reconfiguration