The complexity of Free-Flood-It on 2xn boards - Kitty Meeks; Alexander Scott 001 (CoRR, 2011)

The complexity of flood-filling games on graphs. - Kitty Meeks; Alexander Scott 001 (Discret. Appl. Math., 2012)

Graph colourings and games. - Kitty Meeks (2012)

The Parameterised Complexity of Counting Connected Subgraphs. - Mark Jerrum; Kitty Meeks (CoRR, 2013)

Some hard classes of parameterised counting problems. - Mark Jerrum; Kitty Meeks (CoRR, 2013)

The complexity of Free-Flood-It on 2×n boards. - Kitty Meeks; Alexander Scott 001 (Theor. Comput. Sci., 2013)

Spanning Trees and the Complexity of Flood-Filling Games. - Kitty Meeks; Alexander Scott 001 (Theory Comput. Syst., 2014)

Deleting edges to restrict the size of an epidemic. - Jessica A. Enright; Kitty Meeks (CoRR, 2015)

The parameterised complexity of counting connected subgraphs and graph motifs. - Mark Jerrum; Kitty Meeks (J. Comput. Syst. Sci., 2015)

Some Hard Families of Parameterized Counting Problems. - Mark Jerrum; Kitty Meeks (ACM Trans. Comput. Theory, 2015)

The challenges of unbounded treewidth in parameterised subgraph counting problems. - Kitty Meeks (Discret. Appl. Math., 2016)

The parameterised complexity of list problems on graphs of bounded treewidth. - Kitty Meeks; Alexander Scott 001 (Inf. Comput., 2016)

Preface. - Anders Claesson; Mark Dukes; Sergey Kitaev; David F. Manlove; Kitty Meeks (BCC, 2017)

The parameterised complexity of counting even and odd induced subgraphs. - Mark Jerrum; Kitty Meeks (Comb., 2017)

Counting small subgraphs in multi-layer networks. - Jessica A. Enright; Kitty Meeks (CoRR, 2017)

Stable Marriage with Groups of Similar Agents. - Kitty Meeks; Baharak Rastegari (WINE, 2018)

Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. - Jessica A. Enright; Kitty Meeks (Algorithmica, 2018)

Changing times to optimise reachability in temporal graphs. - Jessica A. Enright; Kitty Meeks (CoRR, 2018)

On the Enumeration of Minimal Hitting Sets in Lexicographical Order. - Thomas Bläsius; Tobias Friedrich 001; Kitty Meeks; Martin Schirneck (CoRR, 2018)

On the complexity of finding and counting solution-free sets of integers. - Kitty Meeks; Andrew Treglown (Discret. Appl. Math., 2018)

Randomised Enumeration of Small Witnesses Using a Decision Oracle. - Kitty Meeks (Algorithmica, 2019)

Extremal properties of flood-filling games. - Kitty Meeks; Dominik K. Vu (Discret. Math. Theor. Comput. Sci., 2019)

Approximately counting and sampling small witnesses using a colourful decision oracle. - Holger Dell; John Lapinskas; Kitty Meeks (SODA, 2020)

The Parameterised Complexity of Computing the Maximum Modularity of a Graph. - Kitty Meeks; Fiona Skerman (Algorithmica, 2020)

Directed branch-width: A directed analogue of tree-width. - Benjamin Merlin Bumpus; Kitty Meeks; William Pettersson (CoRR, 2020)

On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data. - Duncan Lee; Kitty Meeks (CoRR, 2020)

Solving hard stable matching problems involving groups of similar agents. - Kitty Meeks; Baharak Rastegari (Theor. Comput. Sci., 2020)

The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. - Jessica A. Enright; Duncan Lee; Kitty Meeks; William Pettersson; John Sylvester 001 (COCOA, 2021)

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). - Arnaud Casteigts; Kitty Meeks; George B. Mertzios; Rolf Niedermeier (Dagstuhl Reports, 2021)

The interactive sum choice number of graphs. - Marthe Bonamy; Kitty Meeks (Discret. Appl. Math., 2021)

Deleting edges to restrict the size of an epidemic in temporal networks. - Jessica A. Enright; Kitty Meeks; George B. Mertzios; Viktor Zamaraev (J. Comput. Syst. Sci., 2021)

Assigning times to minimise reachability in temporal graphs. - Jessica A. Enright; Kitty Meeks; Fiona Skerman (J. Comput. Syst. Sci., 2021)

Improved inference for areal unit count data using graph-based optimisation. - Duncan Lee; Kitty Meeks; William Pettersson (Stat. Comput., 2021)

Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. - Kitty Meeks (CiE, 2022)

Making Life More Confusing for Firefighters. - Samuel D. Hand; Jessica A. Enright; Kitty Meeks (FUN, 2022)

Brief Announcement: The Temporal Firefighter Problem. - Samuel D. Hand; Jessica A. Enright; Kitty Meeks (SAND, 2022)

Efficiently enumerating hitting sets of hypergraphs arising in data profiling. - Thomas Bläsius; Tobias Friedrich 001; Julius Lischeid; Kitty Meeks; Martin Schirneck (J. Comput. Syst. Sci., 2022)

Reconstructing the degree sequence of a sparse graph from a partial deck. - Carla Groenland; Tom Johnston; Andrey Kupavskii; Kitty Meeks; Alex D. Scott; Jane Tan (J. Comb. Theory B, 2022)

Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. - Holger Dell; John Lapinskas; Kitty Meeks (SIAM J. Comput., 2022)

Cops and Robbers on Multi-Layer Graphs. - Jessica A. Enright; Kitty Meeks; William Pettersson; John Sylvester 001 (WG, 2023)

Edge Exploration of Temporal Graphs. - Benjamin Merlin Bumpus; Kitty Meeks (Algorithmica, 2023)

Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. - Holger Dell; John Lapinskas; Kitty Meeks (ICALP, 2024)

Structural Parameters for Dense Temporal Graphs. - Jessica A. Enright; Samuel D. Hand; Laura Larios-Jones; Kitty Meeks (MFCS, 2024)

Parameterized Algorithms for Balanced Cluster Edge Modification Problems. - Jayakrishnan Madathil; Kitty Meeks (CoRR, 2024)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve. - Tom Davot; Jessica A. Enright; Jayakrishnan Madathil; Kitty Meeks (CoRR, 2024)

A new temporal interpretation of cluster editing. - Cristiano Bocci; Chiara Capresi; Kitty Meeks; John Sylvester 001 (J. Comput. Syst. Sci., 2024)

Counting Subgraphs in Somewhere Dense Graphs. - Marco Bressan 002; Leslie Ann Goldberg; Kitty Meeks; Marc Roth (SIAM J. Comput., 2024)

The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. - Jessica A. Enright; Duncan Lee; Kitty Meeks; William Pettersson; John Sylvester 001 (Algorithmica, 2024)

Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time. - Tom Davot; Jessica A. Enright; Jayakrishnan Madathil; Kitty Meeks (AAAI, 2025)

Reachability in Temporal Graphs Under Perturbation. - Jessica A. Enright; Laura Larios-Jones; Kitty Meeks; William Pettersson (SOFSEM (1), 2025)

Tangled Paths: A Random Graph Model from Mallows Permutations. - Jessica A. Enright; Kitty Meeks; William Pettersson; John Sylvester 001 (Electron. J. Comb., 2025)

Counting Temporal Paths. - Jessica A. Enright; Kitty Meeks; Hendrik Molter (Algorithmica, 2025)

Families of tractable problems with respect to vertex-interval-membership width and its generalisations. - Jessica A. Enright; Samuel D. Hand; Laura Larios-Jones; Kitty Meeks (CoRR, 2025)

Temporal Orienteering with Changing Fuel Costs. - Timothée Corsini; Jessica A. Enright; Laura Larios-Jones; Kitty Meeks (CoRR, 2025)

Approximating temporal modularity on graphs of small underlying treewidth. - Vilhelm Agdur; Jessica A. Enright; Laura Larios-Jones; Kitty Meeks; Fiona Skerman; Ella Yates (CoRR, 2025)