Describing head shape with surface harmonic expansions. - Christopher Purcell; Takunori Mashiko; Kazumi Odaka; Keiichi Ueno (IEEE Trans. Biomed. Eng., 1991)

Sparse regular induced subgraphs in 2P3-free graphs. - Vadim V. Lozin; Raffaele Mosca; Christopher Purcell (Discret. Optim., 2013)

Boundary properties of the satisfiability problems. - Vadim V. Lozin; Christopher Purcell (Inf. Process. Lett., 2013)

Graphs Without Large Apples and the Maximum Weight Independent Set Problem. - Vadim V. Lozin; Martin Milanic; Christopher Purcell (Graphs Comb., 2014)

Coloring vertices of claw-free graphs in three colors. - Vadim V. Lozin; Christopher Purcell (J. Comb. Optim., 2014)

Dominating induced matchings in graphs without a skew star. - Nicholas Korpelainen; Vadim V. Lozin; Christopher Purcell (J. Discrete Algorithms, 2014)

Independent domination in finitely defined classes of graphs: Polynomial algorithms. - Vadim V. Lozin; Raffaele Mosca; Christopher Purcell (Discret. Appl. Math., 2015)

On the complexity of role colouring planar graphs, trees and cographs. - Christopher Purcell; M. Puck Rombach (J. Discrete Algorithms, 2015)

LCL Problems on Grids. - Sebastian Brandt 002; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Patric R. J. Östergård; Christopher Purcell; Joel Rybicki; Jukka Suomela; Przemyslaw Uznanski (PODC, 2017)

Distributed Colour Reduction Revisited. - Jukka Kohonen; Janne H. Korhonen; Christopher Purcell; Jukka Suomela; Przemyslaw Uznanski (CoRR, 2017)

Role colouring graphs in hereditary classes. - Christopher Purcell; Puck Rombach (Theor. Comput. Sci., 2021)

The parameterized complexity of manipulating Top Trading Cycles. - William Phan; Christopher Purcell (Auton. Agents Multi Agent Syst., 2022)

Subgraph Complementation and Minimum Rank. - Calum Buchanan; Christopher Purcell; Puck Rombach (Electron. J. Comb., 2022)

On Exclusive Sum Labellings of Hypergraphs. - Christopher Purcell; Joe Ryan 001; Zdenek Ryjácek; Mária Skyvová (Graphs Comb., 2022)

A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. - Roman Cada; Michitaka Furuya; Kenji Kimura; Kenta Ozeki; Christopher Purcell; Takamasa Yashima (CoRR, 2023)