Paul Hunter : Publications

Click here to download all publications in a single bibtex file

@article{BDHKO12,
  title = "The DAG-Width of Directed Graphs",
  author = "Dietmar Berwanger and Anuj Dawar and Paul Hunter and Stephan Kreutzer and Jan Obdr\v{z}alek",
  year = "2012",
  journal = "Journal of Combinatorial Theory, Series B",
  note = "Accepted for publication",
}

@article{DHH11,
  title = "{Complexity Bounds for Muller Games}",
  author = "Anuj Dawar and Florian Horn and Paul Hunter",
  year = "2011",
  journal = "Theoretical Computer Science",
  note = "Submitted",
}

@article{GHT11,
  title = "{LIFO-search: A min-max theorem and a searching game for cycle-rank and tree-depth.}",
  author = "Archontia Giannopoulou and Paul Hunter and Dimitrios Thilikos",
  year = "2011",
  journal = "Discrete Mathematics",
  note = "Submitted",
  url = "http://www.comlab.ox.ac.uk/people/Paul.Hunter/papers/lifo-journal.pdf",
}

@inproceedings{Hunter11,
  title = "LIFO-Search on Digraphs: A Searching Game for Cycle-Rank",
  author = "Paul Hunter",
  year = "2011",
  booktitle = "18th International Symposium on Fundamentals of Computation Theory (FCT)",
  pages = "217-228",
  url = "http://www.comlab.ox.ac.uk/people/Paul.Hunter/papers/lifo-digraph.pdf",
}

@inproceedings{4330,
  title = "Computing Rational Radical Sums in Uniform TC<sup>0</sup>",
  author = "Paul Hunter and Patricia Bouyer and Nicolas Markey and Joël Ouaknine and James Worrell",
  year = "2010",
  booktitle = "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)",
  url = "http://www.comlab.ox.ac.uk/people/Paul.Hunter/papers/crrsiut.pdf",
}

@article{HunterKre07,
  title = "Digraph Measures: Kelly Decompositions, Games, and Orderings",
  author = "Paul Hunter and Stephan Kreutzer",
  year = "2008",
  annote = "Special Issue for GRASTA'06",
  journal = "Theoretical Computer Science (TCS)",
  pages = "206-219",
  url = "http://web.comlab.ox.ac.uk/oucl/work/stephan.kreutzer/Publications/07-tcs-kelly.pdf",
  volume = "399",
}

@inproceedings{HunterKre07,
  title = "Digraph Measures: Kelly Decompositions, Games, and Orderings",
  author = "Paul Hunter and Stephan Kreutzer",
  year = "2007",
  booktitle = "ACM-SIAM Symposium on Discrete Algorithms (SODA)",
}

@phdthesis{HunterPhD,
  title = "Complexity and Infinite Games on Finite Graphs",
  author = "Paul Hunter",
  year = "2007",
  school = "Computer Laboratory, University of Cambridge",
  url = "http://web.comlab.ox.ac.uk/oucl/work/paul.hunter/papers/thesis.pdf",
}

@inproceedings{BerwangerDawHunKre06,
  title = "DAG-Width and Parity Games",
  author = "Dietmar Berwanger and Anuj Dawar and Paul Hunter and Stephan Kreutzer",
  year = "2006",
  booktitle = "Symposium on Theoretical Aspects of Computer Science (STACS)",
  url = "http://web.comlab.ox.ac.uk/oucl/work/paul.hunter/papers/dagwidth_stacs06.pdf",
}

@inproceedings{HunterDaw05,
  title = "Complexity Bounds for Regular Games (Extended Abstract)",
  author = "Paul Hunter and Anuj Dawar",
  year = "2005",
  booktitle = "Symposium on Mathematical Foundations of Computer Science (MFCS)",
  url = "http://web.comlab.ox.ac.uk/oucl/work/paul.hunter/papers/mfcsfinal.pdf",
}