| Digraph measures: Kelly decompositions, games, and orderings P Hunter, S Kreutzer Theoretical Computer Science 399 (3), 206-219, 2008 | 183 | 2008 |
| 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 | 169 | 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 |
| Complexity bounds for regular games P Hunter, A Dawar International Symposium on Mathematical Foundations of Computer Science, 495-506, 2005 | 56 | 2005 |
| Non-zero sum games for reactive synthesis R Brenguier, L Clemente, P Hunter, GA Pérez, M Randour, JF Raskin, ... Language and Automata Theory and Applications, 3-23, 2016 | 52 | 2016 |
| Expressive completeness for metric temporal logic P Hunter, J Ouaknine, J Worrell 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 349-357, 2013 | 42 | 2013 |
| LIFO-search: A min–max theorem and a searching game for cycle-rank and tree-depth AC Giannopoulou, P Hunter, DM Thilikos Discrete Applied Mathematics 160 (15), 2089-2097, 2012 | 36 | 2012 |
| Complexity and infinite games on finite graphs PW Hunter University of Cambridge, Computer Laboratory, 2007 | 32 | 2007 |
| When is Metric Temporal Logic Expressively Complete? P Hunter, J Ouaknine, J Worrell arXiv preprint arXiv:1209.0516, 2012 | 23 | 2012 |
| Reachability in succinct one-counter games P Hunter International Workshop on Reachability Problems, 37-49, 2015 | 21 | 2015 |
| Reactive synthesis without regret P Hunter, GA Pérez, JF Raskin Acta informatica 54 (1), 3-39, 2017 | 16 | 2017 |
| Losing the+ 1 or directed path-width games are monotone P Hunter Unpublished manuscript, Available from the authors webpage, 2006 | 12 | 2006 |
| Quantitative games with interval objectives P Hunter, JF Raskin 34th International Conference on Foundations of Software Technology and …, 2014 | 11 | 2014 |
| Mean-payoff games with partial-observation P Hunter, GA Pérez, JF Raskin Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014 | 11 | 2014 |
| D-width and cops and robbers W Evans, P Hunter, MA Safari Research report, 2013. unpublished, 2007 | 10 | 2007 |
| Minimizing regret in discounted-sum games P Hunter, GA Pérez, JF Raskin arXiv preprint arXiv:1511.00523, 2015 | 9 | 2015 |
| Mean-payoff games with partial observation P Hunter, A Pauly, GA Pérez, JF Raskin Theoretical Computer Science 735, 82-110, 2018 | 7 | 2018 |
| Computing Rational Radical Sums in Uniform TC^ 0 P Hunter, P Bouyer, N Markey, J Ouaknine, J Worrell IARCS Annual Conference on Foundations of Software Technology and …, 2010 | 7 | 2010 |
| Complexity bounds for muller games P Hunter, A Dawar Theoretical Computer Science (TCS), 2008 | 6 | 2008 |
| Looking at mean payoff through foggy windows P Hunter, GA Pérez, JF Raskin Acta Informatica 55, 627-647, 2018 | 5 | 2018 |
