Christopher Purcell

About

I am a mathematician and computer scientist. My main areas of research are structural and algorithmic graph theory. I also have interests in distributed computing and computational social choice. I recently completed a postdoc in mathematics at the University of West Bohemia under Zdeněk Ryjáček. I have also been a member of the Distributed Computing group at Aalto University under Jukka Suomela and of DIMAP at the University of Warwick under Vadim Lozin.

Publications

• Subgraph complementation and minimum rank
  (with Puck Rombach and Calum Buchanan)
  Electronic Journal of Combinatorics Volume 29, Issue 1 (2022)
• On exclusive sum labellings of hypergraphs
  (with Joe Ryan, Zdeněk Ryjáček and Mária Skyvová)
  Graphs and Combinatorics (to appear 2021)
• Role colouring graphs in hereditary classes
  (with Puck Rombach)
  Theoretical Computer Science Volume 876, (2021), pp 12-24
• On the parameterized complexity of manipulating Top Trading Cycles (with William Phan)
• LCL problems on grids (with Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric Östergård, Joel Rybicki, Jukka Suomela, Przemysław Uznański)
  ACM Symposium on Principles of Distributed Computing (PODC 2017)
• On the complexity of role colouring planar graphs, cographs and trees
  (with M. P. Rombach)
  Journal of Discrete Algorithms, Volume 35, (2015), pp 1-8
• Independent domination in finitely defined classes of graphs: polynomial time algorithms
  (with V. Lozin and R. Mosca)
  Discrete Applied Mathematics, Volume 182, (2015), pp 2-14
• Dominating induced matchings without a skew star
  (with N. Korpelainen and V. Lozin)
  Journal of Discrete Algorithms, Volume 26, (2014), pp. 45-55
• Graphs without large apples and the maximum weight independent set problem
  (with V. Lozin and M. Milanič)
  Graphs and Combinatorics Volume 30 (2014) pp. 395-410
• Coloring vertices of claw-free graphs in three colors
  (with V. Lozin)
  J. Combinatorial Optimization, Volume 28 (2014) pp. 462-479
• Boundary properties of the satisfiability problems
  (with V. Lozin)
  Information Processing Letters Volume 113, Issue 9 (2013) pp. 313-317
• Sparse regular induced subgraphs in 2P₃-free graphs
  (with V. Lozin and R. Mosca)
  Discrete Optimization Volume 10, Issue 4 (2013) pp. 304-309

Teaching

Aalto University

Computational Complexity Theory 2017 (Lecturer)

Distributed Algorithms 2016 (TA)

University of Warwick

Probability and Discrete Mathematics 2013 (TA)

Random Discrete Structures 2012 (TA)

Discrete Mathematics and its Applications II 2011 (TA)

Mathematics for Computer Scientists I 2010 (TA)