Vadim V. Lozin

	2012
81		Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries: Colouring vertices of triangle-free graphs without forests. Discrete Mathematics 312(7): 1372-1385 (2012)
80		Vadim V. Lozin, Colin Mayhill, Victor Zamaraev: Locally bounded coverings and factorial properties of graphs. Eur. J. Comb. 33(4): 534-543 (2012)
	2011
79		Vadim V. Lozin: Stability preserving transformations of graphs. Annals OR 188(1): 331-341 (2011)
78		Domingos Moreira Cardoso, Nicholas Korpelainen, Vadim V. Lozin: On the complexity of the dominating induced matching problem in hereditary classes of graphs. Discrete Applied Mathematics 159(7): 521-531 (2011)
77		Nicholas Korpelainen, Vadim V. Lozin: Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics 311(16): 1813-1822 (2011)
76		Vadim V. Lozin, Colin Mayhill, Victor Zamaraev: A Note on the Speed of Hereditary Graph Properties. Electr. J. Comb. 18(1): (2011)
75		Nicholas Korpelainen, Vadim V. Lozin: Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory 67(3): 235-249 (2011)
74		Vadim V. Lozin, Colin Mayhill: Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. Order 28(3): 513-522 (2011)
73		Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin: Boundary properties of graphs for algorithmic graph problems. Theor. Comput. Sci. 412(29): 3545-3554 (2011)
	2010
72		Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach: Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA 2010: 1-9
71		Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin: Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC 2010: 320-327
70		Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries: Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195
69		Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca: On Independent Vertex Sets in Subclasses of Apple-Free Graphs. Algorithmica 56(4): 383-393 (2010)
68		Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-Colorability of P5-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010)
67		Vadim V. Lozin, Martin Milanic: On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. 14(2): 269-286 (2010)
66		Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca: Independent Sets of Maximum Weight in Apple-Free Graphs. SIAM J. Discrete Math. 24(1): 239-254 (2010)
65		Vadim V. Lozin: A decidability result for the dominating set problem. Theor. Comput. Sci. 411(44-46): 4023-4027 (2010)
	2009
64		Vadim V. Lozin: A Note on the Parameterized Complexity of the Maximum Independent Set Problem. CTW 2009: 40-43
63		Domingos Moreira Cardoso, Vadim V. Lozin: Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 77-86
62		Nicholas Korpelainen, Vadim V. Lozin: Bipartite Graphs of Large Clique-Width. IWOCA 2009: 385-395
61		Marcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics 157(12): 2747-2761 (2009)
60		Peter Allen, Vadim V. Lozin, Michaël Rao: Clique-Width and the Speed of Hereditary Properties. Electr. J. Comb. 16(1): (2009)
59		Arie M. C. A. Koster, Vadim V. Lozin: DIMAP Workshop on Algorithmic Graph Theory. Electronic Notes in Discrete Mathematics 32: 1 (2009)
58		Vadim V. Lozin: Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. Electronic Notes in Discrete Mathematics 34: 127-131 (2009)
57		Vadim V. Lozin, Raffaele Mosca: Maximum independent sets in subclasses of P5-free graphs. Inf. Process. Lett. 109(6): 319-324 (2009)
	2008
56		Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca: Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858
55		Vadim V. Lozin: From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ISAAC 2008: 871-882
54		Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394
53		Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic: The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107
52		Vadim V. Lozin: Boundary Classes of Planar Graphs. Combinatorics, Probability & Computing 17(2): 287-295 (2008)
51		Vadim V. Lozin, Martin Milanic: On finding augmenting graphs. Discrete Applied Mathematics 156(13): 2517-2529 (2008)
50		Vadim V. Lozin, Jordan Volz: The Clique-Width of Bipartite Graphs in Monogenic Classes. Int. J. Found. Comput. Sci. 19(2): 477-494 (2008)
49		Vadim V. Lozin, Martin Milanic: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. J. Discrete Algorithms 6(4): 595-604 (2008)
48		Vadim V. Lozin: Graph Representation Functions Computable by Finite Automata. Journal of Automata, Languages and Combinatorics 13(1): 73-90 (2008)
	2007
47		Vadim V. Lozin, Martin Milanic: On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110
46		Vadim V. Lozin, Martin Milanic: Maximum independent sets in graphs of low degree. SODA 2007: 874-880
45		Vadim V. Lozin, Martin Milanic: Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54
44		Marcin Kaminski, Vadim V. Lozin: Vertex 3-colorability of Claw-free Graphs. Algorithmic Operations Research 2(1): (2007)
43		Vadim V. Lozin, Gábor Rudolf: Minimal Universal Bipartite Graphs. Ars Comb. 84: (2007)
42		Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-colourability of P_5-free graphs in polynomial time CoRR abs/cs/0702043: (2007)
41		Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin: Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007)
40		Vadim V. Lozin, Dieter Rautenbach: The relative clique-width of a graph. J. Comb. Theory, Ser. B 97(5): 846-858 (2007)
39		Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. 389(1-2): 219-236 (2007)
	2006
38		Vadim V. Lozin, Martin Milanic: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. SODA 2006: 26-30
37		Marcin Kaminski, Vadim V. Lozin: Polynomial-time algorithm for vertex k-colorability of P_5-free graphs CoRR abs/cs/0607115: (2006)
36		Vadim V. Lozin, Raffaele Mosca: Polar graphs and maximal independent sets. Discrete Mathematics 306(22): 2901-2908 (2006)
35		Michael U. Gerber, Alain Hertz, Vadim V. Lozin: Augmenting chains in graphs without a skew star. J. Comb. Theory, Ser. B 96(3): 352-366 (2006)
34		Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006)
	2005
33		Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196
32		Vadim V. Lozin, Raffaele Mosca: Independent sets in extensions of 2K2-free graphs. Discrete Applied Mathematics 146(1): 74-80 (2005)
31		Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)
30		L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)
29		Vadim V. Lozin: Between 2- and 3-colorability. Inf. Process. Lett. 94(4): 179-182 (2005)
	2004
28		Rodica Boliac, Kathie Cameron, Vadim V. Lozin: On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. 72: (2004)
27		Vladimir E. Alekseev, Vadim V. Lozin: Local transformations of graphs preserving independence number. Discrete Applied Mathematics 135(1-3): 17-30 (2004)
26		Vladimir E. Alekseev, Vadim V. Lozin: Augmenting graphs for independent sets. Discrete Applied Mathematics 145(1): 3-10 (2004)
25		Vadim V. Lozin, Dieter Rautenbach: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Mathematics 283(1-3): 151-158 (2004)
24		Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin: Boundary classes of graphs for the dominating set problem. Discrete Mathematics 285(1-3): 1-6 (2004)
23		Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin: New Results on Generalized Graph Coloring. Discrete Mathematics & Theoretical Computer Science 6(2): 215-222 (2004)
22		Vadim V. Lozin, Dieter Rautenbach: On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. SIAM J. Discrete Math. 18(1): 195-206 (2004)
	2003
21		Andreas Brandstädt, Vadim V. Lozin: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67: (2003)
20		Michael U. Gerber, Vadim V. Lozin: On the stable set problem in special P5-free graphs. Discrete Applied Mathematics 125(2-3): 215-224 (2003)
19		Rodica Boliac, Vadim V. Lozin: An augmenting graph approach to the stable set problem in P5-free graphs. Discrete Applied Mathematics 131(3): 567-575 (2003)
18		Vadim V. Lozin, Dominique de Werra: Special issue on stability in graphs and related topics. Discrete Applied Mathematics 132(1-3): 1-2 (2003)
17		Michael U. Gerber, Alain Hertz, Vadim V. Lozin: Stable sets in two subclasses of banner-free graphs. Discrete Applied Mathematics 132(1-3): 121-136 (2003)
16		Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra: Struction revisited. Discrete Applied Mathematics 132(1-3): 27-46 (2003)
15		Vladimir E. Alekseev, Vadim V. Lozin: Independent sets of maximum weight in (p, q)-colorable graphs. Discrete Mathematics 265(1-3): 351-356 (2003)
14		Michael U. Gerber, Vadim V. Lozin: Robust Algorithms for the Stable Set Problem. Graphs and Combinatorics 19(3): 347-356 (2003)
13		Alain Hertz, Vadim V. Lozin, David Schindl: Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86(6): 311-316 (2003)
12		Vadim V. Lozin, Dieter Rautenbach: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4): 167-171 (2003)
11		Martin Kochol, Vadim V. Lozin, Bert Randerath: The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. 32(5): 1128-1139 (2003)
10		Rodica Boliac, Vadim V. Lozin: Independent domination in finitely defined classes of graphs. Theor. Comput. Sci. 1-3(301): 271-284 (2003)
	2002
9		Rodica Boliac, Vadim V. Lozin: On the Clique-Width of Graphs in Hereditary Classes. ISAAC 2002: 44-54
8		Vadim V. Lozin: Bipartite graphs without a skew star. Discrete Mathematics 257(1): 83-100 (2002)
7		Vadim V. Lozin: On maximum induced matchings in bipartite graphs. Inf. Process. Lett. 81(1): 7-11 (2002)
	2001
6		Andreas Brandstädt, Vadim V. Lozin: A note on alpha-redundant vertices in graphs. Discrete Applied Mathematics 108(3): 301-308 (2001)
5		Vladimir E. Alekseev, Vadim V. Lozin: On orthogonal representations of graphs. Discrete Mathematics 226(1-3): 359-363 (2001)
	2000
4		Vadim V. Lozin: On a Generalization of Bi-Complement Reducible Graphs. MFCS 2000: 528-538
3		Vadim V. Lozin: Conic reduction of graphs for the stable set problem. Discrete Mathematics 222(1-3): 199-211 (2000)
2		Vadim V. Lozin: Stability in P5- and banner-free graphs. European Journal of Operational Research 125(2): 292-297 (2000)
1		Vadim V. Lozin, Michael U. Gerber: On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. Order 17(4): 377-385 (2000)

Coauthor Index

1	Vladimir E. Alekseev	[5] [15] [23] [24] [26] [27] [39] [53]
2	Gabriela Alexe	[16]
3	Peter Allen	[60]
4	Rodica Boliac	[9] [10] [19] [28] [39]
5	Andreas Brandstädt	[6] [21] [31] [33] [34] [56] [66] [69]
6	Kathie Cameron	[28]
7	Domingos Moreira Cardoso	[41] [63] [78]
8	L. Sunil Chandran	[30]
9	Konrad Dabrowski	[70] [72] [81]
10	Joost Engelfriet	[33] [34]
11	Alastair Farrugia	[23]
12	Michael U. Gerber	[1] [14] [17] [20] [35]
13	Peter L. Hammer (Peter Ladislaw Hammer)	[16] [31]
14	Alain Hertz	[13] [17] [35]
15	Chính T. Hoàng	[42] [54] [68]
16	Marcin Jakub Kaminski (Marcin Kaminski)	[37] [41] [42] [44] [54] [61] [68]
17	Tilo Klembt	[56] [69]
18	Martin Kochol	[11]
19	Dmitry V. Korobitsyn	[24] [39]
20	Nicholas Korpelainen	[62] [71] [73] [75] [77] [78]
21	Arie M. C. A. Koster	[59]
22	Hoàng-Oanh Le	[33] [34]
23	Van Bang Le	[31]
24	Dmitriy S. Malyshev	[53] [73]
25	Colin Mayhill	[74] [76] [80]
26	Martin Milanic	[38] [45] [46] [47] [49] [51] [53] [61] [67]
27	Raffaele Mosca	[32] [36] [56] [57] [66] [69]
28	Haiko Müller	[72]
29	Rajiv Raman	[70] [81]
30	Bert Randerath	[11]
31	Michaël Rao	[60]
32	Dieter Rautenbach	[12] [22] [25] [40] [72]
33	Bernard Ries	[70] [81]
34	Gábor Rudolf	[43]
35	Joe Sawada	[42] [54] [68]
36	David Schindl	[13]
37	Xiao Shu	[42] [54] [68]
38	C. R. Subramanian	[30]
39	Alexander Tiskin (Alexandre Tiskin)	[71] [73]
40	Jordan Volz	[50]
41	Dominique de Werra	[16] [18]
42	Victor Zamaraev	[76] [80]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page