Christopher Purcell

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 10

Top Topics

Parameterized Complexity

Independent Set

Top Venues

J. Discrete Algorithms

Auton. Agents Multi Agent Syst.

Publications

Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph. CoRR (2023)
Christopher Purcell, Joe Ryan, Zdenek Ryjácek, Mária Skyvová
On Exclusive Sum Labellings of Hypergraphs. Graphs Comb. 38 (2) (2022)
William Phan, Christopher Purcell
The parameterized complexity of manipulating Top Trading Cycles. Auton. Agents Multi Agent Syst. 36 (2) (2022)
Calum Buchanan, Christopher Purcell, Puck Rombach
Subgraph Complementation and Minimum Rank. Electron. J. Comb. 29 (1) (2022)
Christopher Purcell, Puck Rombach
Role colouring graphs in hereditary classes. Theor. Comput. Sci. 876 (2021)
William Phan, Christopher Purcell
On the parameterized complexity of manipulating Top Trading Cycles. CoRR (2018)
Christopher Purcell, M. Puck Rombach
Role colouring graphs in hereditary classes. CoRR (2018)
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski
Distributed Colour Reduction Revisited. CoRR (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL Problems on Grids. PODC (2017)
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
LCL problems on grids. CoRR (2017)
Christopher Purcell, M. Puck Rombach
On the complexity of role colouring planar graphs, trees and cographs. J. Discrete Algorithms 35 (2015)
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
Independent domination in finitely defined classes of graphs: Polynomial algorithms. Discret. Appl. Math. 182 (2015)
Vadim V. Lozin, Martin Milanic, Christopher Purcell
Graphs Without Large Apples and the Maximum Weight Independent Set Problem. Graphs Comb. 30 (2) (2014)
Christopher Purcell, M. Puck Rombach
On the Complexity of Role Colouring Planar Graphs, Trees and Cographs. CoRR (2014)
Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell
Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms 26 (2014)
Vadim V. Lozin, Christopher Purcell
Coloring vertices of claw-free graphs in three colors. J. Comb. Optim. 28 (2) (2014)
Vadim V. Lozin, Christopher Purcell
Boundary properties of the satisfiability problems. Inf. Process. Lett. 113 (9) (2013)
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
-free graphs. Discret. Optim. 10 (4) (2013)