Complexity Bounds for Regular Games. - Paul Hunter 001; Anuj Dawar (MFCS, 2005)

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

Complexity and infinite games on finite graphs. - Paul W. Hunter 001 (2007)

Digraph measures: Kelly decompositions, games, and orderings. - Paul Hunter 001; Stephan Kreutzer (Theor. Comput. Sci., 2008)

Computing Rational Radical Sums in Uniform TC^0. - Paul Hunter 001; Patricia Bouyer; Nicolas Markey; Joël Ouaknine; James Worrell 001 (FSTTCS, 2010)

LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. - Paul Hunter 001 (FCT, 2011)

When is Metric Temporal Logic Expressively Complete? - Paul Hunter 001; Joël Ouaknine; James Worrell 001 (CoRR, 2012)

The expressiveness of MTL with counting - Paul Hunter 001 (CoRR, 2012)

LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth. - Archontia C. Giannopoulou; Paul Hunter 001; Dimitrios M. Thilikos (Discret. Appl. Math., 2012)

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

When is Metric Temporal Logic Expressively Complete?. - Paul Hunter 001 (CSL, 2013)

Expressive Completeness for Metric Temporal Logic. - Paul Hunter 001; Joël Ouaknine; James Worrell 001 (LICS, 2013)

Mean-payoff Games with Incomplete Information. - Paul Hunter 001; Guillermo A. Pérez 001; Jean-François Raskin (CoRR, 2013)

Quantitative Games with Interval Objectives. - Paul Hunter 001; Jean-François Raskin (FSTTCS, 2014)

Mean-Payoff Games with Partial-Observation - (Extended Abstract). - Paul Hunter 001; Guillermo A. Pérez 001; Jean-François Raskin (RP, 2014)

Three Variables are Enough for Real-Time Specification. - Timos Antonopoulos; Paul Hunter 001; Shahab Raza; James Worrell 001 (CoRR, 2014)

Three Variables Suffice for Real-Time Logic. - Timos Antonopoulos; Paul Hunter 001; Shahab Raza; James Worrell 001 (FoSSaCS, 2015)

Reachability in Succinct One-Counter Games. - Paul Hunter 001 (RP, 2015)

Minimizing Regret in Discounted-Sum Games. - Paul Hunter 001; Guillermo A. Pérez 001; Jean-François Raskin (CSL, 2016)

Non-Zero Sum Games for Reactive Synthesis. - Romain Brenguier; Lorenzo Clemente; Paul Hunter 001; Guillermo A. Pérez 001; Mickael Randour; Jean-François Raskin; Ocan Sankur; Mathieu Sassolas (LATA, 2016)

Reactive synthesis without regret. - Paul Hunter 001; Guillermo A. Pérez 001; Jean-François Raskin (Acta Informatica, 2017)

Looking at mean payoff through foggy windows. - Paul Hunter 001; Guillermo A. Pérez 001; Jean-François Raskin (Acta Informatica, 2018)

Mean-payoff games with partial observation. - Paul Hunter 001; Arno Pauly; Guillermo A. Pérez 001; Jean-François Raskin (Theor. Comput. Sci., 2018)

Correction to: Reactive synthesis without regret. - Paul Hunter 001; Guillermo A. Pérez 001; Jean-François Raskin (Acta Informatica, 2022)