The MathNet Korea
Information Center for Mathematical Science

국내수학자

Information Center for Mathematical Science

국외수학자

Vadim Lozin
이름 Vadim Lozin 영어이름 Vadim Lozin
이메일 mailV.Lozin@warwick.ac.uk 소속기관 University of Warwick
home Vertex coding of graphs in automatic decoding. Gorʹkov. Gos. Univ. (1986), Vol , Pages 73-83,202-
home Canonical partitions of graphs and their application to the coding of graphs. Sibirsk. Zh. Issled. Oper. (1994), Vol 1, Pages 49-59
home On minimal universal graphs for hereditary classes. Discrete Math. Appl. (1997), Vol 7, Pages 295-304
home On local transformations of graphs that preserve the independence number. Diskretn. Anal. Issled. Oper. Ser. 1 (1998), Vol 5, Pages 3-19
home $E$-free bipartite graphs. Diskretn. Anal. Issled. Oper. Ser. 1 (2000), Vol 7, Pages 49-66
home Conic reduction of graphs for the stable set problem. Discrete Math. (2000), Vol 222, Pages 199-211
home Stability in $P_5$- and banner-free graphs. European J. Oper. Res. (2000), Vol 125, Pages 292-297
home On the jump number problem in hereditary classes of bipartite graphs. Order (2000), Vol 17, Pages 377-385
home On a generalization of bi-complement reducible graphs. Lecture Notes in Comput. Sci. (2000), Vol , Pages 528-538
home On orthogonal representations of graphs. Discrete Math. (2001), Vol 226, Pages 359-363
home A note on $\alpha$-redundant vertices in graphs. Discrete Appl. Math. (2001), Vol 108, Pages 301-308
home An attractive class of bipartite graphs. Discuss. Math. Graph Theory (2001), Vol 21, Pages 293-301
home On maximum induced matchings in bipartite graphs. Inform. Process. Lett. (2002), Vol 81, Pages 7-11
home Bipartite graphs without a skew star. Discrete Math. (2002), Vol 257, Pages 83-100
home On the clique-width of graphs in hereditary classes. Lecture Notes in Comput. Sci. (2002), Vol , Pages 44-54
home On the stable set problem in special $P_5$-free graphs. Discrete Appl. Math. (2003), Vol 125, Pages 215-224
home Independent sets of maximum weight in $(p,q)$-colorable graphs. Discrete Math. (2003), Vol 265, Pages 351-356
home On the linear structure and clique-width of bipartite permutation graphs. Ars Combin. (2003), Vol 67, Pages 273-281
home Independent domination in finitely defined classes of graphs. Theoret. Comput. Sci. (2003), Vol 301, Pages 271-284
home Finding augmenting chains in extensions of claw-free graphs. Inform. Process. Lett. (2003), Vol 86, Pages 311-316
home The 3-colorability problem on graphs with maximum degree four. SIAM J. Comput. (2003), Vol 32, Pages 1128-1139
home Robust algorithms for the stable set problem. Graphs Combin. (2003), Vol 19, Pages 347-356
home Some results on graphs without long induced paths. Inform. Process. Lett. (2003), Vol 88, Pages 167-171
home An augmenting graph approach to the stable set problem in $P_5$-free graphs. Discrete Appl. Math. (2003), Vol 131, Pages 567-575
home Struction revisited. Stability in graphs and related topics. Discrete Appl. Math. (2003), Vol 132, Pages 27-46
home Stable sets in two subclasses of banner-free graphs. Stability in graphs and related topics. Discrete Appl. Math. (2003), Vol 132, Pages 121-136
home New results on generalized graph coloring. Discrete Math. Theor. Comput. Sci. (2004), Vol 6, Pages 215-221
home Local transformations of graphs preserving independence number [MR1657893]. Russian translations. II. Discrete Appl. Math. (2004), Vol 135, Pages 17-30
home Chordal bipartite graphs of bounded tree- and clique-width. Discrete Math. (2004), Vol 283, Pages 151-158
home On computing the dissociation number and the induced matching number of bipartite graphs. Ars Combin. (2004), Vol 72, Pages 241-253
home Boundary classes of graphs for the dominating set problem. Discrete Math. (2004), Vol 285, Pages 1-6
home Augmenting graphs for independent sets. Discrete Appl. Math. (2004), Vol 145, Pages 3-10
home On the band-, tree-, and clique-width of graphs with bounded vertex degree. SIAM J. Discrete Math. (2004), Vol 18, Pages 195-206
home Independent sets in extensions of $2K_2$-free graphs. Discrete Appl. Math. (2005), Vol 146, Pages 74-80
home Between 2- and 3-colorability. Inform. Process. Lett. (2005), Vol 94, Pages 179-182
home Graphs of low chordality. Discrete Math. Theor. Comput. Sci. (2005), Vol 7, Pages 25-35
home Bisplit graphs. Discrete Math. (2005), Vol 299, Pages 11-32
home The maximum independent set problem and augmenting graphs. GERAD 25th Anniv. Ser. (2005), Vol , Pages 69-99
home Clique-width for four-vertex forbidden subgraphs. Lecture Notes in Comput. Sci. (2005), Vol , Pages 185-196
home The tree- and clique-width of bipartite graphs in special classes. Australas. J. Combin. (2006), Vol 34, Pages 57-67
home Augmenting chains in graphs without a skew star. J. Combin. Theory Ser. B (2006), Vol 96, Pages 352-366
home Clique-width for 4-vertex forbidden subgraphs. Theory Comput. Syst. (2006), Vol 39, Pages 561-590
home Polar graphs and maximal independent sets. Discrete Math. (2006), Vol 306, Pages 2901-2908
home A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (2006), Vol , Pages 26-30
home Coloring edges and vertices of graphs without short or long cycles. Contrib. Discrete Math. (2007), Vol 2, Pages 61-66
home Vertex 3-colorability of claw-free graphs. Algorithmic Oper. Res. (2007), Vol 2, Pages 15-21
home Minimal universal bipartite graphs. Ars Combin. (2007), Vol 84, Pages 345-356
home The relative clique-width of a graph. J. Combin. Theory Ser. B (2007), Vol 97, Pages 846-858
home NP-hard graph problems and boundary classes of graphs. Theoret. Comput. Sci. (2007), Vol 389, Pages 219-236
home Maximum $k$-regular induced subgraphs. J. Comb. Optim. (2007), Vol 14, Pages 455-463
home Tree-width and optimization in bounded degree graphs. Lecture Notes in Comput. Sci. (2007), Vol , Pages 45-54
home Maximum independent sets in graphs of low degree. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2007), Vol , Pages 874-880
home Boundary classes of planar graphs. Combin. Probab. Comput. (2008), Vol 17, Pages 287-295
home Gearing optimization. Optim. Eng. (2008), Vol 9, Pages 201-211
home The clique-width of bipartite graphs in monogenic classes. Internat. J. Found. Comput. Sci. (2008), Vol 19, Pages 477-494
home On finding augmenting graphs. Discrete Appl. Math. (2008), Vol 156, Pages 2517-2529
home A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms (2008), Vol 6, Pages 595-604
home Graph representation functions computable by finite automata. J. Autom. Lang. Comb. (2008), Vol 13, Pages 73-90
home The maximum independent set problem in planar graphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 96-107
home A note on $k$-colorability of $P_5$-free graphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 387-394
home Independent sets of maximum weight in apple-free graphs. Lecture Notes in Comput. Sci. (2008), Vol , Pages 848-858
home From tree-width to clique-width: excluding a unit interval graph. Lecture Notes in Comput. Sci. (2008), Vol , Pages 871-882
home Maximum independent sets in subclasses of $P_5$-free graphs. Inform. Process. Lett. (2009), Vol 109, Pages 319-324
home Clique-width and the speed of hereditary properties. Electron. J. Combin. (2009), Vol 16, Pages 11
home Recent developments on graphs of bounded clique-width. Discrete Appl. Math. (2009), Vol 157, Pages 2747-2761
home Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. Electron. Notes Discrete Math. (2009), Vol , Pages 127-131
home Bipartite graphs of large clique-width. Lecture Notes in Comput. Sci. (2009), Vol , Pages 385-395
home Dominating induced matchings. Lecture Notes in Comput. Sci. (2009), Vol , Pages 77-86
home On independent vertex sets in subclasses of apple-free graphs. Algorithmica (2010), Vol 56, Pages 383-393
home Deciding $k$-colorability of $P_5$-free graphs in polynomial time. Algorithmica (2010), Vol 57, Pages 74-81
home Independent sets of maximum weight in apple-free graphs. SIAM J. Discrete Math. (2010), Vol 24, Pages 239-254
home On the maximum independent set problem in subclasses of planar graphs. J. Graph Algorithms Appl. (2010), Vol 14, Pages 269-286
home A decidability result for the dominating set problem. Theoret. Comput. Sci. (2010), Vol 411, Pages 4023-4027
home Colouring vertices of triangle-free graphs. Lecture Notes in Comput. Sci. (2010), Vol , Pages 184-195
home On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Appl. Math. (2011), Vol 159, Pages 521-531
home Two forbidden induced subgraphs and well-quasi-ordering. Discrete Math. (2011), Vol 311, Pages 1813-1822
home Bipartite induced subgraphs and well-quasi-ordering. J. Graph Theory (2011), Vol 67, Pages 235-249
home Boundary properties of graphs for algorithmic graph problems. Theoret. Comput. Sci. (2011), Vol 412, Pages 3545-3554
home Canonical antichains of unit interval and bipartite permutation graphs. Order (2011), Vol 28, Pages 513–522
home A note on the speed of hereditary graph properties. Electron. J. Combin. (2011), Vol 18, Pages Paper 157
home Stability preserving transformations of graphs. Ann. Oper. Res. (2011), Vol 188, Pages 331–341
home Dominating induced matchings in graphs without a skew star. J. Discrete Algorithms (2014), Vol 26, Pages 45–55
home Split permutation graphs. Graphs Combin. (2014), Vol 30, Pages 633–646
home Corrigendum to "Locally bounded coverings and factorial properties of graphs'' [European J. Combin. 33 (2012) 534–543] European J. Combin. (2014), Vol 40, Pages 168
home Graphs without large apples and the maximum weight independent set problem. Graphs Combin. (2014), Vol 30, Pages 395–410
home Deciding WQO for factorial languages. Language and automata theory and applications, 68–79 Lecture Notes in Comput. Sci. (2013), Vol 7810, Pages
home Universal graphs and universal permutations. Discrete Math. Algorithms Appl. (2013), Vol 5, Pages 1350038, 1
home Sparse regular induced subgraphs in 2P_3 -free graphs. Discrete Optim. (2013), Vol 10, Pages 304–309
home Boundary properties of well-quasi-ordered sets of graphs. Order (2013), Vol 30, Pages 723–735
home Boundary properties of the satisfiability problems. Inform. Process. Lett. (2013), Vol 113, Pages 313–317
home New results on maximum induced matchings in bipartite graphs and beyond. Theoret. Comput. Sci. (2013), Vol 478, Pages 33–40
home Critical properties of graphs of bounded clique-width. Discrete Math. (2013), Vol 313, Pages 1035–1044
home GO VII Meeting, Ovronnaz (CH), June 13–17, 2010[Editorial]. Discrete Appl. Math. (2013), Vol 161, Pages 453
home On hereditary properties of the class of graphs with convex quadratic stability number. Translated from Sovrem. Mat. Prilozh., Vol. 71, 2011 J. Math. Sci. (N. Y.) (2012), Vol 182, Pages 227–232
home Maximum regular induced subgraphs in 2P_3 -free graphs. Theoret. Comput. Sci. (2012), Vol 460, Pages 26–33
home On factorial properties of chordal bipartite graphs. Discrete Math. (2012), Vol 312, Pages 2457–2465
home Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms (2012), Vol 14, Pages 207–213
home Colouring vertices of triangle-free graphs without forests. Discrete Math. (2012), Vol 312, Pages 1372–1385
home Locally bounded coverings and factorial properties of graphs. European J. Combin. (2012), Vol 33, Pages 534–543
home Minimal classes of graphs of unbounded clique-width. Ann. Comb. (2011), Vol 15, Pages 707–722
home Parameterized algorithms for the independent set problem in some hereditary graph classes. Combinatorial algorithms, 1–9 Lecture Notes in Comput. Sci. (2011), Vol 6460, Pages