I am a PhD student supervised by Dr. Vadim Lozin.
I work
mostly on graph algorithms in restricted graph classes (from both a
parameterized and non-parameterized point of view).
Journal Publications On factorial properties of chordal bipartite graphs,
K. Dabrowski, V.V.
Lozin,
and V. Zamaraev, Discrete Mathematics, to appear (preprint available on request)
Parameterized complexity of the weighted independent set problem
beyond graphs of bounded clique number,
K. Dabrowski, V.V.
Lozin,
H. Müller and D.
Rautenbach, Journal of Discrete Algorithms, 14 (2012) pp. 207-213 (preprint)
(link)
Colouring vertices of triangle-free graphs without forests,
K. Dabrowski, V.V.
Lozin,
R. Raman and B.
Ries, Discrete Mathematics, 312 (7) (2012) pp. 1372-1385
(preprint)
(link)
Conference Publications Parameterized Algorithms for the Independent
Set Problem in Some Hereditary Graph Classes,
K. Dabrowski, V.V.
Lozin,
H. Müller and D.
Rautenbach, Lecture Notes in Computer Science, 6460 (2011) pp. 1-9
(Proceedings
of IWOCA 2010). (preprint)
(link)
Colouring vertices of triangle-free graphs,
K. Dabrowski, V.V.
Lozin,
R. Raman and B.
Ries, Lecture Notes in Computer Science, 6410 (2010) pp. 184-195
(Proceedings of WG 2010). (preprint)
(link)
Publications in Preparation Graph Partitions Below 3-colourability,
K.K. Dabrowski, V.V.
Lozin and J. Stacho,
submitted (preprint available on request)
New Results on Maximum Induced Matchings in Bipartite Graphs,
K.K. Dabrowski, M.
Demange and V.V.
Lozin,
submitted (preprint available on request)