| 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 | 69* | 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 | 24 | 2014 |
| Dominating induced matchings in graphs without a skew star N Korpelainen, VV Lozin, C Purcell Journal of Discrete Algorithms 26, 45-55, 2014 | 17 | 2014 |
| Independent domination in finitely defined classes of graphs: polynomial algorithms V Lozin, R Mosca, C Purcell Discrete applied mathematics 182, 2-14, 2015 | 15 | 2015 |
| On the complexity of role colouring planar graphs, trees and cographs C Purcell, P Rombach Journal of Discrete Algorithms 35, 1-8, 2015 | 12 | 2015 |
| Boundary properties of the satisfiability problems V Lozin, C Purcell Information Processing Letters 113 (9), 313-317, 2013 | 11 | 2013 |
| Subgraph complementation and minimum rank C Buchanan, C Purcell, P Rombach The Electronic Journal of Combinatorics, P1. 38-P1. 38, 2022 | 9 | 2022 |
| Sparse regular induced subgraphs in 2P3-free graphs VV Lozin, R Mosca, C Purcell Discrete Optimization 10 (4), 304-309, 2013 | 5 | 2013 |
| Role colouring graphs in hereditary classes C Purcell, P Rombach Theoretical Computer Science 876, 12-24, 2021 | 4 | 2021 |
| Coloring vertices of claw-free graphs in three colors V Lozin, C Purcell Journal of Combinatorial Optimization 28, 462-479, 2014 | 3 | 2014 |
| The parameterized complexity of manipulating Top Trading Cycles W Phan, C Purcell Autonomous Agents and Multi-Agent Systems 36 (2), 51, 2022 | 2 | 2022 |
| On the parameterized complexity of manipulating Top Trading Cycles W Phan, C Purcell arXiv preprint arXiv:1803.02409, 2018 | 2 | 2018 |
| On exclusive sum labellings of hypergraphs C Purcell, J Ryan, Z Ryjáček, M Skyvová Graphs and Combinatorics 38 (2), 46, 2022 | 1 | 2022 |
| 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 |
Vadim LozinUniversity of Warwickwarwick.ac.uk의 이메일 확인됨
