„Fixed parameter tractable“
Suchergebnisse
65 Treffer
-
Fine-Grained Equivalence for Problems Related to Integer Linear Programming
-
The Parameterized Complexity of Learning Monadic Second-Order Logic
-
09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms
-
09171 Abstracts Collection – Adaptive, Output Sensitive, Online and Parameterized Algorithms
-
Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions
-
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width
-
Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable
-
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
-
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable
-
Anonymity-Preserving Space Partitions
-
Rectilinear Steiner Trees in Narrow Strips
-
Chordless Cycle Packing Is Fixed-Parameter Tractable
-
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth
-
New Bounds on Augmenting Steps of Block-Structured Integer Programs
-
Euclidean TSP in Narrow Strips
-
Modification to Planarity is Fixed Parameter Tractable
-
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
-
Brief Announcement: Bounded-Degree Cut is Fixed-Parameter Tractable
-
The HOMFLY-PT Polynomial is Fixed-Parameter Tractable
-
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms