Spremljaj
Konrad K. Dabrowski
Konrad K. Dabrowski
Preverjeni e-poštni naslov na newcastle.ac.uk - Domača stran
Naslov
Navedeno
Navedeno
Leto
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
512016
New results on maximum induced matchings in bipartite graphs and beyond
KK Dabrowski, M Demange, VV Lozin
Theoretical Computer Science 478, 33-40, 2013
412013
Colouring diamond-free graphs
KK Dabrowski, F Dross, D Paulusma
Journal of computer and system sciences 89, 410-431, 2017
402017
Classifying the clique-width of H-free bipartite graphs
KK Dabrowski, D Paulusma
Discrete Applied Mathematics 200, 43-51, 2016
382016
Colouring of graphs with Ramsey-type forbidden subgraphs
KK Dabrowski, PA Golovach, D Paulusma
Theoretical Computer Science 522, 34-43, 2014
382014
Clique-width for hereditary graph classes.
KK Dabrowski, M Johnson, D Paulusma
BCC, 1-56, 2019
362019
Independent Feedback Vertex Set for P 5 -Free Graphs
M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Algorithmica 81 (4), 1342-1369, 2019
332019
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
33*2012
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
262017
Bounding clique-width via perfect graphs
KK Dabrowski, S Huang, D Paulusma
Journal of Computer and System Sciences 104, 202-215, 2019
24*2019
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
242016
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
18*2018
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
142018
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
13*2021
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 (10), 2841-2866, 2020
132020
Filling the complexity gaps for colouring planar and bounded degree graphs
KK Dabrowski, F Dross, M Johnson, D Paulusma
Journal of Graph Theory 92 (4), 377-393, 2019
12*2019
Clique-width and well-quasi-ordering of triangle-free graph classes
KK Dabrowski, VV Lozin, D Paulusma
International Workshop on Graph-Theoretic Concepts in Computer Science, 220-233, 2017
122017
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
112020
Hereditary graph classes: When the complexities of coloring and clique cover coincide
A Blanché, KK Dabrowski, M Johnson, D Paulusma
Journal of Graph Theory 91 (3), 267-289, 2019
10*2019
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20