First-order Logic with Connectivity Operators
From MaRDI portal
Publication:6082227
DOI10.1145/3595922arXiv2107.05928OpenAlexW3178650038MaRDI QIDQ6082227
Sebastian Siebertz, Alexandre Vigny, Unnamed Author
Publication date: 3 November 2023
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.05928
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph isomorphism parameterized by elimination distance to bounded degree
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Regular graphs of large girth and arbitrary degree
- Finding odd cycle transversals.
- Finite model theory and its applications.
- Elements of finite model theory.
- Graph minors. XX: Wagner's conjecture
- Graph minors. V. Excluding a planar graph
- Graph minors. XIII: The disjoint paths problem
- Linear time solvable optimization problems on graphs of bounded clique-width
- Algebra for trees
- Fixed-parameter tractable distances to sparse graph classes
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Weak Second‐Order Arithmetic and Finite Automata
- Minimum Bisection Is Fixed-Parameter Tractable
- First-order logic with reachability for infinite-state systems
- Deciding First-Order Properties of Nowhere Dense Graphs
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
- Parameterized Complexity of Elimination Distance to First-Order Logic Properties
- Elimination Distance to Bounded Degree on Planar Graphs
- Hitting topological minors is FPT
- Directed Nowhere Dense Classes of Graphs
- Parameterized Algorithms
- Elimination distances, blocking sets, and kernels for Vertex Cover
- Vertex deletion parameterized by elimination distance and even less
