| 2016 | CSL | Minimizing Regret in Discounted-Sum Games. | Paul Hunter, Guillermo A. Prez, Jean-Franois Raskin |
| 2016 | LATA | Non-Zero Sum Games for Reactive Synthesis. | Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Prez, Mickael Randour, Jean-Franois Raskin, Ocan Sankur, Mathieu Sassolas |
| 2015 | ATVA | Looking at Mean-Payoff Through Foggy Windows. | Paul Hunter, Guillermo A. Prez, Jean-Franois Raskin |
| 2015 | CONCUR | Reactive Synthesis Without Regret. | Paul Hunter, Guillermo A. Prez, Jean-Franois Raskin |
| 2015 | FOSSACS | Three Variables Suffice for Real-Time Logic. | Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell |
| 2013 | CSL | When is Metric Temporal Logic Expressively Complete?. | Paul Hunter |
| 2013 | LICS | Expressive Completeness for Metric Temporal Logic. | Paul Hunter, Jol Ouaknine, James Worrell |
| 2011 | FCT | LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. | Paul Hunter |
| 2009 | HCI | Accommodating Real User and Organisational Requirements in the Human Centered Design Process: A Case Study from the Mobile Phone Industry. | Steve Love, Paul Hunter, Michael Anaman |
| 2007 | SODA | Digraph measures: Kelly decompositions, games, and orderings. | Paul Hunter, Stephan Kreutzer |
| 2006 | STACS | DAG-Width and Parity Games. | Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer |
| 2005 | MFCS | Complexity Bounds for Regular Games. | Paul Hunter, Anuj Dawar |