Kitty Meeks

ORCID

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 60

Top Venues

CoRR

J. Comput. Syst. Sci.

Algorithmica

Discret. Appl. Math.

University of Oxford, UK (PHD)

Education History

University of Oxford, UK

PHD

Publications

Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
Cops and Robbers on Multi-Layer Graphs. WG (2023)
Benjamin Merlin Bumpus, Kitty Meeks
Edge Exploration of Temporal Graphs. Algorithmica 85 (3) (2023)
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
Counting Subgraphs in Somewhere Dense Graphs. ITCS (2023)
Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
Cops and Robbers on Multi-Layer Graphs. CoRR (2023)
Jessica A. Enright, Kitty Meeks, Hendrik Molter
Counting Temporal Paths. STACS (2023)
Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
A New Temporal Interpretation of Cluster Editing. CoRR (2022)
Samuel D. Hand, Jessica A. Enright, Kitty Meeks
Making Life More Confusing for Firefighters. FUN (2022)
Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan
Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory, Ser. B 157 (2022)
Samuel D. Hand, Jessica A. Enright, Kitty Meeks
Brief Announcement: The Temporal Firefighter Problem. SAND (2022)
Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
Counting Subgraphs in Somewhere Dense Graphs. CoRR (2022)
Samuel Hand, Jessica A. Enright, Kitty Meeks
Making Life More Confusing for Firefighters. CoRR (2022)
Holger Dell, John Lapinskas, Kitty Meeks
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR (2022)
Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
A New Temporal Interpretation of Cluster Editing. IWOCA (2022)
Jessica A. Enright, Kitty Meeks, Hendrik Molter
Counting Temporal Paths. CoRR (2022)
Kitty Meeks
Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. CiE (2022)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. 51 (4) (2022)
Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. 124 (2022)
Benjamin Merlin Bumpus, Kitty Meeks
Edge exploration of temporal graphs. CoRR (2021)
Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
Tangled Paths: A Random Graph Model from Mallows Permutations. CoRR (2021)
Marthe Bonamy, Kitty Meeks
The interactive sum choice number of graphs. Discret. Appl. Math. 292 (2021)
Duncan Lee, Kitty Meeks, William Pettersson
Improved inference for areal unit count data using graph-based optimisation. Stat. Comput. 31 (4) (2021)
Jessica A. Enright, Kitty Meeks, Fiona Skerman
Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. 115 (2021)
Benjamin Merlin Bumpus, Kitty Meeks
Edge Exploration of Temporal Graphs. IWOCA (2021)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. 119 (2021)
Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA (2021)
Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11 (3) (2021)
Kitty Meeks, Fiona Skerman
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica 82 (8) (2020)
Duncan Lee, Kitty Meeks
On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data. CoRR (2020)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately counting and sampling small witnesses using a colourful decision oracle. SODA (2020)
Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson
Directed branch-width: A directed analogue of tree-width. CoRR (2020)
Kitty Meeks, Baharak Rastegari
Solving hard stable matching problems involving groups of similar agents. Theor. Comput. Sci. 844 (2020)
Kitty Meeks
Randomised Enumeration of Small Witnesses Using a Decision Oracle. Algorithmica 81 (2) (2019)
Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX (2019)
Holger Dell, John Lapinskas, Kitty Meeks
Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR (2019)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS (2019)
Kitty Meeks, Dominik K. Vu
Extremal properties of flood-filling games. Discret. Math. Theor. Comput. Sci. 21 (4) (2019)
Kitty Meeks, Fiona Skerman
The parameterised complexity of computing the maximum modularity of a graph. CoRR (2018)
Kitty Meeks, Baharak Rastegari
Stable Marriage with Groups of Similar Agents. WINE (2018)
Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR (2018)
Kitty Meeks, Fiona Skerman
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. IPEC (2018)
Jessica A. Enright, Kitty Meeks
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. Algorithmica 80 (6) (2018)
Jessica A. Enright, Kitty Meeks
Changing times to optimise reachability in temporal graphs. CoRR (2018)
Kitty Meeks, Andrew Treglown
On the complexity of finding and counting solution-free sets of integers. Discret. Appl. Math. 243 (2018)
Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
Deleting edges to restrict the size of an epidemic in temporal networks. CoRR (2018)
Marthe Bonamy, Kitty Meeks
The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. 61 (2017)
Jessica A. Enright, Kitty Meeks
Counting small subgraphs in multi-layer networks. CoRR (2017)
Mark Jerrum, Kitty Meeks
The parameterised complexity of counting even and odd induced subgraphs. Comb. 37 (5) (2017)
Kitty Meeks, Baharak Rastegari
Solving Hard Stable Matching Problems Involving Groups of Similar Agents. CoRR (2017)
Marthe Bonamy, Kitty Meeks
The Interactive Sum Choice Number of Graphs. CoRR (2017)
Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks
Preface. BCC (2017)
Kitty Meeks, Andrew Treglown
On the complexity of finding and counting solution-free sets of integers. CoRR (2017)
Kitty Meeks
The challenges of unbounded treewidth in parameterised subgraph counting problems. Discret. Appl. Math. 198 (2016)
Kitty Meeks
Randomised Enumeration of Small Witnesses Using a Decision Oracle. IPEC (2016)
Kitty Meeks, Alexander Scott
The parameterised complexity of list problems on graphs of bounded treewidth. Inf. Comput. 251 (2016)
Mark Jerrum, Kitty Meeks
The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. 81 (4) (2015)
Jessica A. Enright, Kitty Meeks
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. COCOA (2015)
Jessica A. Enright, Kitty Meeks
Deleting edges to restrict the size of an epidemic. CoRR (2015)
Mark Jerrum, Kitty Meeks
Some Hard Families of Parameterized Counting Problems. ACM Trans. Comput. Theory 7 (3) (2015)
Kitty Meeks
Randomised enumeration of small witnesses using a decision oracle. CoRR (2015)
Kitty Meeks, Dominik K. Vu
Extremal properties of flood-filling games. CoRR (2015)
Kitty Meeks
The challenges of unbounded treewidth in parameterised subgraph counting problems. CoRR (2014)
Mark Jerrum, Kitty Meeks
The parameterised complexity of counting even and odd induced subgraphs. CoRR (2014)
Kitty Meeks, Alexander Scott
Spanning Trees and the Complexity of Flood-Filling Games. Theory Comput. Syst. 54 (4) (2014)
Mark Jerrum, Kitty Meeks
The Parameterised Complexity of Counting Connected Subgraphs. CoRR (2013)
Mark Jerrum, Kitty Meeks
Some hard classes of parameterised counting problems. CoRR (2013)
Kitty Meeks, Alexander Scott
The complexity of Free-Flood-It on 2×n boards. Theor. Comput. Sci. 500 (2013)
Kitty Meeks, Alexander Scott
The complexity of flood-filling games on graphs. Discret. Appl. Math. 160 (7-8) (2012)
Kitty Meeks, Alexander Scott
Spanning trees and the complexity of flood-filling games CoRR (2012)
Kitty Meeks, Alexander Scott
Spanning Trees and the Complexity of Flood-Filling Games. FUN (2012)
Kitty Meeks, Alexander Scott
The complexity of Free-Flood-It on 2xn boards CoRR (2011)
Kitty Meeks, Alexander Scott
The complexity of flood-filling games on graphs CoRR (2011)
Kitty Meeks, Alexander Scott
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth CoRR (2011)

Kitty Meeks.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kitty Meeks