scientific article; zbMATH DE number 969067
From MaRDI portal
Publication:5284545
Recommendations
Cited in
(49)- Algorithmic problems and hierarchies of first-order languages
- Characterising bounded expansion by neighbourhood complexity
- FO model checking on geometric graphs
- The complexity of first-order and monadic second-order logic revisited
- Game-based notions of locality over finite models
- Parameterized complexity of the anchored k-core problem for directed graphs
- Quantified conjunctive queries on partially ordered sets
- Quantified conjunctive queries on partially ordered sets
- A logical approach to locality in pictures languages
- Efficient First-Order Model-Checking Using Short Labels
- Computing thejth solution of a first-order query
- An optimal construction of Hanf sentences
- scientific article; zbMATH DE number 1231505 (Why is no real title available?)
- scientific article; zbMATH DE number 1342206 (Why is no real title available?)
- scientific article; zbMATH DE number 2079031 (Why is no real title available?)
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- First-order interpretations of bounded expansion classes
- Gaifman normal forms for counting extensions of first-order logic
- Reducing CMSO model checking to highly connected graphs
- Uniformly Automatic Classes of Finite Structures
- Data-compression for parametrized counting problems on sparse graphs
- Parameterized complexity of fair vertex evaluation problems
- First-order queries on classes of structures with bounded expansion
- FO model checking of geometric graphs
- First-Order Model-Checking in Random Graphs and Complex Networks
- An algorithmic meta-theorem for graph modification to planarity and FOL
- scientific article; zbMATH DE number 7765378 (Why is no real title available?)
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- Computing dense and sparse subgraphs of weakly closed graphs
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- Compact labelings for efficient first-order model-checking
- Dominating set is fixed parameter tractable in claw-free graphs
- Model checking on interpretations of classes of bounded local cliquewidth
- Solving a family of multivariate optimization and decision problems on classes of bounded expansion
- Learning concepts definable in first-order logic with counting
- Model checking disjoint-paths logic on topological-minor-free graph classes
- Complexity framework for forbidden subgraphs. I: The framework
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Compound logics for modification problems
- Twin-width. IV: Ordered graphs and matrices
- \(\mathcal{H}\)-clique-width and a hereditary analogue of product structure
- Twin-width of graphs on surfaces
- Advances in algorithmic meta theorems (invited paper)
- The parameterized complexity of k-edge induced subgraphs
- First order logic on pathwidth revisited again
- Solving partial dominating set and related problems using twin-width
- FO-query enumeration over SLP-compressed structures of bounded degree
- Compactors for parameterized counting problems
- On the fixed-parameter tractability of parameterized model-checking problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284545)
