Dr Vadim Lozin
 |
Vadim LozinAssociate Professor Office: B2.10 |
Research Interests: Graph theory, combinatorics, discrete mathematics
Teaching Responsibilities 2011/12:
Term 1: MA241 Combinatorics
Term 2: MA4J3 Graph Theory
Most relevant recent publications:
Lozin, V, Minimal classes of graphs of unbounded clique-width, Annals of Combinatorics 15 , (2011) 707–722.
Lozin, V, Stability preserving transformations of graphs, Annals of Operations Research 188, (2011) 331–341.
Lozin, V, A decidability result for the dominating set problem, Theoretical Computer Science 411, (2010) 4023–4027.
Lozin, V, Allen, P, and Rao, M, Clique-width and the speed of hereditray properties, Electronic Journal of Combinatorics 16, (2009) Research Paper 35.
Lozin, V, Boundary classes of planar graphs, Combinatorics, Probability and Computing 17, (2008) 287-295.
Lozin, V, Rautenbach, D, The relative clique-width of a graph , Journal of Combinatorial Theory Series B 97, (2007) 846-858.
Lozin, V, Gerber, M U and Hertz, A, Augmenting chains in graphs without a skew star, Journal of Combinatorial Theory Series B 96, (2006) 352-366.
Lozin, V, Brandstadt, A, Engelfriet, J and Le, H-O, Clique-Width for Four-Vertex Forbidden Subgraphs, Theory of Computing Systems 39, (2006) 561-590.
Lozin, V, Alekseev, V E and Korobitsyn, D V, Boundary classes of graphs for the dominating set problem, Discrete Mathematics 285, (2004) 1-6.
Lozin, V, Kochol, M and Randerath, B, The 3-colorability problem on graphs with maximum degree four, SIAM Journal on Computing 32, (2003) 1128-1139.
I hold a joint appointment with the Centre for Discrete Mathematics and its Applications (DIMAP)
