„Parameterized Complexity“
Suchergebnisse
665 Treffer
-
Parameterized Complexity of Critical Node Cuts
-
The Graph Motif Problem Parameterized by the Structure of the Input Graph
-
Parameterized Complexity of Graph Constraint Logic
-
Fixed-parameter Tractable Distances to Sparse Graph Classes
-
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
-
Parameter Compilation
-
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
-
Parameterized Complexity of Fixed Variable Logics
-
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)
-
Explicit Linear Kernels via Dynamic Programming
-
Exploring Subexponential Parameterized Complexity of Completion Problems
-
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk)
-
The Fixed-Parameter Tractability of Model Checking Concurrent Systems
-
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
-
On Polynomial Kernels for Sparse Integer Linear Programs
-
Model Counting for CNF Formulas of Bounded Modular Treewidth
-
Searching for better fill-in
-
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks
-
Lower Bounds on the Complexity of MSO_1 Model-Checking
-
Parameterized Regular Expressions and Their Languages