Paul Hunter
Themes:
Completed Projects:
See Also:
Interests
My research is primarily centred on the use of mathematical games in theoretical computer science, in particular games for formal verification and pursuit-evasion games defining structural and algorithmic complexity.Selected Publications
-
The DAG−Width of Directed Graphs
Dietmar Berwanger‚ Anuj Dawar‚ Paul Hunter‚ Stephan Kreutzer and Jan Obdržalek
In Journal of Combinatorial Theory‚ Series B. 2012.
Accepted for publication
Details about The DAG−Width of Directed Graphs | BibTeX data for The DAG−Width of Directed Graphs
-
Complexity Bounds for Muller Games
Anuj Dawar‚ Florian Horn and Paul Hunter
In Theoretical Computer Science. 2011.
Submitted
Details about Complexity Bounds for Muller Games | BibTeX data for Complexity Bounds for Muller Games
-
LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth.
Archontia Giannopoulou‚ Paul Hunter and Dimitrios Thilikos
In Discrete Mathematics. 2011.
Submitted
Details about LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth. | BibTeX data for LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth. | Download (pdf) of LIFO−search: A min−max theorem and a searching game for cycle−rank and tree−depth.