DBLP: Vadim V. Lozin

	2013
j70		Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries: GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discrete Applied Mathematics 161(4-5): 453 (2013)
j69		Vadim V. Lozin, Christopher Purcell: Boundary properties of the satisfiability problems. Inf. Process. Lett. 113(9): 313-317 (2013)
j68		Konrad Dabrowski, Marc Demange, Vadim V. Lozin: New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478: 33-40 (2013)
c19		Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov: Deciding WQO for Factorial Languages. LATA 2013: 68-79
	2012
j67		Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries: Colouring vertices of triangle-free graphs without forests. Discrete Mathematics 312(7): 1372-1385 (2012)
j66		Konrad Dabrowski, Vadim V. Lozin, Victor Zamaraev: On factorial properties of chordal bipartite graphs. Discrete Mathematics 312(16): 2457-2465 (2012)
j65		Vadim V. Lozin, Colin Mayhill, Victor Zamaraev: Locally bounded coverings and factorial properties of graphs. Eur. J. Comb. 33(4): 534-543 (2012)
j64		Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14: 207-213 (2012)
j63		Vadim V. Lozin, Raffaele Mosca: Maximum regular induced subgraphs in 2 P₃-free graphs. Theor. Comput. Sci. 460: 26-33 (2012)
c18		Aistis Atminas, Vadim V. Lozin, Igor Razgon: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT 2012: 142-152
	2011
j62		Vadim V. Lozin: Stability preserving transformations of graphs. Annals OR 188(1): 331-341 (2011)
j61		Vadim V. Lozin, Colin Mayhill, Victor Zamaraev: A Note on the Speed of Hereditary Graph Properties. Electr. J. Comb. 18(1) (2011)
j60		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)
j59		Nicholas Korpelainen, Vadim V. Lozin: Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics 311(16): 1813-1822 (2011)
j58		Nicholas Korpelainen, Vadim V. Lozin: Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory 67(3): 235-249 (2011)
j57		Vadim V. Lozin, Colin Mayhill: Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. Order 28(3): 513-522 (2011)
j56		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
j55		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)
j54		Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-Colorability of P₅-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010)
j53		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)
j52		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)
j51		Vadim V. Lozin: A decidability result for the dominating set problem. Theor. Comput. Sci. 411(44-46): 4023-4027 (2010)
c17		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
c16		Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin: Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC 2010: 320-327
c15		Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries: Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195
	2009
j50		Peter Allen, Vadim V. Lozin, Michaël Rao: Clique-Width and the Speed of Hereditary Properties. Electr. J. Comb. 16(1) (2009)
j49		Marcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics 157(12): 2747-2761 (2009)
j48		Arie M. C. A. Koster, Vadim V. Lozin: DIMAP Workshop on Algorithmic Graph Theory. Electronic Notes in Discrete Mathematics 32: 1 (2009)
j47		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)
j46		Vadim V. Lozin, Raffaele Mosca: Maximum independent sets in subclasses of P₅-free graphs. Inf. Process. Lett. 109(6): 319-324 (2009)
c14		Domingos Moreira Cardoso, Vadim V. Lozin: Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 77-86
c13		Vadim V. Lozin: A Note on the Parameterized Complexity of the Maximum Independent Set Problem. CTW 2009: 40-43
c12		Nicholas Korpelainen, Vadim V. Lozin: Bipartite Graphs of Large Clique-Width. IWOCA 2009: 385-395
	2008
j45		Vadim V. Lozin: Boundary Classes of Planar Graphs. Combinatorics, Probability & Computing 17(2): 287-295 (2008)
j44		Vadim V. Lozin, Martin Milanic: On finding augmenting graphs. Discrete Applied Mathematics 156(13): 2517-2529 (2008)
j43		Vadim V. Lozin, Jordan Volz: The Clique-Width of Bipartite Graphs in Monogenic Classes. Int. J. Found. Comput. Sci. 19(2): 477-494 (2008)
j42		Vadim V. Lozin: Graph Representation Functions Computable by Finite Automata. Journal of Automata, Languages and Combinatorics 13(1): 73-90 (2008)
j41		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)
c11		Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca: Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858
c10		Vadim V. Lozin: From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ISAAC 2008: 871-882
c9		Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic: The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107
c8		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
	2007
j40		Marcin Kaminski, Vadim V. Lozin: Vertex 3-colorability of Claw-free Graphs. Algorithmic Operations Research 2(1) (2007)
j39		Vadim V. Lozin, Gábor Rudolf: Minimal Universal Bipartite Graphs. Ars Comb. 84 (2007)
j38		Vadim V. Lozin, Marcin Kaminski: Coloring edges and vertices of graphs without short or long cycles. Contributions to Discrete Mathematics 2(1) (2007)
j37		Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin: Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007)
j36		Vadim V. Lozin, Dieter Rautenbach: The relative clique-width of a graph. J. Comb. Theory, Ser. B 97(5): 846-858 (2007)
j35		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)
c7		Vadim V. Lozin, Martin Milanic: On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110
c6		Vadim V. Lozin, Martin Milanic: Maximum independent sets in graphs of low degree. SODA 2007: 874-880
c5		Vadim V. Lozin, Martin Milanic: Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54
i2		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)
	2006
j34		Vadim V. Lozin, Raffaele Mosca: Polar graphs and maximal independent sets. Discrete Mathematics 306(22): 2901-2908 (2006)
j33		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)
j32		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)
c4		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
i1		Marcin Kaminski, Vadim V. Lozin: Polynomial-time algorithm for vertex k-colorability of P_5-free graphs. CoRR abs/cs/0607115 (2006)
	2005
j31		Vadim V. Lozin, Raffaele Mosca: Independent sets in extensions of 2K₂-free graphs. Discrete Applied Mathematics 146(1): 74-80 (2005)
j30		Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)
j29		L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)
j28		Vadim V. Lozin: Between 2- and 3-colorability. Inf. Process. Lett. 94(4): 179-182 (2005)
c3		Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196
	2004
j27		Rodica Boliac, Kathie Cameron, Vadim V. Lozin: On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. 72 (2004)
j26		Vladimir E. Alekseev, Vadim V. Lozin: Local transformations of graphs preserving independence number. Discrete Applied Mathematics 135(1-3): 17-30 (2004)
j25		Vladimir E. Alekseev, Vadim V. Lozin: Augmenting graphs for independent sets. Discrete Applied Mathematics 145(1): 3-10 (2004)
j24		Vadim V. Lozin, Dieter Rautenbach: Chordal bipartite graphs of bounded tree- and clique-width. Discrete Mathematics 283(1-3): 151-158 (2004)
j23		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)
j22		Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin: New Results on Generalized Graph Coloring. Discrete Mathematics & Theoretical Computer Science 6(2): 215-222 (2004)
j21		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
j20		Andreas Brandstädt, Vadim V. Lozin: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003)
j19		Michael U. Gerber, Vadim V. Lozin: On the stable set problem in special P₅-free graphs. Discrete Applied Mathematics 125(2-3): 215-224 (2003)
j18		Rodica Boliac, Vadim V. Lozin: An augmenting graph approach to the stable set problem in P₅-free graphs. Discrete Applied Mathematics 131(3): 567-575 (2003)
j17		Vadim V. Lozin, Dominique de Werra: Special issue on stability in graphs and related topics. Discrete Applied Mathematics 132(1-3): 1-2 (2003)
j16		Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra: Struction revisited. Discrete Applied Mathematics 132(1-3): 27-46 (2003)
j15		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)
j14		Vladimir E. Alekseev, Vadim V. Lozin: Independent sets of maximum weight in (p, q)-colorable graphs. Discrete Mathematics 265(1-3): 351-356 (2003)
j13		Michael U. Gerber, Vadim V. Lozin: Robust Algorithms for the Stable Set Problem. Graphs and Combinatorics 19(3): 347-356 (2003)
j12		Alain Hertz, Vadim V. Lozin, David Schindl: Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86(6): 311-316 (2003)
j11		Vadim V. Lozin, Dieter Rautenbach: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4): 167-171 (2003)
j10		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)
j9		Rodica Boliac, Vadim V. Lozin: Independent domination in finitely defined classes of graphs. Theor. Comput. Sci. 1-3(301): 271-284 (2003)
	2002
j8		Vadim V. Lozin: Bipartite graphs without a skew star. Discrete Mathematics 257(1): 83-100 (2002)
j7		Vadim V. Lozin: On maximum induced matchings in bipartite graphs. Inf. Process. Lett. 81(1): 7-11 (2002)
c2		Rodica Boliac, Vadim V. Lozin: On the Clique-Width of Graphs in Hereditary Classes. ISAAC 2002: 44-54
	2001
j6		Andreas Brandstädt, Vadim V. Lozin: A note on alpha-redundant vertices in graphs. Discrete Applied Mathematics 108(3): 301-308 (2001)
j5		Vladimir E. Alekseev, Vadim V. Lozin: On orthogonal representations of graphs. Discrete Mathematics 226(1-3): 359-363 (2001)
j4		Rodica Boliac, Vadim V. Lozin: An attractive class of bipartite graphs. Discussiones Mathematicae Graph Theory 21(2): 293-301 (2001)
	2000
j3		Vadim V. Lozin: Conic reduction of graphs for the stable set problem. Discrete Mathematics 222(1-3): 199-211 (2000)
j2		Vadim V. Lozin: Stability in P₅- and banner-free graphs. European Journal of Operational Research 125(2): 292-297 (2000)
j1		Vadim V. Lozin, Michael U. Gerber: On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. Order 17(4): 377-385 (2000)
c1		Vadim V. Lozin: On a Generalization of Bi-Complement Reducible Graphs. MFCS 2000: 528-538

2013

j70

Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries: GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discrete Applied Mathematics 161(4-5): 453 (2013)

j69

Vadim V. Lozin, Christopher Purcell: Boundary properties of the satisfiability problems. Inf. Process. Lett. 113(9): 313-317 (2013)

j68

Konrad Dabrowski, Marc Demange, Vadim V. Lozin: New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478: 33-40 (2013)

c19

Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov: Deciding WQO for Factorial Languages. LATA 2013: 68-79

2012

j67

Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries: Colouring vertices of triangle-free graphs without forests. Discrete Mathematics 312(7): 1372-1385 (2012)

j66

Konrad Dabrowski, Vadim V. Lozin, Victor Zamaraev: On factorial properties of chordal bipartite graphs. Discrete Mathematics 312(16): 2457-2465 (2012)

j65

Vadim V. Lozin, Colin Mayhill, Victor Zamaraev: Locally bounded coverings and factorial properties of graphs. Eur. J. Comb. 33(4): 534-543 (2012)

j64

Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14: 207-213 (2012)

j63

Vadim V. Lozin, Raffaele Mosca: Maximum regular induced subgraphs in 2 P₃-free graphs. Theor. Comput. Sci. 460: 26-33 (2012)

c18

Aistis Atminas, Vadim V. Lozin, Igor Razgon: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths. SWAT 2012: 142-152

2011

j62

Vadim V. Lozin: Stability preserving transformations of graphs. Annals OR 188(1): 331-341 (2011)

j61

Vadim V. Lozin, Colin Mayhill, Victor Zamaraev: A Note on the Speed of Hereditary Graph Properties. Electr. J. Comb. 18(1) (2011)

j60

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)

j59

Nicholas Korpelainen, Vadim V. Lozin: Two forbidden induced subgraphs and well-quasi-ordering. Discrete Mathematics 311(16): 1813-1822 (2011)

j58

Nicholas Korpelainen, Vadim V. Lozin: Bipartite induced subgraphs and well-quasi-ordering. Journal of Graph Theory 67(3): 235-249 (2011)

j57

Vadim V. Lozin, Colin Mayhill: Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. Order 28(3): 513-522 (2011)

j56

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

j55

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)

j54

Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-Colorability of P₅-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010)

j53

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)

j52

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)

j51

Vadim V. Lozin: A decidability result for the dominating set problem. Theor. Comput. Sci. 411(44-46): 4023-4027 (2010)

c17

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

c16

Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin: Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. TAMC 2010: 320-327

c15

Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries: Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195

2009

j50

Peter Allen, Vadim V. Lozin, Michaël Rao: Clique-Width and the Speed of Hereditary Properties. Electr. J. Comb. 16(1) (2009)

j49

Marcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discrete Applied Mathematics 157(12): 2747-2761 (2009)

j48

Arie M. C. A. Koster, Vadim V. Lozin: DIMAP Workshop on Algorithmic Graph Theory. Electronic Notes in Discrete Mathematics 32: 1 (2009)

j47

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)

j46

Vadim V. Lozin, Raffaele Mosca: Maximum independent sets in subclasses of P₅-free graphs. Inf. Process. Lett. 109(6): 319-324 (2009)

c14

Domingos Moreira Cardoso, Vadim V. Lozin: Dominating Induced Matchings. Graph Theory, Computational Intelligence and Thought 2009: 77-86

c13

Vadim V. Lozin: A Note on the Parameterized Complexity of the Maximum Independent Set Problem. CTW 2009: 40-43

c12

Nicholas Korpelainen, Vadim V. Lozin: Bipartite Graphs of Large Clique-Width. IWOCA 2009: 385-395

2008

j45

Vadim V. Lozin: Boundary Classes of Planar Graphs. Combinatorics, Probability & Computing 17(2): 287-295 (2008)

j44

Vadim V. Lozin, Martin Milanic: On finding augmenting graphs. Discrete Applied Mathematics 156(13): 2517-2529 (2008)

j43

Vadim V. Lozin, Jordan Volz: The Clique-Width of Bipartite Graphs in Monogenic Classes. Int. J. Found. Comput. Sci. 19(2): 477-494 (2008)

j42

Vadim V. Lozin: Graph Representation Functions Computable by Finite Automata. Journal of Automata, Languages and Combinatorics 13(1): 73-90 (2008)

j41

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)

c11

Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca: Independent Sets of Maximum Weight in Apple-Free Graphs. ISAAC 2008: 848-858

c10

Vadim V. Lozin: From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ISAAC 2008: 871-882

Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic: The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107

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

2007

j40

Marcin Kaminski, Vadim V. Lozin: Vertex 3-colorability of Claw-free Graphs. Algorithmic Operations Research 2(1) (2007)

j39

Vadim V. Lozin, Gábor Rudolf: Minimal Universal Bipartite Graphs. Ars Comb. 84 (2007)

j38

Vadim V. Lozin, Marcin Kaminski: Coloring edges and vertices of graphs without short or long cycles. Contributions to Discrete Mathematics 2(1) (2007)

j37

Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin: Maximum k -regular induced subgraphs. J. Comb. Optim. 14(4): 455-463 (2007)

j36

Vadim V. Lozin, Dieter Rautenbach: The relative clique-width of a graph. J. Comb. Theory, Ser. B 97(5): 846-858 (2007)

j35

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)

Vadim V. Lozin, Martin Milanic: On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110

Vadim V. Lozin, Martin Milanic: Maximum independent sets in graphs of low degree. SODA 2007: 874-880

Vadim V. Lozin, Martin Milanic: Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54

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)

2006

j34

Vadim V. Lozin, Raffaele Mosca: Polar graphs and maximal independent sets. Discrete Mathematics 306(22): 2901-2908 (2006)

j33

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)

j32

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)

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

Marcin Kaminski, Vadim V. Lozin: Polynomial-time algorithm for vertex k-colorability of P_5-free graphs. CoRR abs/cs/0607115 (2006)

2005

j31

Vadim V. Lozin, Raffaele Mosca: Independent sets in extensions of 2K₂-free graphs. Discrete Applied Mathematics 146(1): 74-80 (2005)

j30

Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin: Bisplit graphs. Discrete Mathematics 299(1-3): 11-32 (2005)

j29

L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian: Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005)

j28

Vadim V. Lozin: Between 2- and 3-colorability. Inf. Process. Lett. 94(4): 179-182 (2005)

Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin: Clique-Width for Four-Vertex Forbidden Subgraphs. FCT 2005: 185-196

2004

j27

Rodica Boliac, Kathie Cameron, Vadim V. Lozin: On computing the dissociation number and the induced matching number of bipartite graphs. Ars Comb. 72 (2004)

j26

Vladimir E. Alekseev, Vadim V. Lozin: Local transformations of graphs preserving independence number. Discrete Applied Mathematics 135(1-3): 17-30 (2004)

j25

Vladimir E. Alekseev, Vadim V. Lozin: Augmenting graphs for independent sets. Discrete Applied Mathematics 145(1): 3-10 (2004)

j24

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

j23

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)

j22

Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin: New Results on Generalized Graph Coloring. Discrete Mathematics & Theoretical Computer Science 6(2): 215-222 (2004)

j21

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

j20

Andreas Brandstädt, Vadim V. Lozin: On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003)

j19

Michael U. Gerber, Vadim V. Lozin: On the stable set problem in special P₅-free graphs. Discrete Applied Mathematics 125(2-3): 215-224 (2003)

j18

Rodica Boliac, Vadim V. Lozin: An augmenting graph approach to the stable set problem in P₅-free graphs. Discrete Applied Mathematics 131(3): 567-575 (2003)

j17

Vadim V. Lozin, Dominique de Werra: Special issue on stability in graphs and related topics. Discrete Applied Mathematics 132(1-3): 1-2 (2003)

j16

Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra: Struction revisited. Discrete Applied Mathematics 132(1-3): 27-46 (2003)

j15

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)

j14

Vladimir E. Alekseev, Vadim V. Lozin: Independent sets of maximum weight in (p, q)-colorable graphs. Discrete Mathematics 265(1-3): 351-356 (2003)

j13

Michael U. Gerber, Vadim V. Lozin: Robust Algorithms for the Stable Set Problem. Graphs and Combinatorics 19(3): 347-356 (2003)

j12

Alain Hertz, Vadim V. Lozin, David Schindl: Finding augmenting chains in extensions of claw-free graphs. Inf. Process. Lett. 86(6): 311-316 (2003)

j11

Vadim V. Lozin, Dieter Rautenbach: Some results on graphs without long induced paths. Inf. Process. Lett. 88(4): 167-171 (2003)

j10

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)

Rodica Boliac, Vadim V. Lozin: Independent domination in finitely defined classes of graphs. Theor. Comput. Sci. 1-3(301): 271-284 (2003)

2002

Vadim V. Lozin: Bipartite graphs without a skew star. Discrete Mathematics 257(1): 83-100 (2002)

Vadim V. Lozin: On maximum induced matchings in bipartite graphs. Inf. Process. Lett. 81(1): 7-11 (2002)

Rodica Boliac, Vadim V. Lozin: On the Clique-Width of Graphs in Hereditary Classes. ISAAC 2002: 44-54

2001

Andreas Brandstädt, Vadim V. Lozin: A note on alpha-redundant vertices in graphs. Discrete Applied Mathematics 108(3): 301-308 (2001)

Vladimir E. Alekseev, Vadim V. Lozin: On orthogonal representations of graphs. Discrete Mathematics 226(1-3): 359-363 (2001)

Rodica Boliac, Vadim V. Lozin: An attractive class of bipartite graphs. Discussiones Mathematicae Graph Theory 21(2): 293-301 (2001)

2000

Vadim V. Lozin: Conic reduction of graphs for the stable set problem. Discrete Mathematics 222(1-3): 199-211 (2000)

Vadim V. Lozin: Stability in P₅- and banner-free graphs. European Journal of Operational Research 125(2): 292-297 (2000)

Vadim V. Lozin, Michael U. Gerber: On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. Order 17(4): 377-385 (2000)

Vadim V. Lozin: On a Generalization of Bi-Complement Reducible Graphs. MFCS 2000: 528-538

1	Vladimir E. Alekseev	[c9] [j35] [j26] [j25] [j23] [j22] [j14] [j5]
2	Gabriela Alexe	[j16]
3	Peter Allen	[j50]
4	Aistis Atminas	[c19] [c18]
5	Rodica Boliac	[j35] [j27] [j18] [j9] [c2] [j4]
6	Andreas Brandstädt	[j55] [j52] [c11] [j32] [j30] [c3] [j20] [j6]
7	Kathie Cameron	[j27]
8	Domingos Moreira Cardoso	[j60] [c14] [j37]
9	L. Sunil Chandran	[j29]
10	Konrad Dabrowski	[j68] [j67] [j66] [j64] [c17] [c15]
11	Marc Demange	[j70] [j68]
12	Joost Engelfriet	[j32] [c3]
13	Alastair Farrugia	[j22]
14	Michael U. Gerber	[j33] [j19] [j15] [j13] [j1]
15	Peter L. Hammer (Peter Ladislaw Hammer)	[j30] [j16]
16	Alain Hertz	[j33] [j15] [j12]
17	Chính T. Hoàng	[j54] [c8] [i2]
18	Marcin Jakub Kaminski (Marcin Kaminski)	[j54] [j49] [c8] [j40] [j38] [j37] [i2] [i1]
19	Tilo Klembt	[j55] [c11]
20	Martin Kochol	[j10]
21	Dmitry V. Korobitsyn	[j35] [j23]
22	Nicholas Korpelainen	[j60] [j59] [j58] [j56] [c16] [c12]
23	Arie M. C. A. Koster	[j48]
24	Hoàng-Oanh Le	[j32] [c3]
25	Van Bang Le	[j30]
26	Dmitriy S. Malyshev	[j56] [c9]
27	Colin Mayhill	[j65] [j61] [j57]
28	Martin Milanic	[j53] [j49] [j44] [j41] [c9] [c7] [c6] [c5] [c4]
29	Raffaele Mosca	[j63] [j55] [j52] [j46] [c11] [j34] [j31]
30	Mikhail Ju. Moshkov (Mikhail Moshkov)	[c19]
31	Haiko Müller	[j64] [c17]
32	Christophe Picouleau	[j70]
33	Christopher Purcell	[j69]
34	Rajiv Raman	[j67] [c15]
35	Bert Randerath	[j10]
36	Michaël Rao	[j50]
37	Dieter Rautenbach	[j64] [c17] [j36] [j24] [j21] [j11]
38	Igor Razgon	[c18]
39	Bernard Ries	[j70] [j67] [c15]
40	Gábor Rudolf	[j39]
41	Joe Sawada	[j54] [c8] [i2]
42	David Schindl	[j12]
43	Xiao Shu	[j54] [c8] [i2]
44	C. R. Subramanian	[j29]
45	Alexander Tiskin (Alexandre Tiskin)	[j56] [c16]
46	Jordan Volz	[j43]
47	Dominique de Werra	[j17] [j16]
48	Victor Zamaraev	[j66] [j65] [j61]

Vadim V. Lozin

Coauthor Index