DAG-width and parity games D Berwanger, A Dawar, P Hunter, S Kreutzer STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006 | 168 | 2006 |
The dag-width of directed graphs D Berwanger, A Dawar, P Hunter, S Kreutzer, J Obdržálek Journal of Combinatorial Theory, Series B 102 (4), 900-923, 2012 | 115 | 2012 |
Entanglement–a measure for the complexity of directed graphs with applications to logic and games D Berwanger, E Grädel Logic for Programming, Artificial Intelligence, and Reasoning: 11th …, 2005 | 91 | 2005 |
Admissibility in infinite games D Berwanger Annual Symposium on Theoretical Aspects of Computer Science, 188-199, 2007 | 69 | 2007 |
On the power of imperfect information D Berwanger, L Doyen IARCS Annual Conference on Foundations of Software Technology and …, 2008 | 62 | 2008 |
The variable hierarchy of the μ-calculus is strict D Berwanger, E Gradel, G Lenzi Theory of Computing Systems 40, 437-466, 2007 | 53 | 2007 |
Games and model checking for guarded logics D Berwanger, E Grädel Logic for Programming, Artificial Intelligence, and Reasoning: 8th …, 2001 | 46 | 2001 |
Game logic is strong enough for parity games D Berwanger Studia logica 75, 205-219, 2003 | 44 | 2003 |
Entanglement and the complexity of directed graphs D Berwanger, E Grädel, Ł Kaiser, R Rabinovich Theoretical Computer Science 463, 2-25, 2012 | 41 | 2012 |
Information tracking in games on graphs D Berwanger, Ł Kaiser Journal of Logic, Language and Information 19, 395-412, 2010 | 36 | 2010 |
Alpaga: A tool for solving parity games with imperfect information D Berwanger, K Chatterjee, M De Wulf, L Doyen, TA Henzinger Tools and Algorithms for the Construction and Analysis of Systems: 15th …, 2009 | 30 | 2009 |
A perfect-information construction for coordination in games D Berwanger, L Kaiser, B Puchala IARCS Annual Conference on Foundations of Software Technology and …, 2011 | 29 | 2011 |
Strategy construction for parity games with imperfect information D Berwanger, K Chatterjee, M De Wulf, L Doyen, TA Henzinger Information and computation 208 (10), 1206-1220, 2010 | 27 | 2010 |
Fixed-point logics and solitaire games D Berwanger, E Grädel Theory of Computing Systems 37 (6), 675-694, 2004 | 26 | 2004 |
Strategy construction for parity games with imperfect information D Berwanger, K Chatterjee, L Doyen, TA Henzinger, S Raje International Conference on Concurrency Theory, 325-339, 2008 | 24 | 2008 |
The monadic theory of tree-like structures D Berwanger, A Blumensath Automata Logics, and Infinite Games: A Guide to Current Research, 285-301, 2002 | 24 | 2002 |
On the variable hierarchy of the modal μ-calculus D Berwanger, E Grädel, G Lenzi Computer Science Logic: 16th International Workshop, CSL 2002 11th Annual …, 2002 | 24 | 2002 |
Once upon a Time in the West. Determinacy, Complexity and Definability of Path Games D Berwanger, E Grädel, S Kreutzer Logic for Programming, Artificial Intelligence, and Reasoning 2850, 229-243, 2003 | 18* | 2003 |
Hierarchical information patterns and distributed strategy synthesis D Berwanger, AB Mathew, M Van den Bogaard International Symposium on Automated Technology for Verification and …, 2015 | 17 | 2015 |
Graph games with perfect information D Berwanger preprint, 2013 | 17 | 2013 |