By Dr Paul Hunter

Journal articles

Hunter P; Pérez GA; Raskin J-F, 2022, 'Correction to: Reactive synthesis without regret', Acta Informatica, 59, pp. 671 - 671, http://dx.doi.org/10.1007/s00236-021-00410-0

Hunter P; Perez GA; Raskin J-F, 2018, 'Looking at mean payoff through foggy windows', ACTA INFORMATICA, 55, pp. 627 - 647, http://dx.doi.org/10.1007/s00236-017-0304-7

Hunter P; Perez GA; Raskin J-F, 2017, 'Reactive synthesis without regret', ACTA INFORMATICA, 54, pp. 3 - 39, http://dx.doi.org/10.1007/s00236-016-0268-z

Giannopoulou AC; Hunter P; Thilikos DM, 2012, 'LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth', DISCRETE APPLIED MATHEMATICS, 160, pp. 2089 - 2097, http://dx.doi.org/10.1016/j.dam.2012.03.015

Berwanger D; Dawar A; Hunter P; Kreutzer S; Obdrzalek J, 2012, 'The DAG-width of directed graphs', JOURNAL OF COMBINATORIAL THEORY SERIES B, 102, pp. 900 - 923, http://dx.doi.org/10.1016/j.jctb.2012.04.004

Hunter P; Kreutzer S, 2008, 'Digraph measures: Kelly decompositions, games, and orderings', THEORETICAL COMPUTER SCIENCE, 399, pp. 206 - 219, http://dx.doi.org/10.1016/j.tcs.2008.02.038

Back to profile page