Browse by Research Project Code

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0

Pettersson, W. and Sylvester, J. (2023) Bounds on the twin-width of product graphs. Discrete Mathematics and Theoretical Computer Science, 25(1), 18. (doi: 10.46298/dmtcs.10091)

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)

Pettersson, W. (2022) kep_solver: a Python package for kidney exchange programme exploration. Journal of Open Source Software, 7(80), 4881. (doi: 10.21105/joss.04881)

Mitchell, S. N. et al. (2022) FAIR Data Pipeline: provenance-driven data management for traceable scientific workflows. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 380(2233), 20210300. (doi: 10.1098/rsta.2021.0300) (PMID:35965468) (PMCID:PMC9376726)

Kiwi, M., Schepers, M. and Sylvester, J. (2022) Cover and Hitting Times of Hyperbolic Random Graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), 19-21 September 2022, 30:1-30:19. (doi: 10.4230/LIPIcs.APPROX/RANDOM.2022.30)

Sylvester, J. (2022) The cover time of a (multiple) Markov chain with rational transition probabilities is rational. Statistics and Probability Letters, 187, 109534. (doi: 10.1016/j.spl.2022.109534)

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)

Los, D., Sauerwald, T. and Sylvester, J. (2022) Balanced Allocations: Caching and Packing, Twinning and Thinning. In: 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 09-12 Jan 2022, pp. 1847-1874. ISBN 9781611977073 (doi: 10.1137/1.9781611977073.74)

Enright, J. et al. (2021) SARS-CoV-2 infection in UK university students: lessons from September-December 2020 and modelling insights for future student return. Royal Society Open Science, 8(8), 210310. (doi: 10.1098/rsos.210310) (PMID:34386249) (PMCID:PMC8334840)

Rivera, N., Sauerwald, T. and Sylvester, J. (2021) Multiple Random Walks on Graphs: Mixing Few to Cover Many. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), 12-16 Jul 2021, p. 107. ISBN 9783959771955 (doi: 10.4230/LIPICS.ICALP.2021.107)

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)

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)

This list was generated on Sun Mar 3 19:24:09 2024 GMT.