Seuraa
Christopher Purcell
Christopher Purcell
University of West Bohemia
Vahvistettu sähköpostiosoite verkkotunnuksessa ntis.zcu.cz - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
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
77*2017
Graphs without large apples and the maximum weight independent set problem
VV Lozin, M Milanič, C Purcell
Graphs and Combinatorics 30, 395-410, 2014
272014
Dominating induced matchings in graphs without a skew star
N Korpelainen, VV Lozin, C Purcell
Journal of Discrete Algorithms 26, 45-55, 2014
172014
Independent domination in finitely defined classes of graphs: polynomial algorithms
V Lozin, R Mosca, C Purcell
Discrete applied mathematics 182, 2-14, 2015
152015
On the complexity of role colouring planar graphs, trees and cographs
C Purcell, P Rombach
Journal of Discrete Algorithms 35, 1-8, 2015
142015
Boundary properties of the satisfiability problems
V Lozin, C Purcell
Information Processing Letters 113 (9), 313-317, 2013
122013
Subgraph complementation and minimum rank
C Buchanan, C Purcell, P Rombach
The Electronic Journal of Combinatorics, P1. 38-P1. 38, 2022
102022
Role colouring graphs in hereditary classes
C Purcell, P Rombach
Theoretical Computer Science 876, 12-24, 2021
62021
Sparse regular induced subgraphs in 2P3-free graphs
VV Lozin, R Mosca, C Purcell
Discrete Optimization 10 (4), 304-309, 2013
62013
Coloring vertices of claw-free graphs in three colors
V Lozin, C Purcell
Journal of Combinatorial Optimization 28, 462-479, 2014
32014
The parameterized complexity of manipulating Top Trading Cycles
W Phan, C Purcell
Autonomous Agents and Multi-Agent Systems 36 (2), 51, 2022
22022
On the parameterized complexity of manipulating Top Trading Cycles
W Phan, C Purcell
arXiv preprint arXiv:1803.02409, 2018
22018
On exclusive sum labellings of hypergraphs
C Purcell, J Ryan, Z Ryjáček, M Skyvová
Graphs and Combinatorics 38 (2), 46, 2022
12022
A necessary and sufficient condition for the existence of a properly coloured -factor in an edge-coloured graph
R Čada, M Furuya, K Kimura, K Ozeki, C Purcell, T Yashima
arXiv preprint arXiv:2311.09042, 2023
2023
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
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–16