The following pages link to (Q3077955):
Displaying 8 items.
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Reachability analysis of reversal-bounded automata on series-parallel graphs (Q1741900) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
