Université Libre de Bruxelles

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth, A. Giannopoulou, P. Hunter and D. Thilikos, Discrete Applied Mathematics 160(15), pages 2089-2097, 2012
DAG-Width and Parity Games, D. Berwanger, A. Dawar, P. Hunter, S. Kreutzer and J. Obdrzalek, Journal of Combinatorial Theory, Series B 102(4), pages 900-923, 2012
Complexity Bounds for Muller Games, A. Dawar, F. Horn and P. Hunter, Submitted for publication in Theoretical Computer Science, 2010
Digraph Measures: Kelly Decompositions, Games, and Orderings, P. Hunter and S. Kreutzer, Theoretical Computer Science, Volume 399, pages 206-219, 2008

Quantitative games with interval objectives P. Hunter and J.-F. Raskin. Submitted to CONCUR 2014
Mean-payoff games with partial-observation P. Hunter, G. A. Pérez and J.-F. Raskin. Submitted to CONCUR 2014
When is Metric Temporal Logic Expressively Complete? P. Hunter, CSL 2013
Expressive Completeness of Metric Temporal Logic, P. Hunter, J. Ouaknine and J. Worrell, LICS 2013
LIFO-search on digraphs: A searching game for cycle-rank, P. Hunter, FCT 2011
Computing Rational Radical Sums in Uniform TC⁰, P. Hunter, P. Bouyer, N. Markey, J. Ouaknine and J. Worrell, FSTTCS 2010
Digraph Measures: Kelly Decompositions, Games, and Orderings, P. Hunter and S. Kreutzer, SODA 2007
DAG-Width and Parity Games, D. Berwanger, A. Dawar, P. Hunter and S. Kreutzer, STACS 2006
Complexity Bounds for Regular Games (Extended abstract), P. Hunter and A. Dawar, MFCS 2005

Unstable internet routing as oriented hypercubes, P. Hunter, 2008. An informal note on a combinatorial perspective of abstracted internet routing policies
Losing the +1: Directed path-width games are monotone, P. Hunter, 2006. A result to complete the proof of Barát on the monotonicity of directed path-width games

Paul Hunter