| Colouring vertices of triangle-free graphs without forests KK Dabrowski, V Lozin, R Raman, B Ries Discrete Mathematics 312 (7), 1372-1385, 2012 | 56* | 2012 |
| Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs† KK Dabrowski, D Paulusma The Computer Journal 59 (5), 650-666, 2016 | 48 | 2016 |
| New results on maximum induced matchings in bipartite graphs and beyond KK Dabrowski, M Demange, VV Lozin Theoretical Computer Science 478, 33-40, 2013 | 47 | 2013 |
| Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number K Dabrowski, V Lozin, H Müller, D Rautenbach Journal of Discrete Algorithms 14, 207-213, 2012 | 41* | 2012 |
| Independent Feedback Vertex Set for -Free Graphs M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Algorithmica 81 (4), 1342-1369, 2019 | 40 | 2019 |
| Clique-width for hereditary graph classes. KK Dabrowski, M Johnson, D Paulusma BCC, 1-56, 2019 | 37 | 2019 |
| Colouring of graphs with Ramsey-type forbidden subgraphs KK Dabrowski, PA Golovach, D Paulusma Theoretical Computer Science 522, 34-43, 2014 | 36 | 2014 |
| Colouring diamond-free graphs KK Dabrowski, F Dross, D Paulusma Journal of computer and system sciences 89, 410-431, 2017 | 35 | 2017 |
| Classifying the clique-width of H-free bipartite graphs KK Dabrowski, D Paulusma Discrete Applied Mathematics 200, 43-51, 2016 | 29 | 2016 |
| Bounding the Clique‐Width of H‐Free Chordal Graphs A Brandstädt, KK Dabrowski, S Huang, D Paulusma Journal of Graph Theory 86 (1), 42-77, 2017 | 23 | 2017 |
| Bounding clique-width via perfect graphs KK Dabrowski, S Huang, D Paulusma Journal of Computer and System Sciences 104, 202-215, 2019 | 22* | 2019 |
| Independent feedback vertex sets for graphs of bounded diameter M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Information Processing Letters 131, 26-32, 2018 | 22 | 2018 |
| Bounding the clique-width of H-free split graphs A Brandstädt, KK Dabrowski, S Huang, D Paulusma Discrete Applied Mathematics 211, 30-39, 2016 | 21 | 2016 |
| On cycle transversals and their connected variants in the absence of a small linear forest KK Dabrowski, C Feghali, M Johnson, G Paesani, D Paulusma, ... Algorithmica 82, 2841-2866, 2020 | 20 | 2020 |
| On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph SR Alves, KK Dabrowski, L Faria, S Klein, I Sau, US Souza Theoretical Computer Science 746, 36-48, 2018 | 19 | 2018 |
| Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Journal of Graph Theory 98 (1), 81-109, 2021 | 18* | 2021 |
| Classifying the Clique-Width of H-Free Bipartite Graphs KK Dabrowski, D Paulusma International Computing and Combinatorics Conference, 489-500, 2014 | 12 | 2014 |
| Clique-width and well-quasi-ordering of triangle-free graph classes KK Dabrowski, VV Lozin, D Paulusma Journal of Computer and System Sciences 108, 64-91, 2020 | 11 | 2020 |
| Computing small pivot-minors KK Dabrowski, F Dross, J Jeong, MM Kanté, O Kwon, S Oum, D Paulusma Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018 | 11* | 2018 |
| Clique-width for graph classes closed under complementation A Blanché, KK Dabrowski, M Johnson, VV Lozin, D Paulusma, ... SIAM Journal on Discrete Mathematics 34 (2), 1107-1147, 2020 | 9 | 2020 |
Daniel PaulusmaDepartment of Computer Science, Durham University在 durham.ac.uk 的电子邮件经过验证
