Refereed contributions

86. Colouring vertices of triangle-free graphs without forests,
    K. Dabrowski, V.V. Lozin, R. Raman and B. Ries
    Discrete Mathematics, to appear.
    
    

85. 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, to appear.
    
    

84. Locally bounded coverings and factorial properties of graphs,
    V.V. Lozin, C. Mayhill and V. Zamaraev
    European J. Combinatorics, 33 (2012) 534–543.
    
    

83. Minimal classes of graphs of unbounded clique-width,
    V.V. Lozin
    Annals of Combinatorics, 15 (2011) 707-722.
    
    

82. Stability preserving transformations of graphs,
    V.V. Lozin
    Annals of Operations Research, 188 (2011) 331-341.
    Preprint
    
    

81. Canonical antichains of unit interval and bipartite permutation graphs,
    V.V. Lozin and C. Mayhill
    Order, 28 (2011) 513-522.
    
    

80. A note on the speed of hereditary graph properties,
    V.V. Lozin, C. Mayhill and V. Zamaraev
    Electronic Journal of Combinatorics, 18 (2011) Research Paper 157.
    File
    
    

79. Bipartite Induced Subgraphs and Well-Quasi-Ordering
    N. Korpelainen, and V.V. Lozin
    Journal of Graph Theory, 67 (2011) 235-249.
    
    

78. Two forbidden induced subgraphs and well-quasi-ordering,
    N. Korpelainen, and V.V. Lozin
    Discrete Mathematics, 311 (2011) 1813-1822.
    
    

77. Boundary Properties of Graphs for Algorithmic Graph Problems,
    N. Korpelainen, V. V. Lozin, D. S. Malyshev and A. Tiskin
    Theoretical Computer Science, 412 (2011) 3545-3554.
    
    

76. On the complexity of the dominating induced matching problem in hereditary classes of graphs
    D. Cardoso, N. Korpelainen, and V.V. Lozin
    Discrete Applied Mathematics, 159 (2011) 521-531.
    
    

75. A decidability result for the dominating set problem
    V.V. Lozin
    Theoretical Computer Science, 411 (2010) 4023-4027.
    
    

74. Independent sets of maximum weight in apple-free graphs
    A. Brandstädt, V.V. Lozin and R. Mosca
    SIAM J. Discrete Mathematics, 24 (2010) 239-254.
    
    

73. Colouring vertices of triangle-free graphs,
    K. Dabrowski, V.V. Lozin, R. Raman and B. Ries,
    Lecture Notes in Computer Science, 6410 (2010)  184-195.
    
    

72. Parameterized Algorithms for the Independent Set Problem in Hereditary Graph Classes,
    K. Dabrowski, V.V. Lozin, H. Müller and D. Rautenbach,
    Lecture Notes in Computer Science, 6460 (2010) 1-9. 
    
    

71. Hamiltonian cycles in subcubic graphs: what makes the problem difficult
    N. Korpelainen, V.V. Lozin and A. Tiskin,
    Lecture Notes in Computer Science, 6108 (2010) 320-327.
    
    

70. On the maximum independent set problem in subclasses of planar graphs,
    V.V. Lozin and M. Milanic
    Journal of Graph Algorithms and Applications, 14 (2010) 269-286.
    
    

69. Deciding k-colorability of P5-free graphs in polynomial time
    C. Hoang, M. Kaminski, V. Lozin, J. Sawada, and X. Shu
    Algorithmica, 57 (2010) 74-81.
    Preprint
    
    

68. On independent vertex sets in subclasses of apple-free graphs
    A. Brandstädt, T. Klembt, V.V. Lozin and R. Mosca
    Algorithmica, 56 (2010) 383-393.
    
    

67. Bipartite graphs of large clique-width
    N. Korpelainen, V. Lozin
    Lecture Notes in Computer Science, 5874 (2009) 385-395.
    
    

66. Recent developments on graphs of bounded clique-width
    M. Kaminski, V.V. Lozin and M. Milanic
    Discrete Applied Mathematics, 157 (2009) 2747-2761.
    Preprint
    
    

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

64. Dominating induced matchings
    D.M. Cardoso and V.V. Lozin
    Lecture Notes in Computer Science, 5420 (2009) 77-86.
    
    

63. Clique-width and the speed of hereditary properties
    Peter Allen, V.V. Lozin and M. Rao
    Electronic Journal of Combinatorics, 16 (2009) Research Paper 35.
    PDF File
    
    

62. Maximum independent sets in subclasses of P5-free graphs
    V.V. Lozin and R. Mosca
    Information Processing Letters, 109 (2009) 319-324.
    
    

61. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
    V.V. Lozin and Martin Milanic
    Journal of Discrete Algorithms, 6 (2008) 595-604.
    Preprint
    
    

60. Graph representation functions computable by finite automata
    V.V. Lozin
    Journal of Automata, Languages and Combinatorics, 13 (2008) 73-90.
    Preprint
    
    

59. The clique-width of bipartite graphs in monogenic classes
    V.V. Lozin and J. Volz
    International Journal of Foundations of Computer Science, 19 (2008) 477-494.
    Preprint
    
    

58. Gearing Optimization
    V.V. Lozin
    Optimization and Engineering, 9 (2008) 201-211.
    Preprint The original publication is available at www.springerlink.com.
    
    

57. Boundary classes of planar graphs
    V.V. Lozin
    Combinatorics, Probability and Computing, 17 (2008) 287-295.
    Preprint
    
    

56. On Finding Augmenting Graphs
    V.V. Lozin and M. Milanic
    Discrete Applied Mathematics, 156 (2008) 2517-2529.
    Preprint
    
    

55. A note on k-colorability of P5-free graphs
    C. Hoang, M. Kaminski, V. Lozin, J. Sawada, and X. Shu
    Lecture Notes in Computer Science, 5162 (2008) 387-394.
    
    

54. The maximum independent set problem in planar graphs
    Vladimir E. Alekseev, Vadim Lozin, Dmitriy Malyshev, and Martin Milanic
    Lecture Notes in Computer Science, 5162 (2008) 96-107.
    
    

53. Independent sets of maximum weight in apple-free graphs
    A. Brandstädt, T. Klembt, V.V. Lozin and R. Mosca
    Lecture Notes in Computer Science 5369 (2008) 849-859
    
    

52. From tree-width to clique-width: excluding a unit interval graph
    V.V.  Lozin
    Lecture Notes in Computer Science 5369 (2008) 872-883
    

51. NP-hard Graph problems and Boundary Classes of Graphs
    V.E. Alekseev, R. Boliac, D.V. Korobitsyn and V.V. Lozin
    Theoretical Computer Science, 389 (2007) 219-236.
    Preprint
    
    

50. Maximum k-regular induced subgraphs
    D. Cardoso, M. Kaminski and V.V. Lozin
    Journal of Combinatorial Optimization, 14 (2007) 455-463.
    Preprint 
    
    

49. The Relative Clique-Width of a Graph
    V.V. Lozin and D. Rautenbach
    Journal of Combinatorial Theory B, 95 (2007) 846-858.
    Preprint 
    
    

48. Vertex 3-colorability of claw-free graphs
    M. Kaminski and V.V. Lozin
    Algorithmic Operations Research, 2 (2007) 15-21.
    Preprint
    
    

47. Coloring edges and vertices of graphs without short or long cycles
    M. Kaminski and V.V. Lozin
    Contributions to Discrete Mathematics, 2 (2007) 61-66.
    Preprint
    
    

46. Minimal Universal Bipartite Graphs
    V.V. Lozin and Gabor Rudolf
    Ars Combinatoria, 84 (2007) 345-356.
    Preprint 
    
    

45. Maximum Independent Sets in Graphs of Low Degree
    V.V. Lozin and Martin Milanic
    Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2007) 874-880.
    
    

44. Treewidth and Optimization in Bounded Degree Graphs
    V.V. Lozin and M. Milanic
    Lecture Notes in Computer Science, 4769 (2007) 45-54.
    
    

43. Clique-Width for Four-Vertex Forbidden Subgraphs
    A. Brandstädt, J. Engelfriet, Hoang-Oanh Le and V.V. Lozin
    Theory of Computing Systems, 34 (2006) 561-590.
    Extended abstract appeared in [34].
    Preprint 
    
    

42. Augmenting chains in graphs without a skew star
    M.U. Gerber, A. Hertz and V.V. Lozin
    Journal of Combinatorial Theory, B, 96 (2006) 352-366.
    Preprint 
    
    

41. Polar Graphs and Maximal Independent Sets
    V.V. Lozin and R. Mosca
    Discrete Mathematics, 306 (2006) 2901-2908.
    Preprint
    
    

40. The Tree- and Clique-width of Bipartite Graphs in Special Classes
    V.V. Lozin and Dieter Rautenbach
    Australasian Journal of Combinatorics, 34 (2006) 57-67.
    Preprint 
    
    

39. A Polynomial Algorithm to Find an Independent Set of Maximum Weight in a Fork-free Graph (Extended abstract)
    V.V. Lozin and Martin Milanic
    Proceedings of the ACM-SIAM Symposium on Discrete Algorithms SODA'06, (2006) 26-30.
    Preprint 
    
    

38. Bisplit Graphs
    A. Brandstädt, Peter L. Hammer, Van Bang Le and V.V. Lozin
    Discrete Mathematics, 299 (2005) 11-32.
    Preprint 
    
    

37. Graphs of low chordality
    L.S. Chandran, V.V. Lozin and C.R. Subramanian
    Discrete Mathematics and Theoretical Computer Science, 7 (2005) 25-36.
    Preprint 
    
    

36. Independent Sets in Extensions of 2K2-free Graphs
    V.V. Lozin and R. Mosca
    Discrete Applied Mathematics, 146 (2005) 74-80.
    Preprint 
    
    

35. Between 2- and 3-colorability
    V.V. Lozin
    Information Processing Letters, 94 (2005) 179-182.
    Preprint
    
    

34. Clique-Width for Four-Vertex Forbidden Subgraphs (Extended abstract)
    A. Brandstädt, J. Engelfriet, Hoang-Oanh Le and V.V. Lozin
    Lecture Notes in Computer Science, 3623 (2005) 185-196.
    
    

33. The Maximum Independent Set Problem and Augmenting Graphs
    A. Hertz and V.V. Lozin
    "Graph Theory and Combinatorial Optimization" Springer, 2005, 69-99.
    Preprint 
    
    

32. Augmenting graphs for independent sets
    V.E. Alekseev and V.V. Lozin
    Discrete Applied Mathematics, 145 (2004) 3-10.
    Preprint 
    
    

31. Boundary classes of graphs for the dominating set problem
    V.E. Alekseev, D.V. Korobitsyn and V.V. Lozin
    Discrete Mathematics, 285 (2004) 1-6.
    Preprint 
    
    

30. On the band-, tree- and clique-width of graphs with bounded vertex degree
    V.V. Lozin and Dieter Rautenbach
    SIAM J. Discrete Math., 18 (2004) 195-206.
    Preprint 
    
    

29. On computing the dissociation number of bipartite graphs
    R. Boliac, K. Cameron and V.V. Lozin
    Ars Combinatoria, 72 (2004) 241-253.
    Preprint 
    
    

28. Chordal bipartite graphs of bounded tree- and clique-width
    V.V. Lozin and Dieter Rautenbach
    Discrete Mathematics, 283 (2004) 151-158.
    Preprint 
    
    

27. New results on generalized graph coloring
    V.E. Alekseev, A. Farrugia and V.V. Lozin
    Discrete Mathematics and Theoretical Computer Science, 6 (2004) 215-222.
    Preprint  
    
    

26. Local transformations of graphs preserving independence number
    V.E. Alekseev and V.V. Lozin
    Discrete Applied Mathematics, 135 (2004) 16-29.
    Abstract
    
    

25. Struction Revisited
    G. Alexe, Peter L. Hammer, V.V. Lozin and Dominique de Werra
    Discrete Applied Mathematics, 132 (2004) 27-46.
    Preprint 
    
    

24. Stable sets in two subclasses of banner-free graphs
    M.U. Gerber, A. Hertz and V.V. Lozin
    Discrete Applied Mathematics, 132 (2004) 121-136 .
    Preprint 
    
    

23. Some results on graphs without long induced paths
    V.V. Lozin and Dieter Rautenbach
    Information Processing Letters, 88 (2003) 167-171.
    Preprint 
    
    

22. An augmenting graph approach to the stable set problem in P5-free graphs
    R. Boliac  and V.V. Lozin
    Discrete Applied Mathematics 131 (2003) 567-575.
    Preprint 
    
    

21. Robust algorithms for the stable set problem
    M.U. Gerber and V.V. Lozin
    Graphs and Combinatorics, 19 (2003) 347-356.
    Preprint 
    
    

20. The 3-colorability problem on graphs with maximum degree four
    Martin Kochol, V.V. Lozin and Bert Randerath
    SIAM J. Computing, 32 (2003) 1128-1139.
    Preprint 
    
    

19. Independent domination in finitely defined classes of graphs
    R. Boliac  and V.V. Lozin
    Theoretical Computer Science 301 (2003) 271-284.
    Preprint 
    
    

18. Finding augmenting chains in extensions of claw-free graphs
    A. Hertz, V.V. Lozin and D. Schindl
    Information Processing Letters 86 (2003) 311-316.
    Preprint
    
    

17. On the linear structure and clique-width of bipartite permutation graphs
    A. Brandstädt and V.V. Lozin
    Ars Combinatoria 67 (2003) 273-281.
    Preprint
    
    

16. Independent sets of maximum weight in (p,q)-colorable graphs
    V.E. Alekseev and V.V. Lozin
    Discrete Mathematics 265 (2003) 351-356.
    Preprint 
    
    

15. On the stable set problem in special P5-free graphs
    M.U. Gerber and V.V. Lozin
    Discrete Applied Mathematics 125 (2003) 215-224.
    Preprint 
    
    

14. On the clique-width of graphs in hereditary classes
    R. Boliac  and V.V. Lozin
    Lecture Notes in Computer Science 2518 (2002) 44-54.
    Preprint 
    
    

13. Bipartite graphs without a skew star
    V.V. Lozin
    Discrete Mathematics 257 (2002) 83-100.
    Preprint 
    
    

12. On maximum induced matchings in bipartite graphs
    V.V. Lozin
    Information Processing Letters 81 (1) (2002) 7-11.
    Preprint 
    
    

11. An attractive class of bipartite graphs
    R. Boliac  and V.V. Lozin
    Discussiones Mathematicae Graph Theory 21 (2) (2001) 293-301.
    Preprint  
    
    

10. A note on alpha-redundant vertices in graphs
    A. Brandstädt and V.V. Lozin
    Discrete Applied Mathematics 108 (2001) 301-308
    Abstract 
    
    

9. On orthogonal representations of graphs
   V.E. Alekseev and V.V. Lozin
   Discrete Mathematics 226 (2001) 359-363
   Preprint 
   
   

8. On the jump number problem in hereditary classes of bipartite graphs
   M.U. Gerber and V.V. Lozin
   Order, 17 (4):377-385, 2000.
   Abstract
   
   

7. Conic reduction of graphs for the stable set problem
   V.V. Lozin
   Discrete Mathematics 222 (2000) 199-211
   Abstract 
   
   

6. Stability in P5- and banner-free graphs
   V.V. Lozin
   European Journal of Operational Research 125 (2000) 292-297
   Abstract 
   
   

5. On a generalization of bi-complement reducible graphs
   V.V. Lozin
   Lecture Notes in Computer Science Vol. 1893 (2000) 528-537
   Abstract 
   
   

4. E-free bipartite graphs
   V.V. Lozin
   Discrete Analysis and Operations Research Ser 1, Vol. 7 (2000) 49-66 (in Russian).
   Abstract 
   
   

3. On minimal universal graphs for hereditary classes
   V.V. Lozin
   Discrete Mathematics and Applications 7 (1997) 295-304
   translation from Diskretn. Mat. 9 No.2 (1997) 106-115 .
   Abstract 
   

2. Canonical partitions of graphs
   V.V. Lozin
   Discrete analysis and operations research. Mathematics and its Applications. 355 (1996) 163-172
   translation from Sibirsk. Zh. Issled. Oper Vol.1 No. 3 (1994) 49-59 .
   Abstract
   
   

1. Vertex coding of graphs in automatic decoding
   V.V. Lozin
   Combinatorial-algebraic methods in applied mathematics (1986) 73-83 ( in Russian).
   Abstract 
   
   

Non-refereed contributions

8. Maximum independent sets in planar graphs
   V.V. Lozin and R. Mosca
   RUTCOR Research Report RRR 40-2004
   Postscript file
   
   

7. On hereditary properties of the class of graphs with convex quadratic stability number
   D.M. Cardoso and V.V. Lozin
   Universidade de Aveiro. Cadernos de Matemática CM/I-50 (1999)
   PDF file 
   
   

6. Elements of combinatorics (study guide)
   V.E. Alekseev and V.V. Lozin
   Nizhny Novgorod University (1998) ( in Russian).
   Word file
   
   

5. On optimal coding of graphs from unitary classes
   V.V. Lozin
   Bulletin of Nizhny Novgorod University (1998) 194-198 ( in Russian).
   
   

4. Analytical representation of rotating frequency graphs
   O.A. Budekov and V.V. Lozin
   Bulletin of the Russian Academy of Technological Sciences, (1997) 100-105 ( in Russian).
   
   

3. On local transformations of graphs
   V.V. Lozin
   Proc. of the 2-nd International Conference "Mathematical Algorithms" (1997) 7-13 ( in Russian).
   
   

2. Locally-bounded coverings and coding of graphs
   V.V. Lozin
   Bulletin of Nizhny Novgorod University (1995) 106-108 ( in Russian).
   
   

1. On k-ary coding of graphs
   V.V. Lozin
   Combinatorial-algebraic methods in discrete optimization (1988) 80-95 ( in Russian).