| 2007 |
|---|
| 13 | EE | Dietmar Berwanger:
Admissibility in Infinite Games.
STACS 2007: 188-199 |
| 12 | EE | Dietmar Berwanger,
Erich Grädel,
Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict.
Theory Comput. Syst. 40(4): 437-466 (2007) |
| 2006 |
|---|
| 11 | EE | Dietmar Berwanger,
David Janin:
Automata on Directed Graphs: Edge Versus Vertex Marking.
ICGT 2006: 46-60 |
| 10 | EE | Dietmar Berwanger,
Anuj Dawar,
Paul Hunter,
Stephan Kreutzer:
DAG-Width and Parity Games.
STACS 2006: 524-536 |
| 2005 |
|---|
| 9 | EE | Dietmar Berwanger,
Giacomo Lenzi:
The Variable Hierarchy of the µ-Calculus Is Strict.
STACS 2005: 97-109 |
| 2004 |
|---|
| 8 | EE | Dietmar Berwanger,
Erich Grädel:
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.
LPAR 2004: 209-223 |
| 7 | EE | Dietmar Berwanger,
Erich Grädel:
Fixed-Point Logics and Solitaire Games.
Theory Comput. Syst. 37(6): 675-694 (2004) |
| 2003 |
|---|
| 6 | EE | Dietmar Berwanger,
Erich Grädel,
Stephan Kreutzer:
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games.
LPAR 2003: 229-243 |
| 5 | EE | Dietmar Berwanger:
Game Logic is Strong Enough for Parity Games.
Studia Logica 75(2): 205-219 (2003) |
| 2002 |
|---|
| 4 | EE | Dietmar Berwanger,
Erich Grädel,
Giacomo Lenzi:
On the Variable Hierarchy of the Modal µ-Calculus.
CSL 2002: 352-366 |
| 2001 |
|---|
| 3 | EE | Dietmar Berwanger,
Achim Blumensath:
The Monadic Theory of Tree-like Structures.
Automata, Logics, and Infinite Games 2001: 285-302 |
| 2 | EE | Dietmar Berwanger,
Achim Blumensath:
Automata for Guarded Fixed Point Logics.
Automata, Logics, and Infinite Games 2001: 343-355 |
| 1 | EE | Dietmar Berwanger,
Erich Grädel:
Games and Model Checking for Guarded Logics.
LPAR 2001: 70-84 |
