Kitty Meeks - RankMe

95 papers A* 3A 3B 5C 5Misc 2Journal 67Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Cops and robbers on multi-layer graphs. Discret. Appl. Math. Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2025	—	`ed.`	4th Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2025, Liverpool, UK, June 9-11, 2025 SAND Kitty Meeks, Christian Scheideler
2025	—	`ed.`	Algorithmics of Wireless Networks - 20th International Symposium, ALGOWIN 2024, Egham, UK, September 5-6, 2024, Proceedings ALGOWIN Quentin Bramas, Arnaud Casteigts, Kitty Meeks
2025	—	`conf`	Approximating Temporal Modularity on Graphs of Small Underlying Treewidth. ALGOWIN Vilhelm Agdur, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, Fiona Skerman, Ella Yates
2025	J	`jnl`	Approximating temporal modularity on graphs of small underlying treewidth. CoRR Vilhelm Agdur, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, Fiona Skerman, Ella Yates
2025	J	`jnl`	Counting Temporal Paths. Algorithmica Jessica A. Enright, Kitty Meeks, Hendrik Molter
2025	J	`jnl`	Families of tractable problems with respect to vertex-interval-membership width and its generalisations. CoRR Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks
2025	—	`conf`	Reachability in Temporal Graphs Under Perturbation. SOFSEM (1) Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson
2025	J	`jnl`	Tangled Paths: A Random Graph Model from Mallows Permutations. Electron. J. Comb. Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2025	—	`conf`	Temporal Orienteering with Changing Fuel Costs. ALGOWIN Timothée Corsini, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks
2025	J	`jnl`	Temporal Orienteering with Changing Fuel Costs. CoRR Timothée Corsini, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks
2025	A*	`conf`	Temporal Triadic Closure: Finding Dense Substructures in Social Networks That Evolve over Time. AAAI Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks
2024	J	`jnl`	A new temporal interpretation of cluster editing. J. Comput. Syst. Sci. Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
2024	J	`jnl`	Counting Subgraphs in Somewhere Dense Graphs. SIAM J. Comput. Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2024	A*	`conf`	Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. ICALP Holger Dell, John Lapinskas, Kitty Meeks
2024	J	`jnl`	Parameterized Algorithms for Balanced Cluster Edge Modification Problems. CoRR Jayakrishnan Madathil, Kitty Meeks
2024	J	`jnl`	Reachability in temporal graphs under perturbation. CoRR Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson
2024	B	`conf`	Structural Parameters for Dense Temporal Graphs. MFCS Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks
2024	J	`jnl`	Structural Parameters for Dense Temporal Graphs. CoRR Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks
2024	J	`jnl`	Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve. CoRR Tom Davot, Jessica A. Enright, Jayakrishnan Madathil, Kitty Meeks
2024	J	`jnl`	The Complexity of Finding and Enumerating Optimal Subgraphs to Represent Spatial Correlation. Algorithmica Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester
2023	B	`conf`	Cops and Robbers on Multi-Layer Graphs. WG Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2023	J	`jnl`	Cops and Robbers on Multi-Layer Graphs. CoRR Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2023	A	`conf`	Counting Subgraphs in Somewhere Dense Graphs. ITCS Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2023	A	`conf`	Counting Temporal Paths. STACS Jessica A. Enright, Kitty Meeks, Hendrik Molter
2023	J	`jnl`	Edge Exploration of Temporal Graphs. Algorithmica Benjamin Merlin Bumpus, Kitty Meeks
2022	C	`conf`	A New Temporal Interpretation of Cluster Editing. IWOCA Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
2022	J	`jnl`	A New Temporal Interpretation of Cluster Editing. CoRR Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
2022	J	`jnl`	Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. Holger Dell, John Lapinskas, Kitty Meeks
2022	—	`conf`	Brief Announcement: The Temporal Firefighter Problem. SAND Samuel D. Hand, Jessica A. Enright, Kitty Meeks
2022	J	`jnl`	Counting Subgraphs in Somewhere Dense Graphs. CoRR Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth
2022	J	`jnl`	Counting Temporal Paths. CoRR Jessica A. Enright, Kitty Meeks, Hendrik Molter
2022	J	`jnl`	Efficiently enumerating hitting sets of hypergraphs arising in data profiling. J. Comput. Syst. Sci. Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2022	Misc	`conf`	Making Life More Confusing for Firefighters. FUN Samuel D. Hand, Jessica A. Enright, Kitty Meeks
2022	J	`jnl`	Making Life More Confusing for Firefighters. CoRR Samuel D. Hand, Jessica A. Enright, Kitty Meeks
2022	J	`jnl`	Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR Holger Dell, John Lapinskas, Kitty Meeks
2022	J	`jnl`	Reconstructing the degree sequence of a sparse graph from a partial deck. J. Comb. Theory B Carla Groenland, Tom Johnston, Andrey Kupavskii, Kitty Meeks, Alex D. Scott, Jane Tan
2022	C	`conf`	Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. CiE Kitty Meeks
2021	J	`jnl`	Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. Jessica A. Enright, Kitty Meeks, Fiona Skerman
2021	J	`jnl`	Deleting edges to restrict the size of an epidemic in temporal networks. J. Comput. Syst. Sci. Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
2021	C	`conf`	Edge Exploration of Temporal Graphs. IWOCA Benjamin Merlin Bumpus, Kitty Meeks
2021	J	`jnl`	Edge exploration of temporal graphs. CoRR Benjamin Merlin Bumpus, Kitty Meeks
2021	J	`jnl`	Improved inference for areal unit count data using graph-based optimisation. Stat. Comput. Duncan Lee, Kitty Meeks, William Pettersson
2021	J	`jnl`	Tangled Paths: A Random Graph Model from Mallows Permutations. CoRR Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester
2021	J	`jnl`	Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
2021	C	`conf`	The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester
2021	J	`jnl`	The interactive sum choice number of graphs. Discret. Appl. Math. Marthe Bonamy, Kitty Meeks
2020	A*	`conf`	Approximately counting and sampling small witnesses using a colourful decision oracle. SODA Holger Dell, John Lapinskas, Kitty Meeks
2020	J	`jnl`	Directed branch-width: A directed analogue of tree-width. CoRR Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson
2020	J	`jnl`	On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data. CoRR Duncan Lee, Kitty Meeks
2020	J	`jnl`	Solving hard stable matching problems involving groups of similar agents. Theor. Comput. Sci. Kitty Meeks, Baharak Rastegari
2020	J	`jnl`	The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica Kitty Meeks, Fiona Skerman
2019	J	`jnl`	Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR Holger Dell, John Lapinskas, Kitty Meeks
2019	B	`conf`	Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
2019	A	`conf`	Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck
2019	J	`jnl`	Extremal properties of flood-filling games. Discret. Math. Theor. Comput. Sci. Kitty Meeks, Dominik K. Vu
2019	J	`jnl`	Randomised Enumeration of Small Witnesses Using a Decision Oracle. Algorithmica Kitty Meeks
2018	J	`jnl`	Changing times to optimise reachability in temporal graphs. CoRR Jessica A. Enright, Kitty Meeks
2018	J	`jnl`	Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. Algorithmica Jessica A. Enright, Kitty Meeks
2018	J	`jnl`	Deleting edges to restrict the size of an epidemic in temporal networks. CoRR Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev
2018	J	`jnl`	On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck
2018	J	`jnl`	On the complexity of finding and counting solution-free sets of integers. Discret. Appl. Math. Kitty Meeks, Andrew Treglown
2018	—	`conf`	Stable Marriage with Groups of Similar Agents. WINE Kitty Meeks, Baharak Rastegari
2018	B	`conf`	The Parameterised Complexity of Computing the Maximum Modularity of a Graph. IPEC Kitty Meeks, Fiona Skerman
2018	J	`jnl`	The parameterised complexity of computing the maximum modularity of a graph. CoRR Kitty Meeks, Fiona Skerman
2017	J	`jnl`	Counting small subgraphs in multi-layer networks. CoRR Jessica A. Enright, Kitty Meeks
2017	J	`jnl`	On the complexity of finding and counting solution-free sets of integers. CoRR Kitty Meeks, Andrew Treglown
2017	—	`conf`	Preface. BCC Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks
2017	J	`jnl`	Solving Hard Stable Matching Problems Involving Groups of Similar Agents. CoRR Kitty Meeks, Baharak Rastegari
2017	—	`ed.`	Surveys in Combinatorics, 2017: Invited lectures from the 26th British Combinatorial Conference, Strathclyde, Glasgow, UK, July 3-7, 2017. BCC Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks
2017	J	`jnl`	The Interactive Sum Choice Number of Graphs. CoRR Marthe Bonamy, Kitty Meeks
2017	J	`jnl`	The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. Marthe Bonamy, Kitty Meeks
2017	J	`jnl`	The parameterised complexity of counting even and odd induced subgraphs. Comb. Mark Jerrum, Kitty Meeks
2016	B	`conf`	Randomised Enumeration of Small Witnesses Using a Decision Oracle. IPEC Kitty Meeks
2016	J	`jnl`	The challenges of unbounded treewidth in parameterised subgraph counting problems. Discret. Appl. Math. Kitty Meeks
2016	J	`jnl`	The parameterised complexity of list problems on graphs of bounded treewidth. Inf. Comput. Kitty Meeks, Alexander Scott
2015	C	`conf`	Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. COCOA Jessica A. Enright, Kitty Meeks
2015	J	`jnl`	Deleting edges to restrict the size of an epidemic. CoRR Jessica A. Enright, Kitty Meeks
2015	J	`jnl`	Extremal properties of flood-filling games. CoRR Kitty Meeks, Dominik K. Vu
2015	J	`jnl`	Randomised enumeration of small witnesses using a decision oracle. CoRR Kitty Meeks
2015	J	`jnl`	Some Hard Families of Parameterized Counting Problems. ACM Trans. Comput. Theory Mark Jerrum, Kitty Meeks
2015	J	`jnl`	The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. Mark Jerrum, Kitty Meeks
2014	J	`jnl`	Spanning Trees and the Complexity of Flood-Filling Games. Theory Comput. Syst. Kitty Meeks, Alexander Scott
2014	J	`jnl`	The challenges of unbounded treewidth in parameterised subgraph counting problems. CoRR Kitty Meeks
2014	J	`jnl`	The parameterised complexity of counting even and odd induced subgraphs. CoRR Mark Jerrum, Kitty Meeks
2013	J	`jnl`	Some hard classes of parameterised counting problems. CoRR Mark Jerrum, Kitty Meeks
2013	J	`jnl`	The Parameterised Complexity of Counting Connected Subgraphs. CoRR Mark Jerrum, Kitty Meeks
2013	J	`jnl`	The complexity of Free-Flood-It on 2×n boards. Theor. Comput. Sci. Kitty Meeks, Alexander Scott
2012	—	`—`	Graph colourings and games. Kitty Meeks
2012	Misc	`conf`	Spanning Trees and the Complexity of Flood-Filling Games. FUN Kitty Meeks, Alexander Scott
2012	J	`jnl`	Spanning trees and the complexity of flood-filling games CoRR Kitty Meeks, Alexander Scott
2012	J	`jnl`	The complexity of flood-filling games on graphs. Discret. Appl. Math. Kitty Meeks, Alexander Scott
2011	J	`jnl`	The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth CoRR Kitty Meeks, Alexander Scott
2011	J	`jnl`	The complexity of Free-Flood-It on 2xn boards CoRR Kitty Meeks, Alexander Scott
2011	J	`jnl`	The complexity of flood-filling games on graphs CoRR Kitty Meeks, Alexander Scott