| 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 | 79 | 2021 |
| The parameterised complexity of counting connected subgraphs and graph motifs M Jerrum, K Meeks arXiv preprint arXiv:1308.1575, 2013 | 45* | 2013 |
| 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 | 39 | 2022 |
| Assigning times to minimise reachability in temporal graphs J Enright, K Meeks, F Skerman Journal of Computer and System Sciences, 2020 | 37* | 2020 |
| The challenges of unbounded treewidth in parameterised subgraph counting problems K Meeks Discrete Applied Mathematics 198, 170-194, 2016 | 37 | 2016 |
| Edge exploration of temporal graphs BM Bumpus, K Meeks Algorithmica 85 (3), 688-716, 2023 | 31 | 2023 |
| 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 | 31* | 2022 |
| Deleting edges to restrict the size of an epidemic: a new application for treewidth J Enright, K Meeks Algorithmica 80, 1857-1889, 2018 | 30 | 2018 |
| Some hard families of parameterised counting problems M Jerrum, K Meeks arXiv preprint arXiv:1310.6524, 2013 | 25* | 2013 |
| The complexity of flood-filling games on graphs K Meeks, A Scott Discrete Applied Mathematics 160 (7-8), 959-969, 2012 | 24 | 2012 |
| The complexity of Free-Flood-It on 2× n boards K Meeks, A Scott Theoretical Computer Science 500, 25-43, 2013 | 23 | 2013 |
| The parameterised complexity of counting even and odd induced subgraphs M Jerrum, K Meeks Combinatorica 37 (5), 965-990, 2017 | 21 | 2017 |
| Counting temporal paths J Enright, K Meeks, H Molter arXiv preprint arXiv:2202.12055, 2022 | 20 | 2022 |
| Stable marriage with groups of similar agents K Meeks, B Rastegari Web and Internet Economics: 14th International Conference, WINE 2018, Oxford …, 2018 | 19* | 2018 |
| Spanning trees and the complexity of flood-filling games K Meeks, A Scott Theory of Computing Systems 54, 731-753, 2014 | 16 | 2014 |
| The parameterised complexity of list problems on graphs of bounded treewidth K Meeks, A Scott Information and Computation 251, 91-103, 2016 | 12* | 2016 |
| The parameterised complexity of computing the maximum modularity of a graph K Meeks, F Skerman Algorithmica 82 (8), 2174-2199, 2020 | 11 | 2020 |
| Randomised enumeration of small witnesses using a decision oracle K Meeks Algorithmica 81, 519-540, 2019 | 10 | 2019 |
| Improved inference for areal unit count data using graph-based optimisation D Lee, K Meeks, W Pettersson Statistics and Computing 31 (4), 51, 2021 | 9 | 2021 |
| Temporal graphs: Structure, algorithms, applications (dagstuhl seminar 21171) A Casteigts, K Meeks, GB Mertzios, R Niedermeier Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2021 | 7 | 2021 |
