Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKitty Meeks
Person information
- affiliation: University of Glasgow, UK
- affiliation (former): University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester
:
A new temporal interpretation of cluster editing. J. Comput. Syst. Sci. 144: 103551 (2024)- [c20]Holger Dell, John Lapinskas, Kitty Meeks:
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs. ICALP 2024: 54:1-54:17 - [c19]Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks:
Structural Parameters for Dense Temporal Graphs. MFCS 2024: 52:1-52:15 - [i34]Jayakrishnan Madathil, Kitty Meeks:
Parameterized Algorithms for Balanced Cluster Edge Modification Problems. CoRR abs/2403.03830 (2024) - [i33]Jessica A. Enright, Samuel D. Hand, Laura Larios-Jones, Kitty Meeks:
Structural Parameters for Dense Temporal Graphs. CoRR abs/2404.19453 (2024) - [i32]Jessica A. Enright, Laura Larios-Jones, Kitty Meeks, William Pettersson:
Reachability in temporal graphs under perturbation. CoRR abs/2404.19479 (2024) - 2023
- [j23]Benjamin Merlin Bumpus, Kitty Meeks:
Edge Exploration of Temporal Graphs. Algorithmica 85(3): 688-716 (2023) - [c18]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. ITCS 2023: 27:1-27:14 - [c17]Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. STACS 2023: 30:1-30:19 - [c16]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. WG 2023: 319-333 - [i31]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Cops and Robbers on Multi-Layer Graphs. CoRR abs/2303.03962 (2023) - 2022
- [j22]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: 192-213 (2022) - [j21]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 B 157: 283-293 (2022) - [j20]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle. SIAM J. Comput. 51(4): 849-899 (2022) - [c15]Kitty Meeks:
Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes. CiE 2022: 186-195 - [c14]Samuel D. Hand, Jessica A. Enright, Kitty Meeks:
Making Life More Confusing for Firefighters. FUN 2022: 15:1-15:15 - [c13]Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester:
A New Temporal Interpretation of Cluster Editing. IWOCA 2022: 214-227 - [c12]Samuel D. Hand, Jessica A. Enright, Kitty Meeks:
Brief Announcement: The Temporal Firefighter Problem. SAND 2022: 22:1-22:3 - [i30]Cristiano Bocci, Chiara Capresi, Kitty Meeks, John Sylvester:
A New Temporal Interpretation of Cluster Editing. CoRR abs/2202.01103 (2022) - [i29]Jessica A. Enright, Kitty Meeks, Hendrik Molter:
Counting Temporal Paths. CoRR abs/2202.12055 (2022) - [i28]Samuel D. Hand, Jessica A. Enright, Kitty Meeks:
Making Life More Confusing for Firefighters. CoRR abs/2202.12599 (2022) - [i27]Marco Bressan, Leslie Ann Goldberg, Kitty Meeks, Marc Roth:
Counting Subgraphs in Somewhere Dense Graphs. CoRR abs/2209.03402 (2022) - [i26]Holger Dell, John Lapinskas, Kitty Meeks:
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs. CoRR abs/2211.03874 (2022) - 2021
- [j19]Marthe Bonamy, Kitty Meeks:
The interactive sum choice number of graphs. Discret. Appl. Math. 292: 72-84 (2021) - [j18]Jessica A. Enright, Kitty Meeks, Fiona Skerman:
Assigning times to minimise reachability in temporal graphs. J. Comput. Syst. Sci. 115: 169-186 (2021) - [j17]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: 60-77 (2021) - [j16]Duncan Lee, Kitty Meeks, William Pettersson:
Improved inference for areal unit count data using graph-based optimisation. Stat. Comput. 31(4): 51 (2021) - [c11]Jessica A. Enright, Duncan Lee, Kitty Meeks, William Pettersson, John Sylvester:
The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation. COCOA 2021: 152-166 - [c10]Benjamin Merlin Bumpus, Kitty Meeks:
Edge Exploration of Temporal Graphs. IWOCA 2021: 107-121 - [i25]Benjamin Merlin Bumpus, Kitty Meeks:
Edge exploration of temporal graphs. CoRR abs/2103.05387 (2021) - [i24]Jessica A. Enright, Kitty Meeks, William Pettersson, John Sylvester:
Tangled Paths: A Random Graph Model from Mallows Permutations. CoRR abs/2108.04786 (2021) - [i23]Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier:
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11(3): 16-46 (2021) - 2020
- [j15]Kitty Meeks, Fiona Skerman:
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. Algorithmica 82(8): 2174-2199 (2020) - [j14]Kitty Meeks, Baharak Rastegari:
Solving hard stable matching problems involving groups of similar agents. Theor. Comput. Sci. 844: 171-194 (2020) - [c9]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately counting and sampling small witnesses using a colourful decision oracle. SODA 2020: 2201-2211 - [i22]Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson:
Directed branch-width: A directed analogue of tree-width. CoRR abs/2009.08903 (2020) - [i21]Duncan Lee, Kitty Meeks:
On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data. CoRR abs/2010.10314 (2020)
2010 – 2019
- 2019
- [j13]Kitty Meeks:
Randomised Enumeration of Small Witnesses Using a Decision Oracle. Algorithmica 81(2): 519-540 (2019) - [j12]Kitty Meeks, Dominik K. Vu:
Extremal properties of flood-filling games. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [c8]Thomas Bläsius, Tobias Friedrich, Julius Lischeid, Kitty Meeks, Martin Schirneck:
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. ALENEX 2019: 130-143 - [c7]Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev:
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks. MFCS 2019: 57:1-57:15 - [i20]Holger Dell, John Lapinskas, Kitty Meeks:
Approximately counting and sampling small witnesses using a colourful decision oracle. CoRR abs/1907.04826 (2019) - 2018
- [j11]Jessica A. Enright, Kitty Meeks:
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. Algorithmica 80(6): 1857-1889 (2018) - [j10]Kitty Meeks, Andrew Treglown:
On the complexity of finding and counting solution-free sets of integers. Discret. Appl. Math. 243: 219-238 (2018) - [c6]Kitty Meeks, Fiona Skerman:
The Parameterised Complexity of Computing the Maximum Modularity of a Graph. IPEC 2018: 9:1-9:14 - [c5]Kitty Meeks, Baharak Rastegari:
Stable Marriage with Groups of Similar Agents. WINE 2018: 312-326 - [i19]Jessica A. Enright, Kitty Meeks:
Changing times to optimise reachability in temporal graphs. CoRR abs/1802.05905 (2018) - [i18]Thomas Bläsius, Tobias Friedrich, Kitty Meeks, Martin Schirneck:
On the Enumeration of Minimal Hitting Sets in Lexicographical Order. CoRR abs/1805.01310 (2018) - [i17]Jessica A. Enright, Kitty Meeks, George B. Mertzios, Viktor Zamaraev:
Deleting edges to restrict the size of an epidemic in temporal networks. CoRR abs/1805.06836 (2018) - [i16]Kitty Meeks, Fiona Skerman:
The parameterised complexity of computing the maximum modularity of a graph. CoRR abs/1807.06965 (2018) - 2017
- [j9]Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting even and odd induced subgraphs. Comb. 37(5): 965-990 (2017) - [j8]Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. 61: 139-145 (2017) - [c4]Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Preface. BCC 2017: vii-viii - [e1]Anders Claesson, Mark Dukes, Sergey Kitaev, David F. Manlove, Kitty Meeks:
Surveys in Combinatorics, 2017: Invited lectures from the 26th British Combinatorial Conference, Strathclyde, Glasgow, UK, July 3-7, 2017. Cambridge University Press 2017, ISBN 978-1-108-41313-8 [contents] - [i15]Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. CoRR abs/1703.05380 (2017) - [i14]Kitty Meeks, Andrew Treglown:
On the complexity of finding and counting solution-free sets of integers. CoRR abs/1704.03758 (2017) - [i13]Kitty Meeks, Baharak Rastegari:
Solving Hard Stable Matching Problems Involving Groups of Similar Agents. CoRR abs/1708.04109 (2017) - [i12]Jessica A. Enright, Kitty Meeks:
Counting small subgraphs in multi-layer networks. CoRR abs/1710.08758 (2017) - 2016
- [j7]Kitty Meeks:
The challenges of unbounded treewidth in parameterised subgraph counting problems. Discret. Appl. Math. 198: 170-194 (2016) - [j6]Kitty Meeks, Alexander Scott:
The parameterised complexity of list problems on graphs of bounded treewidth. Inf. Comput. 251: 91-103 (2016) - [c3]Kitty Meeks:
Randomised Enumeration of Small Witnesses Using a Decision Oracle. IPEC 2016: 22:1-22:12 - 2015
- [j5]Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting connected subgraphs and graph motifs. J. Comput. Syst. Sci. 81(4): 702-716 (2015) - [j4]Mark Jerrum, Kitty Meeks:
Some Hard Families of Parameterized Counting Problems. ACM Trans. Comput. Theory 7(3): 11:1-11:18 (2015) - [c2]Jessica A. Enright, Kitty Meeks:
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. COCOA 2015: 574-585 - [i11]Kitty Meeks, Dominik K. Vu:
Extremal properties of flood-filling games. CoRR abs/1504.00596 (2015) - [i10]Jessica A. Enright, Kitty Meeks:
Deleting edges to restrict the size of an epidemic. CoRR abs/1504.05773 (2015) - [i9]Kitty Meeks:
Randomised enumeration of small witnesses using a decision oracle. CoRR abs/1509.05572 (2015) - 2014
- [j3]Kitty Meeks, Alexander Scott:
Spanning Trees and the Complexity of Flood-Filling Games. Theory Comput. Syst. 54(4): 731-753 (2014) - [i8]Kitty Meeks:
The challenges of unbounded treewidth in parameterised subgraph counting problems. CoRR abs/1402.5857 (2014) - [i7]Mark Jerrum, Kitty Meeks:
The parameterised complexity of counting even and odd induced subgraphs. CoRR abs/1410.3375 (2014) - 2013
- [j2]Kitty Meeks, Alexander Scott:
The complexity of Free-Flood-It on 2×n boards. Theor. Comput. Sci. 500: 25-43 (2013) - [i6]Mark Jerrum, Kitty Meeks:
The Parameterised Complexity of Counting Connected Subgraphs. CoRR abs/1308.1575 (2013) - [i5]Mark Jerrum, Kitty Meeks:
Some hard classes of parameterised counting problems. CoRR abs/1310.6524 (2013) - 2012
- [b1]Kitty Meeks:
Graph colourings and games. University of Oxford, UK, 2012 - [j1]Kitty Meeks, Alexander Scott:
The complexity of flood-filling games on graphs. Discret. Appl. Math. 160(7-8): 959-969 (2012) - [c1]Kitty Meeks, Alexander Scott:
Spanning Trees and the Complexity of Flood-Filling Games. FUN 2012: 282-292 - [i4]Kitty Meeks, Alexander Scott:
Spanning trees and the complexity of flood-filling games. CoRR abs/1203.2538 (2012) - 2011
- [i3]Kitty Meeks, Alexander Scott:
The complexity of Free-Flood-It on 2xn boards. CoRR abs/1101.5518 (2011) - [i2]Kitty Meeks, Alexander Scott:
The complexity of flood-filling games on graphs. CoRR abs/1101.5876 (2011) - [i1]Kitty Meeks, Alexander Scott:
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth. CoRR abs/1110.4077 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
