Dr Jessica Enright

  • Lecturer (Computing Science)

Publications

List by: Type | Date

Jump to: 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2011 | 2008 | 2007
Number of items: 21.

2021

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)

2020

Barnetson, K. D., Burgess, A. C., Enright, J. , Howell, J., Pike, D. A. and Ryan, B. (2020) The firebreak problem. Networks and Heterogeneous Media, (doi: 10.1002/net.21975) (Early Online Publication)

2019

Enright, J. and Pergel, M. (2019) Recognising the overlap graphs of subtrees of restricted trees is hard. Acta Mathematica Universitatis Comenianae, 88(3), pp. 651-658.

Enright, J. and Kitaev, S. (2019) Polygon-circle and word-representable graphs. Electronic Notes in Discrete Mathematics, 71, pp. 3-8. (doi: 10.1016/j.endm.2019.02.001)

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

Enright, J. and Kao, R. R. (2018) Epidemics on dynamic networks. Epidemics, 24, pp. 88-97. (doi: 10.1016/j.epidem.2018.04.003) (PMID:29907403)

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)

Salvador, L.C.M. , Deason, M., Enright, J. , Bessell, R.R. and Kao, R.R. (2018) Risk-­based strategies for surveillance of bovine Tuberculosis infection in cattle for low risk areas in England and Scotland. Epidemiology and Infection, 146(1), pp. 107-118. (doi: 10.1017/S0950268817001935)

2017

Enright, J. and Stewart, L. (2017) Equivalence of the filament and overlap graphs of subtrees of limited trees. Discrete Mathematics and Theoretical Computer Science, 19(1), 20. (doi: 10.23638/DMTCS-19-1-20)

Enright, J.A. and O'Hare, A. (2017) Reconstructing disease transmission dynamics from animal movements and test data. Stochastic Environmental Research and Risk Assessment, 31(2), pp. 369-377. (doi: 10.1007/s00477-016-1354-z)

2016

Enright, J. and Kao, R. (2016) A fast algorithm for calculating an expected outbreak size on dynamic contagion networks. Epidemics, 16, pp. 56-62. (doi: 10.1016/j.epidem.2016.05.002) (PMID:27379615)

Enright, J. and Stewart, L. (2016) Games on interval and permutation graph representations. Theoretical Computer Science, 609(Part 1), pp. 87-103. (doi: 10.1016/j.tcs.2015.09.009)

Enright, J. and Faben, J. D. (2016) Building a Better Mouse Maze. In: 8th International Conference on Fun with Algorithms (FUN 2016), La Maddalena, Italy, 08-10 Jun 2016, 15:1-15:12. ISBN 9783959770057 (doi:10.4230/LIPIcs.FUN.2016.15)

Enright, J. and Kao, R. R. (2016) A descriptive analysis of the growth of unrecorded interactions amongst cattle-raising premises in Scotland and their implications for disease spread. BMC Veterinary Research, 12(1), (doi: 10.1186/s12917-016-0652-5) (PMID:26911436) (PMCID:PMC4766605)

2015

Enright, J. and Kao, R. R. (2015) A few bad apples: a model of disease influenced agent behaviour in a heterogeneous contact environment. PLoS ONE, 10(3), e0118127. (doi: 10.1371/journal.pone.0118127) (PMID:25734661) (PMCID:PMC4348343)

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

Enright, J. , Stewart, L. and Tardos, G. (2014) On list coloring and list homomorphism of permutation and interval graphs. SIAM Journal on Discrete Mathematics, 28(4), pp. 1675-1685. (doi: 10.1137/13090465X)

2011

Enright, J. and Kondrak, G. (2011) The Application of Chordal Graphs to Inferring Phylogenetic Trees of Languages. In: 5th International Joint Conference on Natural Language Processing, Chiang Mai, Thailand, 08-13 Nov 2011, pp. 545-552. ISBN 9789744665645

2008

Enright, J. and Rudnicki, P. (2008) Helly property for subtrees. Formalized Mathematics, 16(2), pp. 91-96. (doi: 10.2478/v10037-008-0013-3)

2007

Enright, J. and Stewart, L. (2007) Subtree filament graphs are subtree overlap graphs. Information Processing Letters, 104(6), pp. 228-232. (doi: 10.1016/j.ipl.2007.07.004)

Enright, J. and Kondrak, G. (2007) A Fast Method for Parallel Document Identification. In: Human Language Technologies 2007, Rochester, NY, USA, 22-27 Apr 2007, pp. 29-32.

This list was generated on Sat Oct 24 11:43:22 2020 BST.
Number of items: 21.

Articles

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)

Barnetson, K. D., Burgess, A. C., Enright, J. , Howell, J., Pike, D. A. and Ryan, B. (2020) The firebreak problem. Networks and Heterogeneous Media, (doi: 10.1002/net.21975) (Early Online Publication)

Enright, J. and Pergel, M. (2019) Recognising the overlap graphs of subtrees of restricted trees is hard. Acta Mathematica Universitatis Comenianae, 88(3), pp. 651-658.

Enright, J. and Kitaev, S. (2019) Polygon-circle and word-representable graphs. Electronic Notes in Discrete Mathematics, 71, pp. 3-8. (doi: 10.1016/j.endm.2019.02.001)

Enright, J. and Kao, R. R. (2018) Epidemics on dynamic networks. Epidemics, 24, pp. 88-97. (doi: 10.1016/j.epidem.2018.04.003) (PMID:29907403)

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)

Salvador, L.C.M. , Deason, M., Enright, J. , Bessell, R.R. and Kao, R.R. (2018) Risk-­based strategies for surveillance of bovine Tuberculosis infection in cattle for low risk areas in England and Scotland. Epidemiology and Infection, 146(1), pp. 107-118. (doi: 10.1017/S0950268817001935)

Enright, J. and Stewart, L. (2017) Equivalence of the filament and overlap graphs of subtrees of limited trees. Discrete Mathematics and Theoretical Computer Science, 19(1), 20. (doi: 10.23638/DMTCS-19-1-20)

Enright, J.A. and O'Hare, A. (2017) Reconstructing disease transmission dynamics from animal movements and test data. Stochastic Environmental Research and Risk Assessment, 31(2), pp. 369-377. (doi: 10.1007/s00477-016-1354-z)

Enright, J. and Kao, R. (2016) A fast algorithm for calculating an expected outbreak size on dynamic contagion networks. Epidemics, 16, pp. 56-62. (doi: 10.1016/j.epidem.2016.05.002) (PMID:27379615)

Enright, J. and Stewart, L. (2016) Games on interval and permutation graph representations. Theoretical Computer Science, 609(Part 1), pp. 87-103. (doi: 10.1016/j.tcs.2015.09.009)

Enright, J. and Kao, R. R. (2016) A descriptive analysis of the growth of unrecorded interactions amongst cattle-raising premises in Scotland and their implications for disease spread. BMC Veterinary Research, 12(1), (doi: 10.1186/s12917-016-0652-5) (PMID:26911436) (PMCID:PMC4766605)

Enright, J. and Kao, R. R. (2015) A few bad apples: a model of disease influenced agent behaviour in a heterogeneous contact environment. PLoS ONE, 10(3), e0118127. (doi: 10.1371/journal.pone.0118127) (PMID:25734661) (PMCID:PMC4348343)

Enright, J. , Stewart, L. and Tardos, G. (2014) On list coloring and list homomorphism of permutation and interval graphs. SIAM Journal on Discrete Mathematics, 28(4), pp. 1675-1685. (doi: 10.1137/13090465X)

Enright, J. and Rudnicki, P. (2008) Helly property for subtrees. Formalized Mathematics, 16(2), pp. 91-96. (doi: 10.2478/v10037-008-0013-3)

Enright, J. and Stewart, L. (2007) Subtree filament graphs are subtree overlap graphs. Information Processing Letters, 104(6), pp. 228-232. (doi: 10.1016/j.ipl.2007.07.004)

Conference Proceedings

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)

Enright, J. and Faben, J. D. (2016) Building a Better Mouse Maze. In: 8th International Conference on Fun with Algorithms (FUN 2016), La Maddalena, Italy, 08-10 Jun 2016, 15:1-15:12. ISBN 9783959770057 (doi:10.4230/LIPIcs.FUN.2016.15)

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)

Enright, J. and Kondrak, G. (2011) The Application of Chordal Graphs to Inferring Phylogenetic Trees of Languages. In: 5th International Joint Conference on Natural Language Processing, Chiang Mai, Thailand, 08-13 Nov 2011, pp. 545-552. ISBN 9789744665645

Enright, J. and Kondrak, G. (2007) A Fast Method for Parallel Document Identification. In: Human Language Technologies 2007, Rochester, NY, USA, 22-27 Apr 2007, pp. 29-32.

This list was generated on Sat Oct 24 11:43:22 2020 BST.

Supervision

  • Kelly, Ethan
    Game-theoretic and probabilistic methods applied to spatial network models of contagion