• Approximately counting and sampling small witnesses using a colourful decision oracle
  Holger Dell, John Lapinskas and Kitty Meeks; preprint.
  arXiv version


• The parameterised complexity of computing the maximum modularity of a graph
  Kitty Meeks and Fiona Skerman; Algorithmica, doi:10.1007/s00453-019-00649-7.


• Deleting edges to restrict the size of an epidemic in temporal networks
  Jessica Enright, Kitty Meeks, George B. Mertzios and Viktor Zamaraev; preprint.
  arXiv version


• On the Enumeration of Minimal Hitting Sets in Lexicographical Order
  Thomas Bläsius, Tobias Friedrich, Kitty Meeks and Martin Schirneck; preprint.
  arXiv version


• Changing times to optimise reachability in temporal graphs
  Jessica Enright and Kitty Meeks; preprint.
  arXiv version


• Counting small subgraphs in multi-layer networks
  Jessica Enright and Kitty Meeks; preprint.
  arXiv version


• Solving hard stable matching problems involving groups of similar agents
  Kitty Meeks and Baharak Rastegari; preprint.
  arXiv version


• Randomised enumeration of small witnesses using a decision oracle
  Kitty Meeks; Algorithmica 81 (2019) pp.519-540; doi:10.1007/s00453-018-0404-y.
  arXiv version


• On the complexity of finding and counting solution-free sets of integers
  Kitty Meeks and Andrew Treglown; Discrete Applied Mathematics 243 (2018), pp.219-238; doi:10.1016/j.dam.2018.02.008.


• The interactive sum choice number of graphs
  Marthe Bonamy and Kitty Meeks; preprint.
  arXiv version


• Deleting edges to restrict the Size of an epidemic: a new application for treewidth
  Jessica Enright and Kitty Meeks; Algorithmica 80 (2018), pp.1857-1889; doi:10.1007/s00453-017-0311-7.


• Extremal properties of flood-filling games
  Kitty Meeks and Dominik K. Vu; Discrete Mathematics and Theoretical Computer Science 21:4 (2019).
  arXiv version


• The parameterised complexity of counting even and odd induced subgraphs
  Mark Jerrum and Kitty Meeks; Combinatorica 37 (2017), pp.965-990; doi:10.1007/s00493-016-3338-5.
  arXiv version


• The challenges of unbounded treewidth in parameterised subgraph counting problems
  Kitty Meeks; Discrete Applied Mathematics 198 (2016), pp.170-194; doi:10.1016/j.dam.2015.06.019.


• Some hard families of parameterised counting problems
  Mark Jerrum and Kitty Meeks, ACM Transactions on Computation Theory Volume 7 Issue 3, July 2015, Article No. 11, doi:10.1145/2786017.
  arXiv version


• The parameterised complexity of counting connected subgraphs and graph motifs
  Mark Jerrum and Kitty Meeks, Journal of Computer and System Sciences 81 (2015), pp. 702-716, doi:10.1016/j.jcss.2014.11.015.
  arXiv version


• Spanning trees and the complexity of flood-filling games
  Kitty Meeks and Alexander Scott, Theory of Computing Systems 54 (2014), pp. 731-753; doi:10.1007/s00224-013-9482-z.
  arXiv version


• The parameterised complexity of list problems on graphs of bounded treewidth
  Kitty Meeks and Alexander Scott; Information and Computation 251 (2016) pp. 91-103, doi:10.1016/j.ic.2016.08.001
  arXiv version


• The complexity of Free-Flood-It on 2xn boards
  Kitty Meeks and Alexander Scott, Theoretical Computer Science 500 (2013), pp. 25-43; doi:10.1016/j.tcs.2013.06.010.
  arXiv version


• The complexity of flood-filling games on graphs
  Kitty Meeks and Alexander Scott, Discrete Applied Mathematics 160 (2012), pp.959-969; doi:10.1016/j.dam.2011.09.001 .
  arXiv version

Conference proceedings

• Approximately counting and sampling small witnesses using a colourful decision oracle
  Holger Dell, John Lapinskas and Kitty Meeks; to appear in proc. SODA 2020.


• Deleting edges to restrict the size of an epidemic in temporal networks
  Jessica Enright, Kitty Meeks, George B. Mertzios and Viktor Zamaraev; in MFCS 2019, LIPIcs Vol. 138 (2019), Peter Rossmanith, Pinar Heggernes and Joost-Pieter Katoen (Eds.); doi:10.4230/LIPIcs.MFCS.2019.57.


• Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
  Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks and Martin Schirneck; in ALENEX 2019, Stephen Kobourov and Henning Meyerhenke (Eds.), SIAM; doi:10.1137/1.9781611975499.11


• Stable Marriage with Groups of Similar Agents
  Kitty Meeks and Baharak Rastegari; in WINE 2018, LNCS Vol. 11316, G. Christodoulou and T. Harks (Eds.), Springer, Cham; doi:10.1007/978-3-030-04612-5_21.


• The parameterised complexity of computing the maximum modularity of a graph
  Kitty Meeks and Fiona Skerman; in IPEC 2018, LIPIcs Vol. 115 (2019), Christophe Paul and Michal Pilipczuk (Eds.); doi:10.4230/LIPIcs.IPEC.2018.9.


• The interactive sum choice number of graphs
  Marthe Bonamy and Kitty Meeks; Electronic Notes in Discrete Mathematics 61 (EUROCOMB'17 Special Issue), pp.139-145; doi:10.1016/j.endm.2017.06.031.


• Randomised enumeration of small witnesses using a decision oracle
  Kitty Meeks; in IPEC 2016, LIPIcs Vol. 63 (2017), Jiong Guo and Danny Hermelin (Eds.); doi:10.4230/LIPIcs.IPEC.2016.22.
  Joint Best Paper.


• Deleting edges to restrict the size of an epidemic: a new application for treewidth
  Jessica Enright and Kitty Meeks; in COCOA 2015, LNCS 9486 (2015) pp. 574-585, Lu, Kim, Wu, Li and Du (Eds.), Springer; doi:10.1007/978-3-319-26626-8_42.


• Spanning trees and the complexity of flood-filling games
  Kitty Meeks and Alexander Scott, in FUN 2012, LNCS 7288 (2012), Kranakis, Krizanc, and Luccio (Eds.), Springer; doi:10.1007/978-3-642-30347-0_28