Dr Kitty Meeks

  • Royal Society of Edinburgh Research Fellow (Computing Science)

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

Biography

I joined the University of Glasgow in 2014, as a Lecturer in the School of Mathematics and Statistics; I moved to the School of Computing Science in 2016, where I hold a Royal Society of Edinburgh Personal Research Fellowship.

I gained my MMath in Mathematics and Computer Science (2009) and DPhil in Mathematics (2013) from the University of Oxford, and from 2012 to 2014 I worked as a Postdoctoral Research Assistant at Queen Mary University of London.

Research interests

I am interested in using ideas from pure mathematics to address practical problems arising computer science, primarily in the area of algorithms and computational complexity. My mathematical background is mainly in graph theory, and my current research focusses on combinatorial algorithms and parameterised complexity.

I currently hold a Personal Research Fellowship from the Royal Society of Edinburgh, to work on the project Exploiting Realistic Graph Structure. The long-term goal of this work is to help bridge the gap between theory and practice in the design of network algorithms by developing our understanding of how structural properties of real datasets can help us to extract information from them more efficiently.

Grants

  • Royal Society of Edinburgh Personal Research Fellowship (funded by the Scottish Government): Exploiting Realistic Graph Structure, 2016-2021.

Supervision

Additional information

Personal site: http://www.dcs.gla.ac.uk/~kitty/

Publications

List by: Type | Date

Jump to: 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012
Number of items: 19.

2018

Blasius, T., Friedrich, T., Lischeid, J., Meeks, K. and Schirneck, M. (2018) Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. In: 21st Algorithm Engineering and Experiments (ALENEX 2019), San Diego, CA, USA, 7-8 Jan 2019, (Accepted for Publication)

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)

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

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. (2018) Randomised enumeration of small witnesses using a decision oracle. Algorithmica, (doi:10.1007/s00453-018-0404-y) (Early Online Publication)

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

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, (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 Sun Nov 18 15:16:31 2018 GMT.
Number of items: 19.

Articles

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. (2018) Randomised enumeration of small witnesses using a decision oracle. Algorithmica, (doi:10.1007/s00453-018-0404-y) (Early Online Publication)

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)

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) 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 or Workshop Item

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.

Conference Proceedings

Blasius, T., Friedrich, T., Lischeid, J., Meeks, K. and Schirneck, M. (2018) Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling. In: 21st Algorithm Engineering and Experiments (ALENEX 2019), San Diego, CA, USA, 7-8 Jan 2019, (Accepted for Publication)

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

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, (Accepted for 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, (doi:10.4230/LIPIcs.IPEC.2016.22)

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 Sun Nov 18 15:16:31 2018 GMT.