Model Checking for Metric Extensions of Monadic Second-Order Logic
cs.LO
Submitted: 2026-10-30
Updated: 2026-10-30
Terminology
Sources
- Detecting Disjoint Shortest Paths in Linear Time and More
- New Complexity and Algorithmic Bounds for Minimum Consistent Subsets
- Using a geometric lens to find k disjoint shortest paths
- Clustering in Varying Metrics
- Parameterized complexity of isometric path partition: treewidth and diameter
- Separation axiom $S_3$ for geodesic convexity in graphs
- Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
- Deciding first-order properties of nowhere dense graphs
- First-Order Query Evaluation with Cardinality Conditions
- Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset
- Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center
- Halfspace separation in geodesic convexity
- Graph classes through the lens of logic
- Algorithms and data structures for first-order logic with connectivity under vertex failures
- Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
- On the Hardness of Strong Metric Dimension
Related papers
- A Non-Dichotomy for CSPs of Stable omega-Categorical Structures
- A Deeper Look at Depth: Stable Generation Accounting for Quantifier Reasoning
- Formalizing Hyperspaces and Operations on Subsets of Polish Spaces over Abstract Exact Real Numbers
- A Diagrammatic Basis for Computer Programming
- Interpolation via Generalized Splitting
- Staying Productive Under the Palm Trees: On Graded Coeffect Typing in the Tropical Semiring