„parameterized complexity“
Suchergebnisse
665 Treffer
-
Parameterized complexity of decision problems in non-classical logics
-
Exploiting structure in computationally hard voting problems
-
Nowhere dense classes of graphs – characterisations and algorithmic meta-theorems
-
On Equidomination in Graphs
-
On Equidomination in Graphs
-
On the space and circuit complexity of parameterized problems
-
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
-
Correction: On the Parameterized Complexity of Controlling Amendment and Successive Winners
-
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity
-
Parameterized complexity of vertex splitting to pathwidth at most 1
-
Fine-Grained Classification of Detecting Dominating Patterns
-
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
-
Recognizing and Realizing Temporal Reachability Graphs
-
Parameterized Approximability for Modular Linear Equations
-
Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern
-
Fault-Tolerant Matroid Bases
-
Edge Clique Partition and Cover Beyond Independence
-
On the Parameterized Complexity of Controlling Amendment and Successive Winners
-
The Tape Reconfiguration Problem and Its Consequences for Dominating Set Reconfiguration
-
On Algorithmic Applications of ℱ-Branchwidth