In the study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic ofâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

We propose reductions to quantified Boolean formulas (QBF) as a new approach to showing fixed-parameter linear algorithms forâ€¦Â (More)

Is this relevant?

2017

2017

- Benjamin A. Burton, Rodney G. Downey
- J. Comb. Theory, Ser. A
- 2017

In graph theory, Courcelleâ€™s theorem essentially states that, if an algorithmic problem can be formulated in monadic second-orderâ€¦Â (More)

Is this relevant?

2017

2017

- Patricia Bouyer, Vincent JugÃ©, Nicolas Markey
- ArXiv
- 2017

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamicâ€¦Â (More)

Is this relevant?

2015

2015

- Martin LÃ¼ck, Arne Meier, Irena Schindler
- LATA
- 2015

We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiabilityâ€¦Â (More)

Is this relevant?

2014

2014

- Martin LÃ¼ck, Arne Meier, Irena Schindler
- Electronic Colloquium on Computational Complexity
- 2014

We present a complete classification of the parameterized complexity of all operator fragments of the satisfiability problem inâ€¦Â (More)

Is this relevant?

2013

2013

- Bernhard Bliem, Reinhard Pichler, Stefan Woltran
- IPEC
- 2013

Many computationally hard problems become tractable if the graph structure underlying the problem instance exhibits smallâ€¦Â (More)

Is this relevant?

Review

2011

Review

2011

- Joachim Kneis, Alexander Langer, Peter Rossmanith
- Discrete Optimization
- 2011

Courcelleâ€™s Theorem states that every problem definable in Monadic SecondOrder logic can be solved in linear time on structuresâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Michael Elberfeld, Andreas Jakoby, Till Tantau
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 2010

Bodlaender's Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree widthâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Michael Lampis
- Algorithmica
- 2010

Possibly the most famous algorithmic meta-theorem is Courcelleâ€™s theorem, which states that all MSO-expressible graph propertiesâ€¦Â (More)

Is this relevant?

2009

2009

- Joachim Kneis, Alexander Langer
- Electr. Notes Theor. Comput. Sci.
- 2009

In 1990, Courcelle showed that every problem definable in Monadic Second-Order Logic (MSO) can be solved in linear time on graphsâ€¦Â (More)

Is this relevant?