The following pages link to (Q3172385):
Displaying 15 items.
- On ultralimits of sparse graph classes (Q286118) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- On the weak 2-coloring number of planar graphs (Q2237215) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- (Q5005129) (← links)
- (Q5874521) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- Computations by fly-automata beyond monadic second-order logic (Q5964015) (← links)
- Grouped domination parameterized by vertex cover, twin cover, and beyond (Q6131196) (← links)
- Extended MSO model checking via small vertex integrity (Q6185940) (← links)
