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. ISSN 0304-3975

Chikalov, I., Lozin, V. V., Lozina, I., Moshkov, M., Nguyen, H. S., Slowron, A. and Zielosko, B. (2013) Three approaches to data analysis. Intelligent Systems Reference Library . London : Springer. ISBN 9783642286667

Dabrowski, Konrad, Lozin, Vadim V. and Zamaraev, Victor. (2012) On factorial properties of chordal bipartite graphs. Discrete Mathematics, Vol.312 (No.16). pp. 2457-2465. ISSN 0012-365X

Korpelainen, Nicholas, Lozin, Vadim V. and Razgon, Igor. (2012) Boundary properties of well-quasi-ordered sets of graphs. Order . ISSN 0167-8094 (In Press)

Dabrowski, Konrad K., Lozin, Vadim, Raman, Rajiv and Ries, Bernard. (2012) Colouring vertices of triangle-free grapshs without forest. Discrete Mathematics, Vol. 312 (No. 7). pp. 1372-1385. ISSN 0012365X

Atminas, Aistis, Lozin, Vadim V. and Razgon, Igor (2012) Linear time algorithm for computing a small biclique in graphs without long induced paths. In: Algorithm Theory – SWAT 2012. Algorithm Theory – SWAT 2012 Book Subtitle 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings, Vol.7357 . London : Springer, pp. 142-152.

Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor. (2012) Locally bounded coverings and factorial properties of graphs. European Journal of Combinatorics, Vol.33 (No.4). pp. 534-543. ISSN 0195-6698

Lozin, Vadim V. and Mosca, Raffaele. (2012) Maximum regular induced subgraphs in -free graphs. Theoretical Computer Science, Vol. 460 . pp. 26-33. ISSN 03043975

Cardoso, D. M. and Lozin, Vadim V.. (2012) On hereditary properties of the class of graphs with convex quadratic stability number. Journal of Mathematical Sciences, Vol.182 (No.2). pp. 227-232. ISSN 1072-3374

Dabrowski, Konrad, Lozin, Vadim V., Müller, Haiko and Rautenbach, Dieter. (2012) Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. Journal of Discrete Algorithms, Vol.14 . pp. 207-213. ISSN 1570-8667

Lozin, Vadim V.. (2011) Minimal classes of graphs of unbounded clique-width. Annals of Combinatorics, Vol.15 (No.4). pp. 707-722. ISSN 0218-0006

Lozin, Vadim V., Mayhill, Colin and Zamaraev, Victor. (2011) A note on the speed of hereditary graph properties. The Electronic Journal of Combinatorics, Vol.18 (No.1). p. 157. ISSN 2150-959X

Korpelainen, Nicholas, Lozin, Vadim V., Malyshev, Dmitriy S. and Tiskin, Alexander. (2011) Boundary properties of graphs for algorithmic graph problems. Theoretical Computer Science, Vol.412 (No.29). pp. 3545-3554. ISSN 0304-3975

Cardoso, Domingos M., Korpelainen, Nicholas and Lozin, Vadim V.. (2011) On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Applied Mathematics, Vol.159 (No.7). pp. 521-531. ISSN 0166-218X

Korpelainen, Nicholas and Lozin, Vadim V.. (2011) Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory, Volume 67 (Number 3). pp. 235-249. ISSN 0364-9024

Lozin, Vadim V. and Mayhill, Colin. (2011) Canonical antichains of unit interval and bipartite permutation graphs. Order, Vol. 28 (No. 3). pp. 513-522. ISSN 0167-8094

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.

Lozin, Vadim V.. (2011) Stability preserving transformations of graphs. Annals of Operations Research , vol.188 (No.1). pp. 331-341. ISSN 0254-5330

Korpelainen, Nicholas and Lozin, Vadim V.. (2011) Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics & Theoretical Computer Science, Vol.311 (No.16). pp. 1813-1822. ISSN 1365-8050

Lozin, Vadim V.. (2010) A decidability result for the dominating set problem. Theoretical Computer Science, Vol.411 (No.44-46). pp. 4023-4027. ISSN 0304-3975

Lozin, Vadim V. and Milanic, Martin. (2010) On the maximum independent set problem in subclasses of planar graphs. Journal of Graph Algorithms and Applications, Vol.14 (No.2). pp. 269-286. ISSN 1526-1719

Hoang, Chinh T., Kaminski, Marcin, Lozin, Vadim V., Sawada, Joe and Shu, Xiao. (2010) Deciding k-colorability of P5-free graphs in polynomial time. Algorithmica, Vol.57 (No.1). pp. 74-81. ISSN 0178-4617

Brandstaedt, Andreas, Klembt, Tilo, Lozin, Vadim V. and Mosca, Raffaele. (2010) On independent vertex sets in subclasses of apple-free graphs. Algorithmica, Vol.56 (No.4). pp. 383-393. ISSN 0178-4617

Dabrowski, K, Lozin, Vadim V., Raman, R. 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, Vol.6410 pp. 184-195.

Korpelainen, Nicholas, Lozin, Vadim V. and Tiskin, Alexander (2010) Hamiltonian cycles in subcubic graphs : what makes the problem difficult. In: 7th International Conference on Theory and Application of Models of Computation, Prague, Czech Republic, June 07-11, 2010. Published in: Lecture Notes in Computer Science, Vol.6108 pp. 320-327.

Brandstädt, Andreas, Lozin, Vadim V. and Mosca, Raffaele. (2010) Independent sets of maximum weight in apple-free graphs. SIAM Journal on Discrete Mathematics, Vol.24 (No.1). pp. 239-254. ISSN 0895-4801

Lozin, Vadim V.. (2009) Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. Electronic Notes in Discrete Mathematics, Vol.34 . pp. 127-131. ISSN 1571-0653

Kaminski, Marcin, Lozin, Vadim V. and Milanic, Martin (2009) Recent developments on graphs of bounded clique-width. In: 2nd Workshop on Graph Classes, Optimization and Width Parameters, Prague, Czech Republic, October, 2005. Published in: Discrete Applied Mathematics, Vol.157 (No.12 Sp. Iss. SI). pp. 2747-2761.

Allen, Peter, Lozin, Vadim and Rao, Michael. (2009) Clique-width and the speed of hereditary properties. Electronic Journal of Combinatorics, Vol.16 (No.1). Article no. R35. ISSN 1077-8926

Lozin, Vadim V. and Mosca, Raffaele. (2009) Maximum independent sets in subclasses of P-5-free graphs. Information Processing Letters, Vol.109 (No.6). pp. 319-324. ISSN 0020-0190

Korpelainen, Nicholas and Lozin, Vadim V. (2009) Bipartite graphs of large clique-width. In: 20th International Workshop on Combinatorial Algorithms, Hradec nad Moravici, Czech Republic, June 28-JUL 02, 2009. Published in: Lecture Notes in Computer Science, Vol.5874 pp. 385-395.

Cardoso, Domingos M. and Lozin, Vadim V.. (2009) Dominating induced matchings. Lecture Notes in Computer Science, Vol.5420 . pp. 77-86. ISSN 0302-9743

Lozin, Vadim V. and Milanic, Martin. (2008) A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Journal of Discrete Algorithms, Vol.6 (No.4). pp. 595-604. ISSN 1570-8667

Lozin, Vadim V. and Milanic, Martin (2008) On finding augmenting graphs. In: 5th International Conference on Graphs and Optimization, Leukerbad, Switzerland , Aug, 2006. Published in: Discrete Applied Mathematics, Vol.156 (No.13). pp. 2517-2529.

Lozin, Vadim V.. (2008) Gearing optimization. Optimization and Engineering, Vol.9 (No.2). pp. 201-211. ISSN 1389-4420

Lozin, Vadim V. and Volz, Jordan (2008) The clique-width of bipartite graphs in monogenic classes. In: 4th International Conference on Concept Lattices and Their Applications, Hammamet, Tunsia, Oct 30-Nov 01, 2006. Published in: International Journal of Foundations of Computer Science, Vol.19 (No.2). pp. 477-494.

Lozin, Vadim V.. (2008) Boundary classes of planar graphs. Combinatorics, Probability & Computing, Vol.17 (No.2). pp. 287-295. ISSN 0963-5483

Lozin, Vadim V. (2008) From tree-width to clique-width : excluding a unit interval graph. In: 19th International Symposium on Algorithms and Computations (ISAAC 2008), Gold Coast, Australia, Dec 15-17, 2008. Published in: Lecture Notes in Computer Science, Vol.5369 pp. 871-882.

Lozin, Vadim V.. (2008) Graph representation functions computable by finite automata. Journal of Automata, Languages and Combinatorics, Vol.13 (No.1). pp. 73-90. ISSN 1430-189X

Brandstädt, Andreas, Klembt, Tilo, Lozin, Vadim V. and Mosca, Raffaele (2008) Independent sets of maximum weight in apple-free graphs. In: 19th international symposium, ISAAC 2008, Gold Coast, Australia, 15-17 Dec 2008. Published in: Lecture Notes in Computer Science, Vol.5369 pp. 848-858.

Alekseev, Vladimir E., Lozin, Vadim V., Malyshev, Dmitriy and Milanič, Martin. (2008) The maximum independent set problem in planar graphs. Lecture Notes in Computer Science, Vol.5162 . pp. 96-107. ISSN 0302-9743

Hoàng, Chính T., Kamiński, Marcin, Lozin, Vadim V., Sawada, Joe and Shu, Xiao. (2008) A note on k-colorability of P 5-free graphs. Lecture Notes in Computer Science, Vol.5162 . pp. 387-394. ISSN 0302-9743

Alekseev, V. E., Boliac, R., Korobitsyn, D. V. and Lozin, V. V.. (2007) NP-hard graph problems and boundary classes of graphs. Theoretical Computer Science, Vol.389 (No.1-2). pp. 219-236. ISSN 0304-3975