Dr Kitty Meeks

  • Research Fellow (Computing Science)

telephone: +44 (0)141 330 1631
email: Kitty.Meeks@glasgow.ac.uk

Publications

List by: Type | Date

Jump to: 2016 | 2015 | 2014 | 2013 | 2012
Number of items: 11.

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)

Jerrum, M., and Meeks, K. (2016) The parameterised complexity of counting even and odd induced subgraphs. Combinatorica, (doi:10.1007/s00493-016-3338-5) (Early Online Publication)

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, (Accepted for Publication)

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 Mon Mar 27 03:42:03 2017 BST.
Number of items: 11.

Articles

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)

Jerrum, M., and Meeks, K. (2016) The parameterised complexity of counting even and odd induced subgraphs. Combinatorica, (doi:10.1007/s00493-016-3338-5) (Early Online Publication)

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)

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)

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)

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)

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)

Conference Proceedings

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, (Accepted for Publication)

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)

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 Mon Mar 27 03:42:03 2017 BST.