8 citations · 9 across the 5 of their papers we have counts for
7 papers
Tiling the Sphere with Regular Polygons
Hoi Ping Luk, Roman Nedela, Christopher Purcell
We give a complete classification of edge-to-edge tilings of the sphere by regular polygons under a unified framework. Without assuming convexity of the tiles or polyhedrality of t…
Subgraph complementation and minimum rank
Calum Buchanan, Christopher Purcell, Puck Rombach
Any finite simple graph can be represented by a collection of subsets of such that if and only if and appear together in an odd numb…
On the parameterized complexity of manipulating Top Trading Cycles
William Phan, Christopher Purcell
We study the problem of exchange when 1) agents are endowed with heterogeneous indivisible objects, and 2) there is no money. In general, no rule satisfies the three central proper…
Role colouring graphs in hereditary classes
Christopher Purcell, Puck Rombach
We study the computational complexity of computing role colourings of graphs in hereditary classes. We are interested in describing the family of hereditary classes on which a role…
Distributed Colour Reduction Revisited
Jukka Kohonen, Janne H. Korhonen, Christopher Purcell +2
We give a new, simple distributed algorithm for graph colouring in paths and cycles. Our algorithm is fast and self-contained, it does not need any globally consistent orientation,…
LCL problems on grids
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen +6
LCLs or locally checkable labelling problems (e.g. maximal independent set, maximal matching, and vertex colouring) in the LOCAL model of computation are very well-understood in cy…