|
Kitty Meeks
MMath
eMail:
meeks [-at-] maths [dot] ox [dot] ac [dot] uk
Contact Form
Phone Number(s):
Reception/Secretary: 447748272212
Direct: +44 01865 (6)15304
Departmental Address:
Mathematical Institute
24-29 St Giles'
Oxford
OX1 3LB
England
|
Research Interests:
Graph theory, algorithms, computational complexity, parameterised complexity and related areas.
Major/Recent Publications:
- Spanning trees and the complexity of flood-filling games (with Alexander Scott) in: Kranakis, Evangelos, Krizanc, Danny, Luccio, Flaminia (Eds.), FUN 2012, LNCS 7288, pp. 282–292, Springer, 2012.
- Spanning trees and the complexity of flood-filling games [Journal version] (with Alexander Scott)
- The parameterised complexity of list problems on graphs of bounded treewidth, submitted (with Alexander Scott)
- The complexity of Free-Flood-It on 2xn boards, submitted (with Alexander Scott)
- The complexity of flood-filling games on graphs, Discrete Applied Mathematics (2011), doi:10.1016/j.dam.2011.09.001 (with Alexander Scott)
Teaching:
Graph Theory Class Tutor MT11
Probabilistic Combinatorics Class Tutor HT12
Tutor for Mods Statistics, Merton College, HT12
Further Details:
Recent presentations:
- Spanning trees and the complexity of flood-filling games, FUN 2012, Venice, June 2012.
- List colouring graphs of bounded treewidth, Séminaire de Combinatoire Algébrique et Géométrique, UPMC, Paris.
- The parameterised complexity of list problems on graphs of bounded treewidth, APEX, Paris, Feb 2012
- Flood filling games on graphs, British Combinatorial Conference, Exeter, July 2011
|
