On the fixed-parameter tractability of parameterized model-checking problems

Authors:
Iain A. Stewart
Affiliations:
Department of Computer Science, University of Durham, Science Labs, South Road, Durham DH1 3LE, UK
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 3

Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Fixed-Parameter Tractability, Definability, and Model-Checking

SIAM Journal on Computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Locally Excluding a Minor

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Parameterized Complexity

Parameterized Complexity

The parameterized complexity of regular subgraph problems and generalizations

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Parameterized Graph Editing with Chosen Vertex Degrees

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Editing graphs to satisfy degree constraints: A parameterized approach

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied.