„parameterized Complexity“
Suchergebnisse
665 Treffer
-
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large
-
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width
-
An Efficient Algorithm for Power Dominating Set
-
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands
-
A Local-To-Global Theorem for Congested Shortest Paths
-
Faster Detours in Undirected Graphs
-
Automatic Exploration of the Natural Variability of RNA Non-Canonical Geometric Patterns with a Parameterized Sampling Technique
-
Parameterized Complexity of Domination Problems Using Restricted Modular Partitions
-
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric
-
Finding a Highly Connected Steiner Subgraph and its Applications
-
Tight Algorithmic Applications of Clique-Width Generalizations
-
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges
-
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
-
The Parameterized Complexity of Coordinated Motion Planning
-
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
-
An ??(3.82^k) Time FPT Algorithm for Convex Flip Distance
-
Induced Matching Below Guarantees: Average Paves the Way for Fixed-Parameter Tractability
-
Exact Matching: Algorithms and Related Problems
-
Tight Bounds for Connectivity Problems Parameterized by Cutwidth
-
On Computing Homological Hitting Sets