The following pages link to Stephan Kreutzer (Q266261):
Displayed 38 items.
- (Q4945218) (← links)
- Vertex Disjoint Paths in Upward Planar Graphs (Q4981149) (← links)
- (Q5002801) (← links)
- (Q5002812) (← links)
- (Q5090497) (← links)
- Current Trends and New Perspectives for First-Order Model Checking (Invited Talk) (Q5111174) (← links)
- Neighborhood complexity and kernelization for nowhere dense classes of graphs (Q5111394) (← links)
- Model-Checking on Ordered Structures (Q5121264) (← links)
- First-Order Interpretations of Bounded Expansion Classes (Q5121280) (← links)
- (Q5144662) (← links)
- The Directed Flat Wall Theorem (Q5146780) (← links)
- Polynomial Planar Directed Grid Theorem (Q5236273) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- Quantitative Monadic Second-Order Logic (Q5271046) (← links)
- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (Q5271050) (← links)
- Inflationary fixed points in modal logic (Q5277697) (← links)
- Digraph Decompositions and Monotonicity in Digraph Searching (Q5302067) (← links)
- An Excluded Grid Theorem for Digraphs with Forbidden Minors (Q5383965) (← links)
- Computer Science Logic (Q5394588) (← links)
- Linkless and flat embeddings in 3-space and the unknot problem (Q5405867) (← links)
- Directed Nowhere Dense Classes of Graphs (Q5417630) (← links)
- Boundedness of Monadic FO over Acyclic Structures (Q5428840) (← links)
- Model Theory Makes Formulas Large (Q5428869) (← links)
- DAG-Width and Parity Games (Q5449827) (← links)
- Automata, Languages and Programming (Q5466481) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492877) (← links)
- Packing directed cycles through a specified vertex set (Q5741735) (← links)
- (Q5743498) (← links)
- Distance d-Domination Games (Q5851115) (← links)
- (Q5874333) (← links)
- (Q6124954) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
- Directed Width Measures and Monotonicity of Directed Graph Searching (Q6254068) (← links)
- The Erdos-Posa Property for Directed Graphs (Q6271262) (← links)
- A half-integral Erd\H{o}s-P\'osa theorem for directed odd cycles (Q6345733) (← links)
- The canonical directed tree decomposition and its applications to the directed disjoint paths problem (Q6350021) (← links)
- Model Checking on Interpretations of Classes of Bounded Local Cliquewidth (Q6392204) (← links)
- Packing even directed circuits quarter-integrally (Q6461125) (← links)