Results 201 to 210 of about 128,668 (237)
Plan Reordering and Parallel Execution — A Parameterized Complexity View
Meysam Aghighi, Christer Bäckström
openalex +2 more sources
On the (parameterized) complexity of recognizing well-covered (r,l)-graphs
Sancrey Rodrigues Alves +5 more
openalex +2 more sources
Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
Lars Jaffke, Bart M. P. Jansen
openalex +2 more sources
NP-Hard problems : moderately exponential approximation and parameterized complexity
Émeric Tourniaire
openalex +1 more source
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Julien Baste +5 more
openalex +2 more sources
On the Parameterized Complexity of $k$-Edge Colouring
Esther Galby +3 more
openalex +2 more sources
Parameterized Complexity of Conflict-free Graph Coloring
Hans L. Bodlaender +2 more
openalex +2 more sources
Parameterized Random Complexity [PDF]
The classes W[P] and W[1] are parameterized analogues of NP in that they can be characterized by machines with restricted existential nondeterminism. These machine characterizations give rise to two natural notions of parameterized randomized algorithms that we call W[P]-randomization and W[1]-randomization. This paper develops the corresponding theory.
Moritz Müller, Juan Andrés Montoya
openaire +1 more source
The parameterized complexity of counting problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Flum, Martin Grohe
openaire +2 more sources
Parameterized complexity for the skeptic [PDF]
The goal is to provide a tourist guide, with an eye towards structural issues, to what I consider some of the major highlights of parameterized complexity.
openaire +1 more source

