Algorithmic meta-theorems
From MaRDI portal
Publication:3172385
zbMATH Open1262.03058MaRDI QIDQ3172385FDOQ3172385
Authors: Stephan Kreutzer 
Publication date: 5 October 2011
Recommendations
Analysis of algorithms and problem complexity (68Q25) Model theory of finite structures (03C13) Automata and formal grammars in connection with logical questions (03D05) Graph minors (05C83) Decidability of theories and sets of sentences (03B25) General topics in the theory of algorithms (68W01)
Cited In (23)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Algorithmic Meta-theorems
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
- Title not available (Why is that?)
- On ultralimits of sparse graph classes
- On the weak 2-coloring number of planar graphs
- Logic, graphs, and algorithms
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Extended MSO model checking via small vertex integrity
- Coloring and Covering Nowhere Dense Graphs
- On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
- Colouring and Covering Nowhere Dense Graphs
- Computations by fly-automata beyond monadic second-order logic
- The Complexity of Decomposing Modal and First-Order Theories
- Model checking on interpretations of classes of bounded local cliquewidth
- On the Parameterised Intractability of Monadic Second-Order Logic
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
- Large Induced Subgraphs via Triangulations and CMSO
- Algorithmic Pirogov-Sinai theory
- Methods for algorithmic meta theorems
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Title not available (Why is that?)
This page was built for publication: Algorithmic meta-theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172385)
