 | 2009 |
|---|
| 61 |       | Vadim V. Lozin:
A Note on the Parameterized Complexity of the Maximum Independent Set Problem.
CTW 2009: 40-43 |
| 60 | | Domingos Moreira Cardoso,
Vadim V. Lozin:
Dominating Induced Matchings.
Graph Theory, Computational Intelligence and Thought 2009: 77-86 |
| 59 | | Nicholas Korpelainen,
Vadim V. Lozin:
Bipartite Graphs of Large Clique-Width.
IWOCA 2009: 385-395 |
| 58 | | Marcin Kaminski,
Vadim V. Lozin,
Martin Milanic:
Recent developments on graphs of bounded clique-width.
Discrete Applied Mathematics 157(12): 2747-2761 (2009) |
| 57 | | Arie M. C. A. Koster,
Vadim V. Lozin:
DIMAP Workshop on Algorithmic Graph Theory.
Electronic Notes in Discrete Mathematics 32: 1 (2009) |
| 56 | | Vadim V. Lozin,
Raffaele Mosca:
Maximum independent sets in subclasses of P5-free graphs.
Inf. Process. Lett. 109(6): 319-324 (2009) |
| 2008 |
|---|
| 55 | | Andreas Brandstädt,
Tilo Klembt,
Vadim V. Lozin,
Raffaele Mosca:
Independent Sets of Maximum Weight in Apple-Free Graphs.
ISAAC 2008: 848-858 |
| 54 | | Vadim V. Lozin:
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph.
ISAAC 2008: 871-882 |
| 53 | | 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 |
| 52 | | Vladimir E. Alekseev,
Vadim V. Lozin,
Dmitriy Malyshev,
Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs.
MFCS 2008: 96-107 |
| 51 | | Vadim V. Lozin:
Boundary Classes of Planar Graphs.
Combinatorics, Probability & Computing 17(2): 287-295 (2008) |
| 50 | | Vadim V. Lozin,
Martin Milanic:
On finding augmenting graphs.
Discrete Applied Mathematics 156(13): 2517-2529 (2008) |
| 49 | | Vadim V. Lozin,
Jordan Volz:
The Clique-Width of Bipartite Graphs in Monogenic Classes.
Int. J. Found. Comput. Sci. 19(2): 477-494 (2008) |
| 48 | | 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) |
| 47 |  | Vadim V. Lozin:
Graph Representation Functions Computable by Finite Automata.
Journal of Automata, Languages and Combinatorics 13(1): 73-90 (2008) |
| 2007 |
|---|
| 46 | | Vadim V. Lozin,
Martin Milanic:
On the maximum independent set problem in subclasses of planar and more general graphs.
CTW 2007: 107-110 |
| 45 | | Vadim V. Lozin,
Martin Milanic:
Maximum independent sets in graphs of low degree.
SODA 2007: 874-880 |
| 44 | | Vadim V. Lozin,
Martin Milanic:
Tree-Width and Optimization in Bounded Degree Graphs.
WG 2007: 45-54 |
| 43 | | Marcin Kaminski,
Vadim V. Lozin:
Vertex 3-colorability of Claw-free Graphs.
Algorithmic Operations Research 2(1): (2007) |
| 42 | | Vadim V. Lozin,
Gábor Rudolf:
Minimal Universal Bipartite Graphs.
Ars Comb. 84: (2007) |
| 41 | | 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) |
| 40 | | Domingos Moreira Cardoso,
Marcin Kaminski,
Vadim V. Lozin:
Maximum k -regular induced subgraphs.
J. Comb. Optim. 14(4): 455-463 (2007) |
| 39 | | Vadim V. Lozin,
Dieter Rautenbach:
The relative clique-width of a graph.
J. Comb. Theory, Ser. B 97(5): 846-858 (2007) |
| 38 | | 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 |
|---|
| 37 | | 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 |
| 36 | | Marcin Kaminski,
Vadim V. Lozin:
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs
CoRR abs/cs/0607115: (2006) |
| 35 | | Vadim V. Lozin,
Raffaele Mosca:
Polar graphs and maximal independent sets.
Discrete Mathematics 306(22): 2901-2908 (2006) |
| 34 | | 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) |
| 33 | | 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 |
|---|
| 32 | | Andreas Brandstädt,
Joost Engelfriet,
Hoàng-Oanh Le,
Vadim V. Lozin:
Clique-Width for Four-Vertex Forbidden Subgraphs.
FCT 2005: 185-196 |
| 31 | | Vadim V. Lozin,
Raffaele Mosca:
Independent sets in extensions of 2K2-free graphs.
Discrete Applied Mathematics 146(1): 74-80 (2005) |
| 30 | | Andreas Brandstädt,
Peter L. Hammer,
Van Bang Le,
Vadim V. Lozin:
Bisplit graphs.
Discrete Mathematics 299(1-3): 11-32 (2005) |
| 29 | | L. Sunil Chandran,
Vadim V. Lozin,
C. R. Subramanian:
Graphs of low chordality.
Discrete Mathematics & Theoretical Computer Science 7(1): 25-36 (2005) |
| 28 | | Vadim V. Lozin:
Between 2- and 3-colorability.
Inf. Process. Lett. 94(4): 179-182 (2005) |
| 2004 |
|---|
| 27 | | Rodica Boliac,
Kathie Cameron,
Vadim V. Lozin:
On computing the dissociation number and the induced matching number of bipartite graphs.
Ars Comb. 72: (2004) |
| 26 | | Vladimir E. Alekseev,
Vadim V. Lozin:
Local transformations of graphs preserving independence number.
Discrete Applied Mathematics 135(1-3): 17-30 (2004) |
| 25 | | Vladimir E. Alekseev,
Vadim V. Lozin:
Augmenting graphs for independent sets.
Discrete Applied Mathematics 145(1): 3-10 (2004) |
| 24 | | Vadim V. Lozin,
Dieter Rautenbach:
Chordal bipartite graphs of bounded tree- and clique-width.
Discrete Mathematics 283(1-3): 151-158 (2004) |
| 23 | | 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) |
| 22 | | Vladimir E. Alekseev,
Alastair Farrugia,
Vadim V. Lozin:
New Results on Generalized Graph Coloring.
Discrete Mathematics & Theoretical Computer Science 6(2): 215-222 (2004) |
| 21 | | 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 |
|---|
| 20 | | Andreas Brandstädt,
Vadim V. Lozin:
On the linear structure and clique-width of bipartite permutation graphs.
Ars Comb. 67: (2003) |
| 19 | | 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) |
| 18 | | 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) |
| 17 | | Vadim V. Lozin,
Dominique de Werra:
Special issue on stability in graphs and related topics.
Discrete Applied Mathematics 132(1-3): 1-2 (2003) |
| 16 | | 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) |
| 15 | | Gabriela Alexe,
Peter L. Hammer,
Vadim V. Lozin,
Dominique de Werra:
Struction revisited.
Discrete Applied Mathematics 132(1-3): 27-46 (2003) |
| 14 | | Vladimir E. Alekseev,
Vadim V. Lozin:
Independent sets of maximum weight in (p, q)-colorable graphs.
Discrete Mathematics 265(1-3): 351-356 (2003) |
| 13 | | Michael U. Gerber,
Vadim V. Lozin:
Robust Algorithms for the Stable Set Problem.
Graphs and Combinatorics 19(3): 347-356 (2003) |
| 12 | | Alain Hertz,
Vadim V. Lozin,
David Schindl:
Finding augmenting chains in extensions of claw-free graphs.
Inf. Process. Lett. 86(6): 311-316 (2003) |
| 11 | | Vadim V. Lozin,
Dieter Rautenbach:
Some results on graphs without long induced paths.
Inf. Process. Lett. 88(4): 167-171 (2003) |
| 10 | | 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) |
| 9 | | Rodica Boliac,
Vadim V. Lozin:
Independent domination in finitely defined classes of graphs.
Theor. Comput. Sci. 1-3(301): 271-284 (2003) |
| 2002 |
|---|
| 8 | | Rodica Boliac,
Vadim V. Lozin:
On the Clique-Width of Graphs in Hereditary Classes.
ISAAC 2002: 44-54 |
| 7 | | Vadim V. Lozin:
Bipartite graphs without a skew star.
Discrete Mathematics 257(1): 83-100 (2002) |
| 6 | | Vadim V. Lozin:
On maximum induced matchings in bipartite graphs.
Inf. Process. Lett. 81(1): 7-11 (2002) |
| 2001 |
|---|
| 5 | | Andreas Brandstädt,
Vadim V. Lozin:
A note on alpha-redundant vertices in graphs.
Discrete Applied Mathematics 108(3): 301-308 (2001) |
| 4 | | Vladimir E. Alekseev,
Vadim V. Lozin:
On orthogonal representations of graphs.
Discrete Mathematics 226(1-3): 359-363 (2001) |
| 2000 |
|---|
| 3 | | Vadim V. Lozin:
On a Generalization of Bi-Complement Reducible Graphs.
MFCS 2000: 528-538 |
| 2 | | Vadim V. Lozin:
Conic reduction of graphs for the stable set problem.
Discrete Mathematics 222(1-3): 199-211 (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) |
