Number of items: 4.
BlanchΓ©, Alexandre, Dabrowski, Konrad, Johnson, Matthew, Lozin, Vadim V., Paulusma, DaniΓ«l and Zamaraev, Viktor
(2020)
Clique-width for graph classes closed under complementation.
SIAM Journal on Discrete Mathematics, 34
(2).
pp. 1107-1147.
doi:10.1137/18M1235016
ISSN 0895-4801.
Dabrowski, Konrad, Demange, Marc and Lozin, Vadim V.
(2013)
New results on maximum induced matchings in bipartite graphs and beyond.
Theoretical Computer Science, Volume 478
.
pp. 33-40.
doi:10.1016/j.tcs.2013.01.027
ISSN 0304-3975.
Dabrowski, Konrad, Lozin, Vadim V., Muller, H. and Rautenbach, Dieter
(2011)
Parameterized algorithms for the independent set problem in some hereditary graph classes.
In: 21st International Workshop on Combinatorial Algorithms, KCL Dept Informat, London, England, 26-28 Jul 2010 . Published in: Lecture Notes in Computer Science, Vol.6460
pp. 1-9.
doi:10.1007/978-3-642-19222-7_1
ISSN 0302-9743.
Dabrowski, Konrad, Lozin, Vadim V., Raman, Rajiv and Ries, Bernard
(2010)
Colouring vertices of triangle-free graphs.
In: 36th International Workshop on Graph-Theoretic Concepts in Computer Science, Zaros, Greece, 28-30 Jun 2010. Published in: Lecture Notes in Computer Science, Volume 6410
pp. 184-195.
doi:10.1007/978-3-642-16926-7_18
ISSN 0302-9743.
This list was generated on Wed Apr 17 15:23:32 2024 BST.