Number of items: 44.
2024
Bocci, C., Capresi, C., Meeks, K. and Sylvester, J.
(2024)
A new temporal interpretation of cluster editing.
Journal of Computer and System Sciences, 144,
103551.
(doi: 10.1016/j.jcss.2024.103551)
Enright, J. , Lee, D. , Meeks, K. , Sylvester, J. and Pettersson, W.
(2024)
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation.
Algorithmica,
(Accepted for Publication)
Enright, J. , Hand, S. D., Larios-Jones, L. and Meeks, K.
(2024)
Structural Parameters for Dense Temporal Graphs.
In: 49th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26-30 Aug 2024,
(Accepted for Publication)
Dell, H., Lapinskas, J. and Meeks, K.
(2024)
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs.
In: 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2024), Tallinn, Estonia, 8-13 July 2024,
(Accepted for Publication)
Bressan, M., Goldberg, L. A., Meeks, K. and Roth, M.
(2024)
Counting subgraphs in somewhere dense graphs.
SIAM Journal on Computing,
(Accepted for Publication)
2023
Enright, J. , Meeks, K. , Pettersson, W. and Sylvester, J.
(2023)
Cops and robbers on multi-layer graphs.
In:
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 (14093).
Springer: Cham.
ISBN 9783031433795
(Accepted for Publication)
Enright, J. , Meeks, K. and Molter, H.
(2023)
Counting Temporal Paths.
In: 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), Hamburg, Germany, 07-10 Mar 2023,
p. 30.
(doi: 10.4230/LIPIcs.STACS.2023.30)
Bumpus, B. M. and Meeks, K.
(2023)
Edge exploration of temporal graphs.
Algorithmica, 85(3),
pp. 688-716.
(doi: 10.1007/s00453-022-01018-7)
Bressan, M., Goldberg, L. A., Meeks, K. and Roth, M.
(2023)
Counting Subgraphs in Somewhere Dense Graphs.
In: 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Cambridge, Massachusetts, USA, 10-13 January 2023,
ISBN 9783959772631
2022
Groenland, C., Johnston, T., Kupavskii, A., Meeks, K. , Scott, A. and Tan, J.
(2022)
Reconstructing the degree sequence of a sparse graph from a partial deck.
Journal of Combinatorial Theory, Series B, 157,
pp. 283-293.
(doi: 10.1016/j.jctb.2022.07.004)
Meeks, K.
(2022)
Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes.
In: Computability in Europe: Revolutions and Revelations in Computability (CiE 2022), Swansea, UK, 11-15 Jul 2022,
pp. 186-195.
ISBN 9783031087394
(doi: 10.1007/978-3-031-08740-0_16)
Bocci, C., Capresi, C., Meeks, K. and Sylvester, J.
(2022)
A New Temporal Interpretation of Cluster Editing.
In: 33rd International Workshop in Combinatorial Algorithms (IWOCA 2022), Trier, Germany, 07-09 Jun 2022,
ISBN 9783031066771
(doi: 10.1007/978-3-031-06678-8_16)
Hand, S. D., Enright, J. and Meeks, K.
(2022)
Making Life More Confusing for Firefighters.
In: 11th International Conference on Fun with Algorithms (FUN 2022), Sicily, Italy, 30 May - 03 Jun 2022,
ISBN 9783959772327
(doi: 10.4230/LIPIcs.FUN.2022.15)
Dell, H., Lapinskas, J. and Meeks, K.
(2022)
Approximately counting and sampling small witnesses using a colourful decision oracle.
SIAM Journal on Computing, 51(4),
pp. 849-899.
(doi: 10.1137/19M130604X)
2021
Enright, J. , Meeks, K. , Mertzios, G. B. and Zamaraev, V.
(2021)
Deleting edges to restrict the size of an epidemic in temporal networks.
Journal of Computer and System Sciences, 119,
pp. 60-77.
(doi: 10.1016/j.jcss.2021.01.007)
Lee, D. , Meeks, K. and Pettersson, W.
(2021)
Improved inference for areal unit count data using graph-based optimisation.
Statistics and Computing, 31(4),
51.
(doi: 10.1007/s11222-021-10025-7)
Bumpus, B. M. and Meeks, K.
(2021)
Edge exploration of temporal graphs.
In: 32nd International Workshop on Combinatorial Algorithms (IWOCA 2021), 05-07 Jul 2021,
pp. 107-121.
ISBN 9783030799861
(doi: 10.1007/978-3-030-79987-8_8)
Bonamy, M. and Meeks, K.
(2021)
The interactive sum choice number of graphs.
Discrete Applied Mathematics, 292,
pp. 72-84.
(doi: 10.1016/j.dam.2021.01.003)
Enright, J. , Meeks, K. and Skerman, F.
(2021)
Assigning times to minimise reachability in temporal graphs.
Journal of Computer and System Sciences, 115,
pp. 169-186.
(doi: 10.1016/j.jcss.2020.08.001)
Enright, J. , Lee, D. , Meeks, K. , Pettersson, W. and Sylvester, J.
(2021)
The complexity of finding optimal subgraphs to represent spatial correlation.
In: Du, D.-Z., Du, D., Wu, C. and Xu, D. (eds.)
Combinatorial Optimization and Applications.
Series: Lecture Notes in Computer Science (13135).
Springer, pp. 152-166.
ISBN 9783030926809
(doi: 10.1007/978-3-030-92681-6_13)
2020
Meeks, K. and Rastegari, B.
(2020)
Solving hard stable matching problems involving groups of similar agents.
Theoretical Computer Science, 844,
pp. 171-194.
(doi: 10.1016/j.tcs.2020.08.017)
Meeks, K. and Skerman, F.
(2020)
The parameterised complexity of computing the maximum modularity of a graph.
Algorithmica, 82,
pp. 2174-2199.
(doi: 10.1007/s00453-019-00649-7)
Dell, H., Lapinskas, J. and Meeks, K.
(2020)
Approximately Counting and Sampling Small Witnesses Using a Colourful Decision Oracle.
In: ACM-SIAM Symposium on Discrete Algorithms (SODA20), Salt Lake City, Utah, USA, 5-8 Jan 2020,
pp. 2201-2211.
(doi: 10.5555/3381089.3381224)
2019
Meeks, K. and Vu, D. K.
(2019)
Extremal properties of flood-filling games.
Discrete Mathematics and Theoretical Computer Science, 21(4),
12.
(doi: 10.23638/DMTCS-21-4-11)
Meeks, K.
(2019)
Randomised enumeration of small witnesses using a decision oracle.
Algorithmica, 81(2),
pp. 519-540.
(doi: 10.1007/s00453-018-0404-y)
Blasius, T., Friedrich, T., Lischeid, J., Meeks, K. and Schirneck, M.
(2019)
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling.
In: 21st Workshop on Algorithm Engineering and Experiments (ALENEX 2019), San Diego, CA, USA, 7-8 Jan 2019,
ISBN 9781611975499
(doi: 10.1137/1.9781611975499.11)
Enright, J. , Meeks, K. , Mertzios, G. B. and Zamaraev, V.
(2019)
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks.
In: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, 26-30 Aug 2019,
p. 57.
ISBN 9783959771177
(doi: 10.4230/LIPIcs.MFCS.2019.57)
2018
Meeks, K. and Rastegari, B.
(2018)
Stable Marriage with Groups of Similar Agents.
In: WINE 2018: The 14th Conference on Web and Internet Economics, Oxford, United Kingdom, 15-17 Dec 2018,
pp. 312-326.
ISBN 9783030046118
(doi: 10.1007/978-3-030-04612-5_21)
Wong, M. and Meeks, K.
(2018)
Inequalities, Gender and Online/Offline Networks.
Researching Youth and Inequality in the Digital Age Mini-Symposium, Glasgow, UK, 27 Jul 2018.
Meeks, K. and Treglown, A.
(2018)
On the complexity of finding and counting solution-free sets of integers.
Discrete Applied Mathematics, 243,
pp. 219-238.
(doi: 10.1016/j.dam.2018.02.008)
Enright, J. and Meeks, K.
(2018)
Deleting edges to restrict the size of an epidemic: a new application for treewidth.
Algorithmica, 80(6),
pp. 1857-1889.
(doi: 10.1007/s00453-017-0311-7)
Meeks, K. and Skerman, F.
(2018)
The Parameterised Complexity of Computing the Maximum Modularity of a Graph.
In: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Helsinki, Finland, 22-24 Aug 2018,
ISBN 9783959770842
(doi: 10.4230/LIPIcs.IPEC.2018.9)
2017
Jerrum, M. and Meeks, K.
(2017)
The parameterised complexity of counting even and odd induced subgraphs.
Combinatorica, 37(5),
pp. 965-990.
(doi: 10.1007/s00493-016-3338-5)
Bonamy, M. and Meeks, K.
(2017)
The interactive sum choice number of graphs.
Electronic Notes in Discrete Mathematics, 61,
pp. 139-145.
(doi: 10.1016/j.endm.2017.06.031)
2016
Meeks, K. and Scott, A.
(2016)
The parameterised complexity of list problems on graphs of bounded treewidth.
Information and Computation, 251,
pp. 91-103.
(doi: 10.1016/j.ic.2016.08.001)
Meeks, K.
(2016)
Randomised Enumeration of Small Witnesses Using a Decision Oracle.
In: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), Aarhus, Denmark, 24-26 Aug 2016,
ISBN 9783959770231
(doi: 10.4230/LIPIcs.IPEC.2016.22)
Meeks, K.
(2016)
The challenges of unbounded treewidth in parameterised subgraph counting problems.
Discrete Applied Mathematics, 198,
pp. 170-194.
(doi: 10.1016/j.dam.2015.06.019)
2015
Jerrum, M. and Meeks, K.
(2015)
Some hard families of parameterised counting problems.
ACM Transactions on Computation Theory, 7(3),
11.
(doi: 10.1145/2786017)
Jerrum, M. and Meeks, K.
(2015)
The parameterised complexity of counting connected subgraphs and graph motifs.
Journal of Computer and System Sciences, 81(4),
pp. 702-716.
(doi: 10.1016/j.jcss.2014.11.015)
Enright, J. and Meeks, K.
(2015)
Deleting Edges to Restrict the Size of an
Epidemic: A New Application for Treewidth.
In: 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA'15), Houston,TX, USA, 18-20 Dec 2015,
pp. 574-585.
ISBN 9783319266268
(doi: 10.1007/978-3-319-26626-8_42)
2014
Meeks, K. and Scott, A.
(2014)
Spanning trees and the complexity of flood-filling games.
Theory of Computing Systems, 54(4),
pp. 731-753.
(doi: 10.1007/s00224-013-9482-z)
2013
Meeks, K. and Scott, A.
(2013)
The complexity of FREE-FLOOD-IT on 2xn boards.
Theoretical Computer Science, 500,
pp. 25-43.
(doi: 10.1016/j.tcs.2013.06.010)
2012
Meeks, K. and Scott, A.
(2012)
The complexity of flood-filling games on graphs.
Discrete Applied Mathematics, 160(7-8),
pp. 959-969.
(doi: 10.1016/j.dam.2011.09.001)
Meeks, K. and Scott, A.
(2012)
Spanning Trees and the Complexity of Flood-Filling Games.
In: Sixth International Conference on Fun with Algorithms (FUN 2012), Venice, Italy, 04-06 Jun 2012,
pp. 282-292.
ISBN 9783642303463
(doi: 10.1007/978-3-642-30347-0_28)
This list was generated on Fri Aug 16 17:15:27 2024 BST.