Christopher Purcell
Christopher Purcell
University of West Bohemia
Bestätigte E-Mail-Adresse bei ntis.zcu.cz
Titel
Zitiert von
Zitiert von
Jahr
LCL problems on grids
J Korhonen, T Lempiäinen, J Rybicki, P Uznański, J Hirvonen, S Brandt, ...
Proceedings of the Annual ACM Symposium on Principles of Distributed …, 2017
41*2017
Graphs without large apples and the maximum weight independent set problem
VV Lozin, M Milanič, C Purcell
Graphs and Combinatorics 30 (2), 395-410, 2014
172014
Dominating induced matchings in graphs without a skew star
N Korpelainen, VV Lozin, C Purcell
Journal of Discrete Algorithms 26, 45-55, 2014
112014
Independent domination in finitely defined classes of graphs: polynomial algorithms
V Lozin, R Mosca, C Purcell
Discrete Applied Mathematics 182, 2-14, 2015
92015
Boundary properties of the satisfiability problems
V Lozin, C Purcell
Information Processing Letters 113 (9), 313-317, 2013
92013
On the complexity of role colouring planar graphs, trees and cographs
C Purcell, P Rombach
Journal of Discrete Algorithms 35, 1-8, 2015
52015
Sparse regular induced subgraphs in 2P3-free graphs
VV Lozin, R Mosca, C Purcell
Discrete Optimization 10 (4), 304-309, 2013
32013
Coloring vertices of claw-free graphs in three colors
V Lozin, C Purcell
Journal of Combinatorial Optimization 28 (2), 462-479, 2014
22014
Expressing graphs as symmetric differences of cliques in the complete graph
C Buchanan, C Purcell, P Rombach
arXiv preprint arXiv:2101.06180, 2021
12021
Role colouring graphs in hereditary classes
C Purcell, P Rombach
Theoretical Computer Science 876, 12-24, 2021
2021
On the parameterized complexity of manipulating Top Trading Cycles
W Phan, C Purcell
arXiv preprint arXiv:1803.02409, 2018
2018
Distributed Colour Reduction Revisited
J Kohonen, JH Korhonen, C Purcell, J Suomela, P Uznański
arXiv preprint arXiv:1709.00901, 2017
2017
Cliques, colouring and satisfiability: from structure to algorithms
C Purcell
University of Warwick, 2013
2013
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–13