Methods for algorithmic meta theorems
From MaRDI portal
Recommendations
Cited in
(39)- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
- Metamath Zero: designing a theorem prover prover
- Metalevel algorithms for variant satisfiability
- Parameterized extension complexity of independent set and related problems
- Solution lifting method for handling meta-variables in TH\(\exists\)OREM\(\forall\)
- Quantified conjunctive queries on partially ordered sets
- Real Algebraic Strategies for MetiTarski Proofs
- A basic parameterized complexity primer
- Quantified conjunctive queries on partially ordered sets
- Logic, graphs, and algorithms
- Algorithmic meta-theorems
- scientific article; zbMATH DE number 4155932 (Why is no real title available?)
- Algorithmic Meta-theorems
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- The parameterized space complexity of model-checking bounded variable first-order logic
- Algorithmic meta theorems for sparse graph classes
- First-order interpretations of bounded expansion classes
- Recovering sparse graphs
- A Retrospective on (Meta) Kernelization
- Data-compression for parametrized counting problems on sparse graphs
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- First-order queries on classes of structures with bounded expansion
- On low rank-width colorings
- Computations by fly-automata beyond monadic second-order logic
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus
- Extended MSO model checking via small vertex integrity
- Twin-treewidth: a single-exponential logic-based approach
- Distributed model checking on graphs of bounded treedepth
- Maintaining \(\mathrm{CMSO}_2\) properties on dynamic structures with bounded feedback vertex number
- Computing treedepth in polynomial space and linear FPT time
- Rank-decreasing transductions
- Elementary first-order model checking for sparse graphs
- Brief announcement: Distributed model checking on graphs of bounded treedepth
- Compound logics for modification problems
- Fine-grained meta-theorems for vertex integrity
- Advances in algorithmic meta theorems (invited paper)
- Tree decompositions meet induced matchings: beyond max weight independent set
- Compactors for parameterized counting problems
This page was built for publication: Methods for algorithmic meta theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3118384)
