Seminars, Conference presentations etc.

Choose your own adventure in parameterised graph algorithms
27th British Combinatorial Conference, Birmingham, July 2019.

Algorithmic Aspects of Temporal Graphs II, ICALP Satelite Workshop, Patras, Greece, July 2019.

Reducing reachability in temporal graphs
School of Computing Research Colloquium, University of Leeds, June 2019.

From Decision to (Approximate) Counting
ALGO UK, Durham, April 2019.

Reducing reachability in temporal graphs
Algorithms and Complexity Theory Seminar, University of Oxford, February 2019.

Reducing reachability in temporal graphs
Pure Mathematics Seminar, Royal Holloway University of London, February 2019.

Reducing reachability in temporal graphs
Numerical Analysis and Scientific Computing Seminar, University of Strathclyde, November 2018.

Optimising the dissemination of information in dynamic networks
Social Network Analysis in Scotland Group Seminar, Glasgow, October 2018.

The parameterised complexity of computing the maximum modularity of a graph
IPEC 2018, Helsinki, August 2018.

Reducing reachability in temporal graphs
Algorithmic Aspects of Temporal Graphs, ICALP Satelite Workshop, Prague, July 2018.

Exploiting structure in multi-layer networks: a case study on motif counting
British Mathematical Colloqium, St Andrews, June 2018.

Exploiting structure in multi-layer networks: a case study on motif counting
Probability and Statistics Seminar, University of Uppsala, April 2018.

Discrete Mathematics with Cows
British Congress of Mathematics Education, University of Warwick, April 2018.

Exploiting structure in multi-layer networks: a case study on motif counting
Computer Science School Seminar, University of St Andrews, February 2018.

Using Network Structure to Extract Information Efficiently: Case Studies Involving Cows
Glasgow Quantitative Methods Group Seminar, January 2018.

Solving hard stable matching problems involving groups of similar agents
LFCS Seminar, University of Edinburgh, September 2017.

The interactive sum choice number of graphs
EUROCOMB 2017, TU Wien, September 2017.

Approximately counting small witnesses when there aren't too many
Computational Counting, Schloss Dagstuhl, August 2017.

The parameterised complexity of computing the maximum modularity of a graph
26th British Combinatorial Conference, University of Strathclyde, July 2017.

The complexity of finding and counting sum-free sets
2017 Colloquia in Combinatorics , Queen Mary University of London, May 2017.

Approximately enumerating small witnesses
British Colloquium for Theoretical Computer Science, University of St Andrews, April 2017.

The interactive sum choice number of graphs
Scottish Combinatorics Meeting, University of St Andrews, April 2017.

The interactive sum choice number of graphs
Combinatorics Seminar, University of Bristol, April 2017.

The interactive sum choice number of graphs
Algorithmik und Komplexitätstheorie Research Colloquium, TU Berlin, March 2017.

The complexity of finding and counting sum-free sets
Algorithm Engineering Seminar, Hasso Plattner Institut, Potsdam, March 2017.

The complexity of finding and counting sum-free sets
Combinatorics Seminar, UCLA, February 2017.

Deleting edges to save cows - an application of treewidth
Networks Research Meeting, UCLA, February 2017.(slides)

The complexity of finding and counting sum-free sets
ACiD Seminar, University of Durham, January 2017.

Randomised enumeration of small witness using a decision oracle
IPEC 2016, Aarhus, August 2016.(slides)

Deleting Edges to Save Cows: Using Graph Theory to Control the Spread of Disease in Livestock
LMS Women in Mathematics Day, ICMS Edinburgh, April 2016.(slides)

Subgraph counting problems
1st IMA Conference on Theoretical and Computational Discrete Mathematics, University of Derby, March 2016.(slides)

When can an efficient decision algorithm be used to find and count witnesses?
FATA Seminar, University of Glasgow, March 2016.(slides)

The complexity of finding and counting small subgraphs
Open University Winter Combinatorics Meeting, January 2016.(slides)

When can an FPT decision algorithm be used to count?
Algorithms seminar, University of Bergen, January 2016 (slides).

Graph modification problems in epidemiology
25th British Combinatorial Conference, University of Warwick, July 2015.(slides)

Parameterised Subgraph Counting Problems
Combinatorics Seminar, University of Strathclyde, May 2015. (slides)

Parameterised Subgraph Counting Problems
Algorithms seminar, University of Bergen, May 2015 (slides).

Subgraph Counting Problems
Geometry and Topology Seminar, University of Glasgow, November 2014.

Parameterised subgraph counting problems
ACiD Seminar, University of Durham, November 2014. (slides)

The parameterised complexity of subgraph counting problems
Combinatorics Study Group, Queen Mary University of London, February 2013.

The parameterised complexity of subgraph counting problems
Combinatorics Seminar, University of Bristol, February 2013.

The parameterised complexity of subgraph counting problems
Combinatorics Seminar, University of Birmingham, December 2013 (slides).

Flood-filling games on graphs
Women and Mathematics, Institute for Advanced Study, Princeton, May 2013.(slides)

List-colouring problems on graphs of bounded treewidth
QMUL & Warwick DIMAP Workshop, March 2013.(slides)

Spanning trees and the complexity of flood-filling games
FUN 2012, Venice, June 2012.(slides)

List colouring graphs of bounded treewidth
Séminaire de Combinatoire Algébrique et Géométrique, UPMC, Paris, May 2012.(slides)

The parameterised complexity of list problems on graphs of bounded treewidth
APEX, Paris, February 2012.(slides)

Flood filling games on graphs
23rd British Combinatorial Conference, University of Exeter, July 2011.(slides)