default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Kitty Meeks
@article{DBLP:journals/jcss/BocciCMS24,
author = {Cristiano Bocci and
Chiara Capresi and
Kitty Meeks and
John Sylvester},
title = {A new temporal interpretation of cluster editing},
journal = {J. Comput. Syst. Sci.},
volume = {144},
pages = {103551},
year = {2024},
url = {https://doi.org/10.1016/j.jcss.2024.103551},
doi = {10.1016/J.JCSS.2024.103551},
timestamp = {Thu, 22 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BocciCMS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DellLM24,
author = {Holger Dell and
John Lapinskas and
Kitty Meeks},
editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
title = {Nearly Optimal Independence Oracle Algorithms for Edge Estimation
in Hypergraphs},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
series = {LIPIcs},
volume = {297},
pages = {54:1--54:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.54},
doi = {10.4230/LIPICS.ICALP.2024.54},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DellLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EnrightHLM24,
author = {Jessica A. Enright and
Samuel D. Hand and
Laura Larios{-}Jones and
Kitty Meeks},
editor = {Rastislav Kr{\'{a}}lovic and
Anton{\'{\i}}n Kucera},
title = {Structural Parameters for Dense Temporal Graphs},
booktitle = {49th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2024, August 26-30, 2024, Bratislava, Slovakia},
series = {LIPIcs},
volume = {306},
pages = {52:1--52:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2024.52},
doi = {10.4230/LIPICS.MFCS.2024.52},
timestamp = {Mon, 26 Aug 2024 16:40:52 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EnrightHLM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-03830,
author = {Jayakrishnan Madathil and
Kitty Meeks},
title = {Parameterized Algorithms for Balanced Cluster Edge Modification Problems},
journal = {CoRR},
volume = {abs/2403.03830},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.03830},
doi = {10.48550/ARXIV.2403.03830},
eprinttype = {arXiv},
eprint = {2403.03830},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-03830.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-19453,
author = {Jessica A. Enright and
Samuel D. Hand and
Laura Larios{-}Jones and
Kitty Meeks},
title = {Structural Parameters for Dense Temporal Graphs},
journal = {CoRR},
volume = {abs/2404.19453},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.19453},
doi = {10.48550/ARXIV.2404.19453},
eprinttype = {arXiv},
eprint = {2404.19453},
timestamp = {Mon, 27 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-19453.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-19479,
author = {Jessica A. Enright and
Laura Larios{-}Jones and
Kitty Meeks and
William Pettersson},
title = {Reachability in temporal graphs under perturbation},
journal = {CoRR},
volume = {abs/2404.19479},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.19479},
doi = {10.48550/ARXIV.2404.19479},
eprinttype = {arXiv},
eprint = {2404.19479},
timestamp = {Mon, 27 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-19479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BumpusM23,
author = {Benjamin Merlin Bumpus and
Kitty Meeks},
title = {Edge Exploration of Temporal Graphs},
journal = {Algorithmica},
volume = {85},
number = {3},
pages = {688--716},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01018-7},
doi = {10.1007/S00453-022-01018-7},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BumpusM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0002GMR23,
author = {Marco Bressan and
Leslie Ann Goldberg and
Kitty Meeks and
Marc Roth},
editor = {Yael Tauman Kalai},
title = {Counting Subgraphs in Somewhere Dense Graphs},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {27:1--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.27},
doi = {10.4230/LIPICS.ITCS.2023.27},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0002GMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EnrightMM23,
author = {Jessica A. Enright and
Kitty Meeks and
Hendrik Molter},
editor = {Petra Berenbrink and
Patricia Bouyer and
Anuj Dawar and
Mamadou Moustapha Kant{\'{e}}},
title = {Counting Temporal Paths},
booktitle = {40th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2023, March 7-9, 2023, Hamburg, Germany},
series = {LIPIcs},
volume = {254},
pages = {30:1--30:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.STACS.2023.30},
doi = {10.4230/LIPICS.STACS.2023.30},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EnrightMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/EnrightMPS23,
author = {Jessica A. Enright and
Kitty Meeks and
William Pettersson and
John Sylvester},
editor = {Dani{\"{e}}l Paulusma and
Bernard Ries},
title = {Cops and Robbers on Multi-Layer Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 49th International
Workshop, {WG} 2023, Fribourg, Switzerland, June 28-30, 2023, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {14093},
pages = {319--333},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43380-1\_23},
doi = {10.1007/978-3-031-43380-1\_23},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/EnrightMPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-03962,
author = {Jessica A. Enright and
Kitty Meeks and
William Pettersson and
John Sylvester},
title = {Cops and Robbers on Multi-Layer Graphs},
journal = {CoRR},
volume = {abs/2303.03962},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.03962},
doi = {10.48550/ARXIV.2303.03962},
eprinttype = {arXiv},
eprint = {2303.03962},
timestamp = {Thu, 16 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-03962.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BlasiusFLMS22,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Julius Lischeid and
Kitty Meeks and
Martin Schirneck},
title = {Efficiently enumerating hitting sets of hypergraphs arising in data
profiling},
journal = {J. Comput. Syst. Sci.},
volume = {124},
pages = {192--213},
year = {2022},
url = {https://doi.org/10.1016/j.jcss.2021.10.002},
doi = {10.1016/J.JCSS.2021.10.002},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BlasiusFLMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GroenlandJKMST22,
author = {Carla Groenland and
Tom Johnston and
Andrey Kupavskii and
Kitty Meeks and
Alex D. Scott and
Jane Tan},
title = {Reconstructing the degree sequence of a sparse graph from a partial
deck},
journal = {J. Comb. Theory {B}},
volume = {157},
pages = {283--293},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2022.07.004},
doi = {10.1016/J.JCTB.2022.07.004},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/GroenlandJKMST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DellLM22,
author = {Holger Dell and
John Lapinskas and
Kitty Meeks},
title = {Approximately Counting and Sampling Small Witnesses Using a Colorful
Decision Oracle},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {4},
pages = {849--899},
year = {2022},
url = {https://doi.org/10.1137/19m130604x},
doi = {10.1137/19M130604X},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DellLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Meeks22,
author = {Kitty Meeks},
editor = {Ulrich Berger and
Johanna N. Y. Franklin and
Florin Manea and
Arno Pauly},
title = {Reducing Reachability in Temporal Graphs: Towards a More Realistic
Model of Real-World Spreading Processes},
booktitle = {Revolutions and Revelations in Computability - 18th Conference on
Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13359},
pages = {186--195},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-08740-0\_16},
doi = {10.1007/978-3-031-08740-0\_16},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/Meeks22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/HandEM22,
author = {Samuel D. Hand and
Jessica A. Enright and
Kitty Meeks},
editor = {Pierre Fraigniaud and
Yushi Uno},
title = {Making Life More Confusing for Firefighters},
booktitle = {11th International Conference on Fun with Algorithms, {FUN} 2022,
May 30 to June 3, 2022, Island of Favignana, Sicily, Italy},
series = {LIPIcs},
volume = {226},
pages = {15:1--15:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FUN.2022.15},
doi = {10.4230/LIPICS.FUN.2022.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/HandEM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BocciCMS22,
author = {Cristiano Bocci and
Chiara Capresi and
Kitty Meeks and
John Sylvester},
editor = {Cristina Bazgan and
Henning Fernau},
title = {A New Temporal Interpretation of Cluster Editing},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {214--227},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_16},
doi = {10.1007/978-3-031-06678-8\_16},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BocciCMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sand/HandEM22,
author = {Samuel D. Hand and
Jessica A. Enright and
Kitty Meeks},
editor = {James Aspnes and
Othon Michail},
title = {Brief Announcement: The Temporal Firefighter Problem},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks, {SAND}
2022, March 28-30, 2022, Virtual Conference},
series = {LIPIcs},
volume = {221},
pages = {22:1--22:3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAND.2022.22},
doi = {10.4230/LIPICS.SAND.2022.22},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sand/HandEM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-01103,
author = {Cristiano Bocci and
Chiara Capresi and
Kitty Meeks and
John Sylvester},
title = {A New Temporal Interpretation of Cluster Editing},
journal = {CoRR},
volume = {abs/2202.01103},
year = {2022},
url = {https://arxiv.org/abs/2202.01103},
eprinttype = {arXiv},
eprint = {2202.01103},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-01103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-12055,
author = {Jessica A. Enright and
Kitty Meeks and
Hendrik Molter},
title = {Counting Temporal Paths},
journal = {CoRR},
volume = {abs/2202.12055},
year = {2022},
url = {https://arxiv.org/abs/2202.12055},
eprinttype = {arXiv},
eprint = {2202.12055},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-12055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-12599,
author = {Samuel D. Hand and
Jessica A. Enright and
Kitty Meeks},
title = {Making Life More Confusing for Firefighters},
journal = {CoRR},
volume = {abs/2202.12599},
year = {2022},
url = {https://arxiv.org/abs/2202.12599},
eprinttype = {arXiv},
eprint = {2202.12599},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-12599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-03402,
author = {Marco Bressan and
Leslie Ann Goldberg and
Kitty Meeks and
Marc Roth},
title = {Counting Subgraphs in Somewhere Dense Graphs},
journal = {CoRR},
volume = {abs/2209.03402},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.03402},
doi = {10.48550/ARXIV.2209.03402},
eprinttype = {arXiv},
eprint = {2209.03402},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-03402.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03874,
author = {Holger Dell and
John Lapinskas and
Kitty Meeks},
title = {Nearly optimal independence oracle algorithms for edge estimation
in hypergraphs},
journal = {CoRR},
volume = {abs/2211.03874},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03874},
doi = {10.48550/ARXIV.2211.03874},
eprinttype = {arXiv},
eprint = {2211.03874},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03874.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BonamyM21,
author = {Marthe Bonamy and
Kitty Meeks},
title = {The interactive sum choice number of graphs},
journal = {Discret. Appl. Math.},
volume = {292},
pages = {72--84},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.01.003},
doi = {10.1016/J.DAM.2021.01.003},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BonamyM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EnrightMS21,
author = {Jessica A. Enright and
Kitty Meeks and
Fiona Skerman},
title = {Assigning times to minimise reachability in temporal graphs},
journal = {J. Comput. Syst. Sci.},
volume = {115},
pages = {169--186},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2020.08.001},
doi = {10.1016/J.JCSS.2020.08.001},
timestamp = {Fri, 14 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/EnrightMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/EnrightMMZ21,
author = {Jessica A. Enright and
Kitty Meeks and
George B. Mertzios and
Viktor Zamaraev},
title = {Deleting edges to restrict the size of an epidemic in temporal networks},
journal = {J. Comput. Syst. Sci.},
volume = {119},
pages = {60--77},
year = {2021},
url = {https://doi.org/10.1016/j.jcss.2021.01.007},
doi = {10.1016/J.JCSS.2021.01.007},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/EnrightMMZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sac/LeeMP21,
author = {Duncan Lee and
Kitty Meeks and
William Pettersson},
title = {Improved inference for areal unit count data using graph-based optimisation},
journal = {Stat. Comput.},
volume = {31},
number = {4},
pages = {51},
year = {2021},
url = {https://doi.org/10.1007/s11222-021-10025-7},
doi = {10.1007/S11222-021-10025-7},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sac/LeeMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/EnrightLMPS21,
author = {Jessica A. Enright and
Duncan Lee and
Kitty Meeks and
William Pettersson and
John Sylvester},
editor = {Ding{-}Zhu Du and
Donglei Du and
Chenchen Wu and
Dachuan Xu},
title = {The Complexity of Finding Optimal Subgraphs to Represent Spatial Correlation},
booktitle = {Combinatorial Optimization and Applications - 15th International Conference,
{COCOA} 2021, Tianjin, China, December 17-19, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13135},
pages = {152--166},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-92681-6\_13},
doi = {10.1007/978-3-030-92681-6\_13},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/EnrightLMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BumpusM21,
author = {Benjamin Merlin Bumpus and
Kitty Meeks},
editor = {Paola Flocchini and
Lucia Moura},
title = {Edge Exploration of Temporal Graphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {107--121},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_8},
doi = {10.1007/978-3-030-79987-8\_8},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BumpusM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-05387,
author = {Benjamin Merlin Bumpus and
Kitty Meeks},
title = {Edge exploration of temporal graphs},
journal = {CoRR},
volume = {abs/2103.05387},
year = {2021},
url = {https://arxiv.org/abs/2103.05387},
eprinttype = {arXiv},
eprint = {2103.05387},
timestamp = {Mon, 15 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-05387.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-04786,
author = {Jessica A. Enright and
Kitty Meeks and
William Pettersson and
John Sylvester},
title = {Tangled Paths: {A} Random Graph Model from Mallows Permutations},
journal = {CoRR},
volume = {abs/2108.04786},
year = {2021},
url = {https://arxiv.org/abs/2108.04786},
eprinttype = {arXiv},
eprint = {2108.04786},
timestamp = {Tue, 19 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-04786.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/CasteigtsMMN21,
author = {Arnaud Casteigts and
Kitty Meeks and
George B. Mertzios and
Rolf Niedermeier},
title = {Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar
21171)},
journal = {Dagstuhl Reports},
volume = {11},
number = {3},
pages = {16--46},
year = {2021},
url = {https://doi.org/10.4230/DagRep.11.3.16},
doi = {10.4230/DAGREP.11.3.16},
timestamp = {Wed, 08 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/CasteigtsMMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MeeksS20,
author = {Kitty Meeks and
Fiona Skerman},
title = {The Parameterised Complexity of Computing the Maximum Modularity of
a Graph},
journal = {Algorithmica},
volume = {82},
number = {8},
pages = {2174--2199},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00649-7},
doi = {10.1007/S00453-019-00649-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MeeksS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MeeksR20,
author = {Kitty Meeks and
Baharak Rastegari},
title = {Solving hard stable matching problems involving groups of similar
agents},
journal = {Theor. Comput. Sci.},
volume = {844},
pages = {171--194},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.08.017},
doi = {10.1016/J.TCS.2020.08.017},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MeeksR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DellLM20,
author = {Holger Dell and
John Lapinskas and
Kitty Meeks},
editor = {Shuchi Chawla},
title = {Approximately counting and sampling small witnesses using a colourful
decision oracle},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {2201--2211},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.135},
doi = {10.1137/1.9781611975994.135},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/DellLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-08903,
author = {Benjamin Merlin Bumpus and
Kitty Meeks and
William Pettersson},
title = {Directed branch-width: {A} directed analogue of tree-width},
journal = {CoRR},
volume = {abs/2009.08903},
year = {2020},
url = {https://arxiv.org/abs/2009.08903},
eprinttype = {arXiv},
eprint = {2009.08903},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-08903.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-10314,
author = {Duncan Lee and
Kitty Meeks},
title = {On the complexity of optimally modifying graphs representing spatial
correlation in areal unit count data},
journal = {CoRR},
volume = {abs/2010.10314},
year = {2020},
url = {https://arxiv.org/abs/2010.10314},
eprinttype = {arXiv},
eprint = {2010.10314},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-10314.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Meeks19,
author = {Kitty Meeks},
title = {Randomised Enumeration of Small Witnesses Using a Decision Oracle},
journal = {Algorithmica},
volume = {81},
number = {2},
pages = {519--540},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0404-y},
doi = {10.1007/S00453-018-0404-Y},
timestamp = {Tue, 20 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Meeks19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/MeeksV19,
author = {Kitty Meeks and
Dominik K. Vu},
title = {Extremal properties of flood-filling games},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {21},
number = {4},
year = {2019},
url = {https://doi.org/10.23638/DMTCS-21-4-11},
doi = {10.23638/DMTCS-21-4-11},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/MeeksV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Blasius0LMS19,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Julius Lischeid and
Kitty Meeks and
Martin Schirneck},
editor = {Stephen G. Kobourov and
Henning Meyerhenke},
title = {Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data
Profiling},
booktitle = {Proceedings of the Twenty-First Workshop on Algorithm Engineering
and Experiments, {ALENEX} 2019, San Diego, CA, USA, January 7-8, 2019},
pages = {130--143},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975499.11},
doi = {10.1137/1.9781611975499.11},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/Blasius0LMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EnrightMMZ19,
author = {Jessica A. Enright and
Kitty Meeks and
George B. Mertzios and
Viktor Zamaraev},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {57:1--57:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.57},
doi = {10.4230/LIPICS.MFCS.2019.57},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EnrightMMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04826,
author = {Holger Dell and
John Lapinskas and
Kitty Meeks},
title = {Approximately counting and sampling small witnesses using a colourful
decision oracle},
journal = {CoRR},
volume = {abs/1907.04826},
year = {2019},
url = {http://arxiv.org/abs/1907.04826},
eprinttype = {arXiv},
eprint = {1907.04826},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04826.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EnrightM18,
author = {Jessica A. Enright and
Kitty Meeks},
title = {Deleting Edges to Restrict the Size of an Epidemic: {A} New Application
for Treewidth},
journal = {Algorithmica},
volume = {80},
number = {6},
pages = {1857--1889},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0311-7},
doi = {10.1007/S00453-017-0311-7},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EnrightM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MeeksT18,
author = {Kitty Meeks and
Andrew Treglown},
title = {On the complexity of finding and counting solution-free sets of integers},
journal = {Discret. Appl. Math.},
volume = {243},
pages = {219--238},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.02.008},
doi = {10.1016/J.DAM.2018.02.008},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MeeksT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MeeksS18,
author = {Kitty Meeks and
Fiona Skerman},
editor = {Christophe Paul and
Michal Pilipczuk},
title = {The Parameterised Complexity of Computing the Maximum Modularity of
a Graph},
booktitle = {13th International Symposium on Parameterized and Exact Computation,
{IPEC} 2018, August 20-24, 2018, Helsinki, Finland},
series = {LIPIcs},
volume = {115},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.9},
doi = {10.4230/LIPICS.IPEC.2018.9},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/MeeksS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/MeeksR18,
author = {Kitty Meeks and
Baharak Rastegari},
editor = {George Christodoulou and
Tobias Harks},
title = {Stable Marriage with Groups of Similar Agents},
booktitle = {Web and Internet Economics - 14th International Conference, {WINE}
2018, Oxford, UK, December 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11316},
pages = {312--326},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04612-5\_21},
doi = {10.1007/978-3-030-04612-5\_21},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/MeeksR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05905,
author = {Jessica A. Enright and
Kitty Meeks},
title = {Changing times to optimise reachability in temporal graphs},
journal = {CoRR},
volume = {abs/1802.05905},
year = {2018},
url = {http://arxiv.org/abs/1802.05905},
eprinttype = {arXiv},
eprint = {1802.05905},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-05905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-01310,
author = {Thomas Bl{\"{a}}sius and
Tobias Friedrich and
Kitty Meeks and
Martin Schirneck},
title = {On the Enumeration of Minimal Hitting Sets in Lexicographical Order},
journal = {CoRR},
volume = {abs/1805.01310},
year = {2018},
url = {http://arxiv.org/abs/1805.01310},
eprinttype = {arXiv},
eprint = {1805.01310},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-01310.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-06836,
author = {Jessica A. Enright and
Kitty Meeks and
George B. Mertzios and
Viktor Zamaraev},
title = {Deleting edges to restrict the size of an epidemic in temporal networks},
journal = {CoRR},
volume = {abs/1805.06836},
year = {2018},
url = {http://arxiv.org/abs/1805.06836},
eprinttype = {arXiv},
eprint = {1805.06836},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-06836.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06965,
author = {Kitty Meeks and
Fiona Skerman},
title = {The parameterised complexity of computing the maximum modularity of
a graph},
journal = {CoRR},
volume = {abs/1807.06965},
year = {2018},
url = {http://arxiv.org/abs/1807.06965},
eprinttype = {arXiv},
eprint = {1807.06965},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06965.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JerrumM17,
author = {Mark Jerrum and
Kitty Meeks},
title = {The parameterised complexity of counting even and odd induced subgraphs},
journal = {Comb.},
volume = {37},
number = {5},
pages = {965--990},
year = {2017},
url = {https://doi.org/10.1007/s00493-016-3338-5},
doi = {10.1007/S00493-016-3338-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JerrumM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BonamyM17,
author = {Marthe Bonamy and
Kitty Meeks},
title = {The Interactive Sum Choice Number of Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {139--145},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.031},
doi = {10.1016/J.ENDM.2017.06.031},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BonamyM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bcc/ClaessonDKMM17,
author = {Anders Claesson and
Mark Dukes and
Sergey Kitaev and
David F. Manlove and
Kitty Meeks},
editor = {Anders Claesson and
Mark Dukes and
Sergey Kitaev and
David F. Manlove and
Kitty Meeks},
title = {Preface},
booktitle = {Surveys in Combinatorics, 2017: Invited lectures from the 26th British
Combinatorial Conference, Strathclyde, Glasgow, UK, July 3-7, 2017},
pages = {vii--viii},
publisher = {Cambridge University Press},
year = {2017},
url = {https://doi.org/10.1017/9781108332699.001},
doi = {10.1017/9781108332699.001},
timestamp = {Mon, 10 Jan 2022 15:48:19 +0100},
biburl = {https://dblp.org/rec/conf/bcc/ClaessonDKMM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/bcc/2017,
editor = {Anders Claesson and
Mark Dukes and
Sergey Kitaev and
David F. Manlove and
Kitty Meeks},
title = {Surveys in Combinatorics, 2017: Invited lectures from the 26th British
Combinatorial Conference, Strathclyde, Glasgow, UK, July 3-7, 2017},
publisher = {Cambridge University Press},
year = {2017},
isbn = {978-1-108-41313-8},
timestamp = {Mon, 10 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bcc/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonamyM17,
author = {Marthe Bonamy and
Kitty Meeks},
title = {The Interactive Sum Choice Number of Graphs},
journal = {CoRR},
volume = {abs/1703.05380},
year = {2017},
url = {http://arxiv.org/abs/1703.05380},
eprinttype = {arXiv},
eprint = {1703.05380},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonamyM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MeeksT17,
author = {Kitty Meeks and
Andrew Treglown},
title = {On the complexity of finding and counting solution-free sets of integers},
journal = {CoRR},
volume = {abs/1704.03758},
year = {2017},
url = {http://arxiv.org/abs/1704.03758},
eprinttype = {arXiv},
eprint = {1704.03758},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MeeksT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04109,
author = {Kitty Meeks and
Baharak Rastegari},
title = {Solving Hard Stable Matching Problems Involving Groups of Similar
Agents},
journal = {CoRR},
volume = {abs/1708.04109},
year = {2017},
url = {http://arxiv.org/abs/1708.04109},
eprinttype = {arXiv},
eprint = {1708.04109},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-08758,
author = {Jessica A. Enright and
Kitty Meeks},
title = {Counting small subgraphs in multi-layer networks},
journal = {CoRR},
volume = {abs/1710.08758},
year = {2017},
url = {http://arxiv.org/abs/1710.08758},
eprinttype = {arXiv},
eprint = {1710.08758},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-08758.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Meeks16,
author = {Kitty Meeks},
title = {The challenges of unbounded treewidth in parameterised subgraph counting
problems},
journal = {Discret. Appl. Math.},
volume = {198},
pages = {170--194},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.06.019},
doi = {10.1016/J.DAM.2015.06.019},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Meeks16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/MeeksS16,
author = {Kitty Meeks and
Alexander Scott},
title = {The parameterised complexity of list problems on graphs of bounded
treewidth},
journal = {Inf. Comput.},
volume = {251},
pages = {91--103},
year = {2016},
url = {https://doi.org/10.1016/j.ic.2016.08.001},
doi = {10.1016/J.IC.2016.08.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/MeeksS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Meeks16,
author = {Kitty Meeks},
editor = {Jiong Guo and
Danny Hermelin},
title = {Randomised Enumeration of Small Witnesses Using a Decision Oracle},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {22:1--22:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.22},
doi = {10.4230/LIPICS.IPEC.2016.22},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/Meeks16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JerrumM15,
author = {Mark Jerrum and
Kitty Meeks},
title = {The parameterised complexity of counting connected subgraphs and graph
motifs},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {4},
pages = {702--716},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.11.015},
doi = {10.1016/J.JCSS.2014.11.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JerrumM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/JerrumM15,
author = {Mark Jerrum and
Kitty Meeks},
title = {Some Hard Families of Parameterized Counting Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {7},
number = {3},
pages = {11:1--11:18},
year = {2015},
url = {https://doi.org/10.1145/2786017},
doi = {10.1145/2786017},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/JerrumM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/EnrightM15,
author = {Jessica A. Enright and
Kitty Meeks},
editor = {Zaixin Lu and
Donghyun Kim and
Weili Wu and
Wei Li and
Ding{-}Zhu Du},
title = {Deleting Edges to Restrict the Size of an Epidemic: {A} New Application
for Treewidth},
booktitle = {Combinatorial Optimization and Applications - 9th International Conference,
{COCOA} 2015, Houston, TX, USA, December 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9486},
pages = {574--585},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-26626-8\_42},
doi = {10.1007/978-3-319-26626-8\_42},
timestamp = {Thu, 02 Dec 2021 16:45:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/EnrightM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MeeksV15,
author = {Kitty Meeks and
Dominik K. Vu},
title = {Extremal properties of flood-filling games},
journal = {CoRR},
volume = {abs/1504.00596},
year = {2015},
url = {http://arxiv.org/abs/1504.00596},
eprinttype = {arXiv},
eprint = {1504.00596},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MeeksV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EnrightM15,
author = {Jessica A. Enright and
Kitty Meeks},
title = {Deleting edges to restrict the size of an epidemic},
journal = {CoRR},
volume = {abs/1504.05773},
year = {2015},
url = {http://arxiv.org/abs/1504.05773},
eprinttype = {arXiv},
eprint = {1504.05773},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/EnrightM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Meeks15,
author = {Kitty Meeks},
title = {Randomised enumeration of small witnesses using a decision oracle},
journal = {CoRR},
volume = {abs/1509.05572},
year = {2015},
url = {http://arxiv.org/abs/1509.05572},
eprinttype = {arXiv},
eprint = {1509.05572},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Meeks15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MeeksS14,
author = {Kitty Meeks and
Alexander Scott},
title = {Spanning Trees and the Complexity of Flood-Filling Games},
journal = {Theory Comput. Syst.},
volume = {54},
number = {4},
pages = {731--753},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9482-z},
doi = {10.1007/S00224-013-9482-Z},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/MeeksS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Meeks14,
author = {Kitty Meeks},
title = {The challenges of unbounded treewidth in parameterised subgraph counting
problems},
journal = {CoRR},
volume = {abs/1402.5857},
year = {2014},
url = {http://arxiv.org/abs/1402.5857},
eprinttype = {arXiv},
eprint = {1402.5857},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Meeks14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JerrumM14,
author = {Mark Jerrum and
Kitty Meeks},
title = {The parameterised complexity of counting even and odd induced subgraphs},
journal = {CoRR},
volume = {abs/1410.3375},
year = {2014},
url = {http://arxiv.org/abs/1410.3375},
eprinttype = {arXiv},
eprint = {1410.3375},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JerrumM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MeeksS13,
author = {Kitty Meeks and
Alexander Scott},
title = {The complexity of Free-Flood-It on 2{\texttimes}n boards},
journal = {Theor. Comput. Sci.},
volume = {500},
pages = {25--43},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.06.010},
doi = {10.1016/J.TCS.2013.06.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MeeksS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JerrumM13,
author = {Mark Jerrum and
Kitty Meeks},
title = {The Parameterised Complexity of Counting Connected Subgraphs},
journal = {CoRR},
volume = {abs/1308.1575},
year = {2013},
url = {http://arxiv.org/abs/1308.1575},
eprinttype = {arXiv},
eprint = {1308.1575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JerrumM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JerrumM13a,
author = {Mark Jerrum and
Kitty Meeks},
title = {Some hard classes of parameterised counting problems},
journal = {CoRR},
volume = {abs/1310.6524},
year = {2013},
url = {http://arxiv.org/abs/1310.6524},
eprinttype = {arXiv},
eprint = {1310.6524},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JerrumM13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ethos/Meeks12,
author = {Kitty Meeks},
title = {Graph colourings and games},
school = {University of Oxford, {UK}},
year = {2012},
url = {http://ora.ox.ac.uk/objects/uuid:a805a379-f891-4250-9a7d-df109f9f52e2},
timestamp = {Tue, 05 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ethos/Meeks12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MeeksS12,
author = {Kitty Meeks and
Alexander Scott},
title = {The complexity of flood-filling games on graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {7-8},
pages = {959--969},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.09.001},
doi = {10.1016/J.DAM.2011.09.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MeeksS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/MeeksS12,
author = {Kitty Meeks and
Alexander Scott},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Spanning Trees and the Complexity of Flood-Filling Games},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {282--292},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_28},
doi = {10.1007/978-3-642-30347-0\_28},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fun/MeeksS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-2538,
author = {Kitty Meeks and
Alexander Scott},
title = {Spanning trees and the complexity of flood-filling games},
journal = {CoRR},
volume = {abs/1203.2538},
year = {2012},
url = {http://arxiv.org/abs/1203.2538},
eprinttype = {arXiv},
eprint = {1203.2538},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-2538.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-5518,
author = {Kitty Meeks and
Alexander Scott},
title = {The complexity of Free-Flood-It on 2xn boards},
journal = {CoRR},
volume = {abs/1101.5518},
year = {2011},
url = {http://arxiv.org/abs/1101.5518},
eprinttype = {arXiv},
eprint = {1101.5518},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-5518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-5876,
author = {Kitty Meeks and
Alexander Scott},
title = {The complexity of flood-filling games on graphs},
journal = {CoRR},
volume = {abs/1101.5876},
year = {2011},
url = {http://arxiv.org/abs/1101.5876},
eprinttype = {arXiv},
eprint = {1101.5876},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-5876.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4077,
author = {Kitty Meeks and
Alexander Scott},
title = {The Parameterised Complexity of List Problems on Graphs of Bounded
Treewidth},
journal = {CoRR},
volume = {abs/1110.4077},
year = {2011},
url = {http://arxiv.org/abs/1110.4077},
eprinttype = {arXiv},
eprint = {1110.4077},
timestamp = {Wed, 06 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-4077.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-08-27 22: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:
