Results 181 to 190 of about 23,779 (205)
Some of the next articles are maybe not open access.
Parameterized Complexity and Logic
2007We introduce and discuss some basic concepts of parameterized complexity theory via model-checking problems.
openaire +1 more source
A Parameterized Complexity Tutorial
2012The article was prepared for the LATA 2012 conference where I will be presenting two one and half hour lectures for a short tutorial on parameterized complexity. Much fuller accounts can be found in the books Downey-Fellows [33, 34], Niedermeier [72], Flum-Grohe [49], the two issues of the Computer Journal [36] and the recent survey Downey-Thilikos [39]
openaire +1 more source
Descriptive and Parameterized Complexity
1999Descriptive Complexity Theory studies the complexity of problems of the following type: Given a finite structure A and a sentence Τ of some logic L, decide if A satisfies Τ? In this survey we discuss the parameterized complexity of such problems. Basically, this means that we ask under which circumstances we have an algorithm solving the problem ...
openaire +2 more sources
Parameterized power domination complexity
Information Processing Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Kneis +3 more
openaire +2 more sources
Fundamentals of Parameterized Complexity
2013Rodney G. Downey, Michael R. Fellows
openaire +1 more source
Integer programming in parameterized complexity: Five miniatures
Discrete Optimization, 2022Tomáš Gavenčiak +2 more
exaly
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing, 2004Jörg Flum, Martin Grohé
exaly
On the complexity of some colorful problems parameterized by treewidth
Information and Computation, 2011Michael R Fellows +2 more
exaly
The parameterized complexity of probability amplification
Information Processing Letters, 2008J Andres Montoya
exaly
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science, 2011Jir̂Í Fiala +2 more
exaly