The Monadic Theory of Tree-like Structures. - Dietmar Berwanger; Achim Blumensath (Automata, Logics, and Infinite Games, 2001)

Automata for Guarded Fixed Point Logics. - Dietmar Berwanger; Achim Blumensath (Automata, Logics, and Infinite Games, 2001)

Games and Model Checking for Guarded Logics. - Dietmar Berwanger; Erich Grädel (LPAR, 2001)

On the Variable Hierarchy of the Modal µ-Calculus. - Dietmar Berwanger; Erich Grädel; Giacomo Lenzi (CSL, 2002)

Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. - Dietmar Berwanger; Erich Grädel; Stephan Kreutzer (LPAR, 2003)

Game Logic is Strong Enough for Parity Games. - Dietmar Berwanger (Stud Logica, 2003)

Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. - Dietmar Berwanger; Erich Grädel (LPAR, 2004)

Fixed-Point Logics and Solitaire Games. - Dietmar Berwanger; Erich Grädel (Theory Comput. Syst., 2004)

The Variable Hierarchy of the µ-Calculus Is Strict. - Dietmar Berwanger; Giacomo Lenzi (STACS, 2005)

Automata on Directed Graphs: Edge Versus Vertex Marking. - Dietmar Berwanger; David Janin (ICGT, 2006)

DAG-Width and Parity Games. - Dietmar Berwanger; Anuj Dawar; Paul Hunter 001; Stephan Kreutzer (STACS, 2006)

Admissibility in Infinite Games. - Dietmar Berwanger (STACS, 2007)

The Variable Hierarchy of the µ-Calculus Is Strict. - Dietmar Berwanger; Erich Grädel; Giacomo Lenzi (Theory Comput. Syst., 2007)

Strategy Construction for Parity Games with Imperfect Information. - Dietmar Berwanger; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Sangram Raje (CONCUR, 2008)

On the Power of Imperfect Information. - Dietmar Berwanger; Laurent Doyen 001 (FSTTCS, 2008)

Infinite Coordination Games. - Dietmar Berwanger (LOFT, 2008)

Game Quantification Patterns. - Dietmar Berwanger; Sophie Pinchinat (ICLA, 2009)

Alpaga: A Tool for Solving Parity Games with Imperfect Information. - Dietmar Berwanger; Krishnendu Chatterjee; Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger (TACAS, 2009)

Strategy construction for parity games with imperfect information. - Dietmar Berwanger; Krishnendu Chatterjee; Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger (Inf. Comput., 2010)

Information Tracking in Games on Graphs. - Dietmar Berwanger; Lukasz Kaiser (J. Log. Lang. Inf., 2010)

A Perfect-Information Construction for Coordination in Games. - Dietmar Berwanger; Lukasz Kaiser; Bernd Puchala (FSTTCS, 2011)

Solving Counter Parity Games. - Dietmar Berwanger; Lukasz Kaiser; Simon Leßenich (MFCS, 2012)

Parity games on undirected graphs. - Dietmar Berwanger; Olivier Serre (Inf. Process. Lett., 2012)

The dag-width of directed graphs. - Dietmar Berwanger; Anuj Dawar; Paul Hunter 001; Stephan Kreutzer; Jan Obdrzálek (J. Comb. Theory B, 2012)

Entanglement and the complexity of directed graphs. - Dietmar Berwanger; Erich Grädel; Lukasz Kaiser; Roman Rabinovich 001 (Theor. Comput. Sci., 2012)

Introduction. - Dietmar Berwanger; Olivier Serre (Tech. Sci. Informatiques, 2013)

Games with recurring certainty. - Dietmar Berwanger; Anup Basil Mathew (SR, 2014)

Hierarchical Information Patterns and Distributed Strategy Synthesis. - Dietmar Berwanger; Anup Basil Mathew; Marie van den Bogaard (ATVA, 2015)

Consensus Game Acceptors. - Dietmar Berwanger; Marie van den Bogaard (DLT, 2015)

Games with Delays - A Frankenstein Approach. - Dietmar Berwanger; Marie van den Bogaard (FSTTCS, 2015)

A Characterisation of Context-Sensitive Languages by Consensus Games. - Dietmar Berwanger; Marie van den Bogaard (CoRR, 2015)

A Retraction Theorem for Distributed Synthesis. - Dietmar Berwanger; Anup Basil Mathew; R. Ramanujam 001 (CoRR, 2016)

Deviator Detection under Imperfect Monitoring. - Dietmar Berwanger; R. Ramanujam 001 (CoRR, 2017)

Infinite games with finite knowledge gaps. - Dietmar Berwanger; Anup Basil Mathew (Inf. Comput., 2017)

Hierarchical information and the synthesis of distributed strategies. - Dietmar Berwanger; Anup Basil Mathew; Marie van den Bogaard (Acta Informatica, 2018)

Consensus Game Acceptors and Iterated Transductions. - Dietmar Berwanger; Marie van den Bogaard (Int. J. Found. Comput. Sci., 2018)

Synthesising Full-Information Protocols. - Dietmar Berwanger; Laurent Doyen 001; Thomas Soullard (CoRR, 2023)

Observation and Distinction: Representing Information in Infinite Games. - Dietmar Berwanger; Laurent Doyen 001 (Theory Comput. Syst., 2023)