The following pages link to Stephan Kreutzer (Q266261):
Displayed 50 items.
- Complexity and monotonicity results for domination games (Q266262) (← links)
- DAG-width is PSPACE-complete (Q343929) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- The dag-width of directed graphs (Q444380) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- Backtracking games and inflationary fixed points (Q817842) (← links)
- Directed elimination games (Q896668) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
- Expressive equivalence of least and inflationary fixed-point logic (Q1886320) (← links)
- Routing with congestion in acyclic digraphs (Q2274522) (← links)
- Generalising automaticity to modal properties of finite structures (Q2373714) (← links)
- Majority colourings of digraphs (Q2628255) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- On the Parameterized Intractability of Monadic Second-Order Logic (Q2881095) (← links)
- (Q2920123) (← links)
- (Q2934648) (← links)
- The Directed Grid Theorem (Q2941561) (← links)
- (Q2954982) (← links)
- (Q2963895) (← links)
- First-Order and Monadic Second-Order Model-Checking on Ordered Structures (Q2986804) (← links)
- Operational Semantics for Fixed-Point Logics on Constraint Databases (Q2996184) (← links)
- (Q3086929) (← links)
- (Q3118384) (← links)
- Digraphs of Bounded Width (Q3120441) (← links)
- (Q3172385) (← links)
- (Q3172533) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- (Q3408141) (← links)
- Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
- Algorithmic Meta-theorems (Q3503574) (← links)
- (Q3509072) (← links)
- On Datalog vs. LFP (Q3519499) (← links)
- (Q3579375) (← links)
- On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759) (← links)
- (Q4411833) (← links)
- (Q4473275) (← links)
- Coloring and Covering Nowhere Dense Graphs (Q4553722) (← links)
- Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes (Q4575843) (← links)
- (Q4608564) (← links)
- The Generalised Colouring Numbers on Classes of Bounded Expansion (Q4608648) (← links)
- Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes (Q4629992) (← links)
- Decomposition theorems and model-checking for the modal <i>μ</i> -calculus (Q4635600) (← links)
- On Hanf-equivalence and the number of embeddings of small induced subgraphs (Q4635645) (← links)
- (Q4636649) (← links)
- Deciding First-Order Properties of Nowhere Dense Graphs (Q4640289) (← links)
- An Extension of Muchnik's Theorem (Q4673357) (← links)
- (Q4783314) (← links)
- Extended Computation Tree Logic (Q4933296) (← links)