Results 281 to 290 of about 1,864,097 (296)
Some of the next articles are maybe not open access.
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Information and Computation, 2011Saket Saurabh +2 more
exaly
Parameterized Complexity in the Polynomial Hierarchy
Lecture Notes in Computer Science, 2019Ronald de Haan
exaly
Machine-Based Methods in Parameterized Complexity Theory
Theoretical Computer Science, 2005Yijia Chen, Martin Grohe, Jörg Flum
exaly
Parameterized Complexity of Coloring Problems: Treewidth Versus Vertex Cover
Theoretical Computer Science, 2011Petr Golovach +2 more
exaly
On the Parameterized Complexity of Cutting a Few Vertices From a Graph
Lecture Notes in Computer Science, 2013Petr Golovach, Fedor Fomin
exaly
The Parameterized Complexity of Probability Amplification
Information Processing Letters, 2008Andrés Montoya
exaly
The Complexity of Irredundant Sets Parameterized by Size
Discrete Applied Mathematics, 2000Venkatesh Raman +2 more
exaly
An Isomorphism Between Subexponential and Parameterized Complexity Theory
SIAM Journal on Computing, 2007Yijia Chen, Martin Grohe
exaly
What’s Next? Future Directions in Parameterized Complexity
Lecture Notes in Computer Science, 2012Dániel Marx
exaly

