Paul Hunter : Publications
Journal papers
|
[1] |
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 |
|
[2] |
Complexity Bounds for Muller Games Anuj Dawar‚ Florian Horn and Paul Hunter In Theoretical Computer Science. 2011. Submitted |
|
[3] |
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 |
|
[4] |
Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings Paul Hunter and Stephan Kreutzer In Theoretical Computer Science (TCS). Vol. 399. Pages 206−219. 2008. |
Conference papers
|
[1] |
LIFO−Search on Digraphs: A Searching Game for Cycle−Rank Paul Hunter In 18th International Symposium on Fundamentals of Computation Theory (FCT). Pages 217−228. 2011. |
|
[2] |
Computing Rational Radical Sums in Uniform TC0 Paul Hunter‚ Patricia Bouyer‚ Nicolas Markey‚ Joël Ouaknine and James Worrell In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 2010. |
|
[3] |
Complexity Bounds for Regular Games (Extended Abstract) Paul Hunter and Anuj Dawar In Symposium on Mathematical Foundations of Computer Science (MFCS). 2005. |
|
[4] |
DAG−Width and Parity Games Dietmar Berwanger‚ Anuj Dawar‚ Paul Hunter and Stephan Kreutzer In Symposium on Theoretical Aspects of Computer Science (STACS). 2006. |
|
[5] |
Digraph Measures: Kelly Decompositions‚ Games‚ and Orderings Paul Hunter and Stephan Kreutzer In ACM−SIAM Symposium on Discrete Algorithms (SODA). 2007. |
Theses
|
[1] |
Complexity and Infinite Games on Finite Graphs Paul Hunter PhD Thesis Computer Laboratory‚ University of Cambridge. 2007. |