Kitty Meeks
Cited by
Cited by
The parameterised complexity of counting connected subgraphs and graph motifs
M Jerrum, K Meeks
arXiv preprint arXiv:1308.1575, 2013
The challenges of unbounded treewidth in parameterised subgraph counting problems
K Meeks
Discrete Applied Mathematics 198, 170-194, 2016
Deleting edges to restrict the size of an epidemic in temporal networks
J Enright, K Meeks, GB Mertzios, V Zamaraev
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
The complexity of Free-Flood-It on 2× n boards
K Meeks, A Scott
Theoretical Computer Science 500, 25-43, 2013
The complexity of flood-filling games on graphs
K Meeks, A Scott
Discrete Applied Mathematics 160 (7-8), 959-969, 2012
Deleting edges to restrict the size of an epidemic: a new application for treewidth
J Enright, K Meeks
Algorithmica 80 (6), 1857-1889, 2018
Some hard families of parameterised counting problems
M Jerrum, K Meeks
arXiv preprint arXiv:1310.6524, 2013
Spanning trees and the complexity of flood-filling games
K Meeks, A Scott
Theory of Computing Systems 54 (4), 731-753, 2014
Efficiently enumerating hitting sets of hypergraphs arising in data profiling
T Bläsius, T Friedrich, J Lischeid, K Meeks, M Schirneck
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019
Approximately counting and sampling small witnesses using a colourful decision oracle
H Dell, J Lapinskas, K Meeks
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
The parameterised complexity of counting even and odd induced subgraphs
M Jerrum, K Meeks
Combinatorica 37 (5), 965-990, 2017
Assigning times to minimise reachability in temporal graphs
J Enright, K Meeks, F Skerman
Journal of Computer and System Sciences, 2020
Stable marriage with groups of similar agents
K Meeks, B Rastegari
International Conference on Web and Internet Economics, 312-326, 2018
The parameterised complexity of list problems on graphs of bounded treewidth
K Meeks, A Scott
Information and Computation 251, 91-103, 2016
Randomised enumeration of small witnesses using a decision oracle
K Meeks
Algorithmica 81 (2), 519-540, 2019
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
The parameterised complexity of computing the maximum modularity of a graph
K Meeks, F Skerman
Algorithmica, 1-26, 2019
On the complexity of finding and counting solution-free sets of integers
K Meeks, A Treglown
Discrete Applied Mathematics 243, 219-238, 2018
Counting small subgraphs in multi-layer networks
J Enright, K Meeks
arXiv preprint arXiv:1710.08758, 2017
The interactive sum choice number of graphs
M Bonamy, K Meeks
Electronic Notes in Discrete Mathematics 61, 139-145, 2017
The system can't perform the operation now. Try again later.
Articles 1–20