Deleting edges to restrict the size of an epidemic in temporal networks J Enright, K Meeks, GB Mertzios, V Zamaraev Journal of Computer and System Sciences 119, 60-77, 2021 | 45 | 2021 |

The parameterised complexity of counting connected subgraphs and graph motifs M Jerrum, K Meeks arXiv preprint arXiv:1308.1575, 2013 | 34* | 2013 |

The challenges of unbounded treewidth in parameterised subgraph counting problems K Meeks Discrete Applied Mathematics 198, 170-194, 2016 | 29 | 2016 |

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle H Dell, J Lapinskas, K Meeks SIAM Journal on Computing 51 (4), 849-899, 2022 | 23 | 2022 |

Assigning times to minimise reachability in temporal graphs J Enright, K Meeks, F Skerman Journal of Computer and System Sciences, 2020 | 23 | 2020 |

Deleting edges to restrict the size of an epidemic: a new application for treewidth J Enright, K Meeks Algorithmica 80 (6), 1857-1889, 2018 | 23 | 2018 |

The complexity of flood-filling games on graphs K Meeks, A Scott Discrete Applied Mathematics 160 (7-8), 959-969, 2012 | 22 | 2012 |

Efficiently enumerating hitting sets of hypergraphs arising in data profiling T Bläsius, T Friedrich, J Lischeid, K Meeks, M Schirneck Journal of Computer and System Sciences 124, 192-213, 2022 | 21* | 2022 |

The complexity of Free-Flood-It on 2× n boards K Meeks, A Scott Theoretical Computer Science 500, 25-43, 2013 | 21 | 2013 |

Some hard families of parameterised counting problems M Jerrum, K Meeks arXiv preprint arXiv:1310.6524, 2013 | 20* | 2013 |

Stable marriage with groups of similar agents K Meeks, B Rastegari International Conference on Web and Internet Economics, 312-326, 2018 | 15* | 2018 |

The parameterised complexity of counting even and odd induced subgraphs M Jerrum, K Meeks Combinatorica 37 (5), 965-990, 2017 | 15 | 2017 |

Spanning trees and the complexity of flood-filling games K Meeks, A Scott Theory of Computing Systems 54 (4), 731-753, 2014 | 15 | 2014 |

Edge exploration of temporal graphs BM Bumpus, K Meeks International Workshop on Combinatorial Algorithms, 107-121, 2021 | 9 | 2021 |

Randomised enumeration of small witnesses using a decision oracle K Meeks Algorithmica 81 (2), 519-540, 2019 | 8 | 2019 |

The parameterised complexity of list problems on graphs of bounded treewidth K Meeks, A Scott Information and Computation 251, 91-103, 2016 | 7* | 2016 |

Improved inference for areal unit count data using graph-based optimisation D Lee, K Meeks, W Pettersson Statistics and Computing 31 (4), 1-17, 2021 | 6 | 2021 |

Counting small subgraphs in multi-layer networks J Enright, K Meeks | 4* | 2017 |

The parameterised complexity of computing the maximum modularity of a graph K Meeks, F Skerman Algorithmica 82 (8), 2174-2199, 2020 | 3 | 2020 |

Reconstructing the degree sequence of a sparse graph from a partial deck C Groenland, T Johnston, A Kupavskii, K Meeks, A Scott, J Tan Journal of Combinatorial Theory, Series B 157, 283-293, 2022 | 2 | 2022 |