Dietmar Berwanger
Researcher, CNRS
Research Interests
Logical and algorithmic foundations of interaction:
- theory of infinite games
- fixed-point logics, μ-calculus
- verification and synthesis of interactive systems
- graph structure theory and complexity
Recent Papers
- D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer, and J. Obdzralek,
The DAG-Width of Directed Graphs. Accepted for publication in Journal of Combinatorial Theory, Series B, Elsevier
- D. Berwanger and Ł. Kaiser, Information Tracking in Games on Graphs. In
Journal of Logic, Language and Information 19(3):395-412,
Springer-Verlag, 2010, Online First.
- D. Berwanger, K. Chatterjee, L. Doyen, Th. A. Henzinger, and M. De Wulf, Strategy Construction for Parity Games with Imperfect Information, in Information and Computation 208(10):1206-1220, Elsevier 2010
- D. Berwanger, Infinite Coordination Games. In
Logic and the Foundations of Game and Decision Theory (LOFT8), LNAI 6006, 1-19, Springer 2010
More
publications
Events
-
GAMES 2011 - Games for Design and Verification, 10th Annual Meeting
31 August -- 3 September, Paris (organisor)
-
STACS 2011 - Symposium on Theoretical Aspects of Computer Science
10 -- 12 March, 2011, Dortmund, Germany (PC member)
-
ICLA 2011 - Indian Conference on Logic and its Applications
5 -- 11 January, 2011, Delhi, India (PC member)
-
GAMES 2010 - Games for Design and Verification, Annual Meeting
20 -- 23 September 2010, Oxford, UK (PC member)
-
LINT 2010 -- Logic for Interaction, Annual Meeting
24 -- 25 July 2010, Paris, France (organisor)
-
STAR 2009 - Workshop on Structural Aspects of Rationality
13 -- 14 December, 2009, IIT Kanpur, India (organisor)
Pre-conference workshop to FSTTCS
Teaching
Projects
- GAMES - Games for Design and Verification
- LINT - Logic for Interaction
