Logic, graphs, and algorithms
From MaRDI portal
Recommendations
Cited in
(40)- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
- Algorithmic meta-theorems for restrictions of treewidth
- An approval-based model for single-step liquid democracy
- A SAT approach to branchwidth
- Algorithmic meta theorems for circuit classes of constant and logarithmic depth
- Large Induced Subgraphs via Triangulations and CMSO
- Methods for algorithmic meta theorems
- Algorithmic meta-theorems
- Kernelization of cycle packing with relaxed disjointness constraints
- Courcelle's theorem for triangulations
- Efficient First-Order Model-Checking Using Short Labels
- Algorithmic meta-theorems for restrictions of treewidth
- Preprocessing subgraph and minor problems: when does a small vertex cover help?
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Courcelle's theorem -- a game-theoretic approach
- Confronting intractability via parameters
- 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
- Gaifman normal forms for counting extensions of first-order logic
- A Retrospective on (Meta) Kernelization
- Data-compression for parametrized counting problems on sparse graphs
- A Practical Approach to Courcelle's Theorem
- Monadic second-order model-checking on decomposable matroids
- First-Order Model-Checking in Random Graphs and Complex Networks
- An algorithmic meta-theorem for graph modification to planarity and FOL
- First-order Logic with Connectivity Operators
- Feferman-vaught decompositions for prefix classes of first order logic
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- Compact labelings for efficient first-order model-checking
- Learning concepts described by weight aggregation logic
- Distributed model checking on graphs of bounded treedepth
- FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set
- Model checking disjoint-paths logic on topological-minor-free graph classes
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Compound logics for modification problems
- Advances in algorithmic meta theorems (invited paper)
- Learning aggregate queries defined by first-order logic with counting
- Compactors for parameterized counting problems
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
This page was built for publication: Logic, graphs, and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3086928)
