Konrad K. Dabrowski

Cited by

	All	Since 2020
Citations	747	383
h-index	16	11
i10-index	21	12

100

201220132014201520162017201820192020202120222023202420254 12 17 53 49 50 62 99 86 73 63 72 77 10

Public access

View all

39 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Daniel PaulusmaDepartment of Computer Science, Durham UniversityVerified email at durham.ac.uk
Vadim LozinUniversity of WarwickVerified email at warwick.ac.uk
Marthe BonamyLaBRI, CNRS, Université BordeauxVerified email at u-bordeaux.fr
Carl FeghaliCNRS, ENS Lyon, LIPVerified email at ens-lyon.fr
Shenwei HuangUniversity of New South WalesVerified email at unsw.edu.au
Viktor ZamaraevUniversity of LiverpoolVerified email at liverpool.ac.uk
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Andreas BrandstädtProfessor of Computer Science, University of Rostock, Germany Verified email at uni-rostock.de
Marc DemangeAssociate Professor, Mathematical Science, RMIT, Melbourne, AustraliaVerified email at rmit.edu.au
Sang-il OumDistinguished Research Fellow / CI. Discrete Mathematics Group, Institute for Basic ScienceVerified email at ibs.re.kr
Jisu JeongNAVERVerified email at navercorp.com
O-joung KwonHanyang UniversityVerified email at hanyang.ac.kr
Rajiv RamanIowa, Warwick, MPI, IIITVerified email at iiitd.ac.in
Bernard RiesProfessor, University of FribourgVerified email at unifr.ch
Laurent BulteauCNRS / Université Paris-Est Marne-la-ValléeVerified email at u-pem.fr
Pim van 't HofUniversity of TwenteVerified email at utwente.nl
Ueverton S. SouzaFluminense Federal UniversityVerified email at ic.uff.br
Ignasi SauCNRS, LIRMM, Université de Montpellier, FranceVerified email at lirmm.fr
Vangelis PaschosProfesseur d'Informatique, LAMSADE, Université Paris-DauphineVerified email at lamsade.dauphine.fr
Nicolas BourgeoisParis I Panthéon-SorbonneVerified email at phare.normalesup.org

Konrad K. Dabrowski

Newcastle University

Verified email at newcastle.ac.uk - Homepage

Graph Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Colouring vertices of triangle-free graphs without forests KK Dabrowski, V Lozin, R Raman, B Ries Discrete Mathematics 312 (7), 1372-1385, 2012	58*	2012
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs^† KK Dabrowski, D Paulusma The Computer Journal 59 (5), 650-666, 2016	53	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	50	2013
Clique-width for hereditary graph classes. KK Dabrowski, M Johnson, D Paulusma BCC, 1-56, 2019	44	2019
Independent Feedback Vertex Set for -Free Graphs M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma Algorithmica 81 (4), 1342-1369, 2019	42	2019
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	39*	2012
Colouring of graphs with Ramsey-type forbidden subgraphs KK Dabrowski, PA Golovach, D Paulusma Theoretical Computer Science 522, 34-43, 2014	38	2014
Colouring diamond-free graphs KK Dabrowski, F Dross, D Paulusma Journal of computer and system sciences 89, 410-431, 2017	36	2017
Classifying the clique-width of H-free bipartite graphs KK Dabrowski, D Paulusma Discrete Applied Mathematics 200, 43-51, 2016	30	2016
Bounding clique-width via perfect graphs KK Dabrowski, S Huang, D Paulusma Journal of Computer and System Sciences 104, 202-215, 2019	25*	2019
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	25	2017
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	23	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	23	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	20	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	19*	2021
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	15	2020
Classifying the Clique-Width of H-Free Bipartite Graphs KK Dabrowski, D Paulusma International Computing and Combinatorics Conference, 489-500, 2014	12	2014
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	11	2019
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

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors