Christopher Purcell

19 papers A* 1Journal 18
YearRankTypeTitle / Venue / Authors
2023 J jnl
A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.
CoRR
Roman Cada, Michitaka Furuya, Kenji Kimura, Kenta Ozeki, Christopher Purcell, Takamasa Yashima
2022 J jnl
On Exclusive Sum Labellings of Hypergraphs.
Graphs Comb.
Christopher Purcell, Joe Ryan, Zdenek Ryjácek, Mária Skyvová
2022 J jnl
Subgraph Complementation and Minimum Rank.
Electron. J. Comb.
Calum Buchanan, Christopher Purcell, Puck Rombach
2022 J jnl
The parameterized complexity of manipulating Top Trading Cycles.
Auton. Agents Multi Agent Syst.
William Phan, Christopher Purcell
2021 J jnl
Role colouring graphs in hereditary classes.
Theor. Comput. Sci.
Christopher Purcell, Puck Rombach
2018 J jnl
On the parameterized complexity of manipulating Top Trading Cycles.
CoRR
William Phan, Christopher Purcell
2018 J jnl
Role colouring graphs in hereditary classes.
CoRR
Christopher Purcell, M. Puck Rombach
2017 J jnl
Distributed Colour Reduction Revisited.
CoRR
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell, Jukka Suomela, Przemyslaw Uznanski
2017 A* conf
LCL Problems on Grids.
PODC
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
2017 J jnl
LCL problems on grids.
CoRR
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski
2015 J jnl
Independent domination in finitely defined classes of graphs: Polynomial algorithms.
Discret. Appl. Math.
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
2015 J jnl
On the complexity of role colouring planar graphs, trees and cographs.
J. Discrete Algorithms
Christopher Purcell, M. Puck Rombach
2014 J jnl
Coloring vertices of claw-free graphs in three colors.
J. Comb. Optim.
Vadim V. Lozin, Christopher Purcell
2014 J jnl
Dominating induced matchings in graphs without a skew star.
J. Discrete Algorithms
Nicholas Korpelainen, Vadim V. Lozin, Christopher Purcell
2014 J jnl
Graphs Without Large Apples and the Maximum Weight Independent Set Problem.
Graphs Comb.
Vadim V. Lozin, Martin Milanic, Christopher Purcell
2014 J jnl
On the Complexity of Role Colouring Planar Graphs, Trees and Cographs.
CoRR
Christopher Purcell, M. Puck Rombach
2013 J jnl
Boundary properties of the satisfiability problems.
Inf. Process. Lett.
Vadim V. Lozin, Christopher Purcell
2013 J jnl
Sparse regular induced subgraphs in 2P
Discret. Optim.
Vadim V. Lozin, Raffaele Mosca, Christopher Purcell
1991 J jnl
Describing head shape with surface harmonic expansions.
IEEE Trans. Biomed. Eng.
Christopher Purcell, Takunori Mashiko, Kazumi Odaka, Keiichi Ueno