| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries |
Colouring vertices of triangle-free graphs without forests.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Colin Mayhill, Victor Zamaraev |
Locally bounded coverings and factorial properties of graphs. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas Korpelainen, Vadim V. Lozin, Dmitriy S. Malyshev, Alexander Tiskin |
Boundary properties of graphs for algorithmic graph problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas Korpelainen, Vadim V. Lozin |
Two forbidden induced subgraphs and well-quasi-ordering. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Colin Mayhill, Victor Zamaraev |
A Note on the Speed of Hereditary Graph Properties. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Stability preserving transformations of graphs. |
Annals OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Colin Mayhill |
Canonical Antichains of Unit Interval and Bipartite Permutation Graphs. |
Order |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite induced subgraphs and well-quasi-ordering. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
A decidability result for the dominating set problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
On Independent Vertex Sets in Subclasses of Apple-Free Graphs. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
On the Maximum Independent Set Problem in Subclasses of Planar Graphs. |
J. Graph Algorithms Appl. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries |
Colouring Vertices of Triangle-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin |
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach |
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. |
IWOCA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie M. C. A. Koster, Vadim V. Lozin |
DIMAP Workshop on Algorithmic Graph Theory. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Parameterized complexity of the maximum independent set problem and the speed of hereditary properties. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Raffaele Mosca |
Maximum independent sets in subclasses of P5-free graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Allen, Vadim V. Lozin, Michaël Rao |
Clique-Width and the Speed of Hereditary Properties. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Marcin Kaminski, Vadim V. Lozin, Martin Milanic |
Recent developments on graphs of bounded clique-width. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Moreira Cardoso, Vadim V. Lozin |
Dominating Induced Matchings. |
Graph Theory, Computational Intelligence and Thought |
2009 |
DBLP DOI BibTeX RDF |
Dominating induced matching, Efficient edge dominating set, Polynomial-time algorithm |
| 1 | Vadim V. Lozin |
A Note on the Parameterized Complexity of the Maximum Independent Set Problem. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite Graphs of Large Clique-Width. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
Hereditary class, Tree-width, Clique-width |
| 1 | Vadim V. Lozin, Jordan Volz |
The Clique-Width of Bipartite Graphs in Monogenic Classes. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Boundary Classes of Planar Graphs. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Graph Representation Functions Computable by Finite Automata. |
Journal of Automata, Languages and Combinatorics |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
On finding augmenting graphs. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
P 5-free graphs, dominating clique, graph coloring |
| 1 | Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic |
The Maximum Independent Set Problem in Planar Graphs. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
maximum independent set problem, hereditary classes, planar graphs |
| 1 | Vadim V. Lozin |
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
Unit interval graphs, Fixed parameter tractability, Tree-width, Clique-width |
| 1 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs |
| 1 | Vadim V. Lozin, Dieter Rautenbach |
The relative clique-width of a graph. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Domingos Moreira Cardoso, Marcin Kaminski, Vadim V. Lozin |
Maximum k -regular induced subgraphs. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Induced matchings, Graphs, Hamiltonian cycles, Independent sets |
| 1 | Vladimir E. Alekseev, Rodica Boliac, Dmitry V. Korobitsyn, Vadim V. Lozin |
NP-hard graph problems and boundary classes of graphs. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Vadim V. Lozin |
Vertex 3-colorability of Claw-free Graphs. |
Algorithmic Operations Research |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Gábor Rudolf |
Minimal Universal Bipartite Graphs. |
Ars Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
Tree-Width and Optimization in Bounded Degree Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Hereditary class of graphs, Induced Matching, Dominating set, Tree-width |
| 1 | Vadim V. Lozin, Martin Milanic |
Maximum independent sets in graphs of low degree. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
NP-hardness, polynomial-time algorithm, independent set |
| 1 | Vadim V. Lozin, Martin Milanic |
On the maximum independent set problem in subclasses of planar and more general graphs. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael U. Gerber, Alain Hertz, Vadim V. Lozin |
Augmenting chains in graphs without a skew star. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Raffaele Mosca |
Polar graphs and maximal independent sets. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Kaminski, Vadim V. Lozin |
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for 4-Vertex Forbidden Subgraphs. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
polynomial-time algorithm, independent set |
| 1 | Vadim V. Lozin |
Between 2- and 3-colorability. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin |
Bisplit graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian |
Graphs of low chordality. |
Discrete Mathematics & Theoretical Computer Science |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Raffaele Mosca |
Independent sets in extensions of 2K2-free graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin |
Clique-Width for Four-Vertex Forbidden Subgraphs. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin |
Boundary classes of graphs for the dominating set problem. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dieter Rautenbach |
Chordal bipartite graphs of bounded tree- and clique-width. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin |
New Results on Generalized Graph Coloring. |
Discrete Mathematics & Theoretical Computer Science |
2004 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dieter Rautenbach |
On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Vadim V. Lozin |
Local transformations of graphs preserving independence number. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Vadim V. Lozin |
Augmenting graphs for independent sets. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodica Boliac, Kathie Cameron, Vadim V. Lozin |
On computing the dissociation number and the induced matching number of bipartite graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alain Hertz, Vadim V. Lozin, David Schindl |
Finding augmenting chains in extensions of claw-free graphs. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dieter Rautenbach |
Some results on graphs without long induced paths. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodica Boliac, Vadim V. Lozin |
Independent domination in finitely defined classes of graphs. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Vadim V. Lozin |
Independent sets of maximum weight in (p, q)-colorable graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael U. Gerber, Vadim V. Lozin |
Robust Algorithms for the Stable Set Problem. |
Graphs and Combinatorics |
2003 |
DBLP DOI BibTeX RDF |
Stable set, Stability number, Polynomial algorithm |
| 1 | Rodica Boliac, Vadim V. Lozin |
An augmenting graph approach to the stable set problem in P5-free graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Dominique de Werra |
Special issue on stability in graphs and related topics. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra |
Struction revisited. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael U. Gerber, Alain Hertz, Vadim V. Lozin |
Stable sets in two subclasses of banner-free graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael U. Gerber, Vadim V. Lozin |
On the stable set problem in special P5-free graphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Vadim V. Lozin, Bert Randerath |
The 3-Colorability Problem on Graphs with Maximum Degree Four. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Vadim V. Lozin |
On the linear structure and clique-width of bipartite permutation graphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Vadim V. Lozin |
On maximum induced matchings in bipartite graphs. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Bipartite graphs without a skew star. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodica Boliac, Vadim V. Lozin |
On the Clique-Width of Graphs in Hereditary Classes. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir E. Alekseev, Vadim V. Lozin |
On orthogonal representations of graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Vadim V. Lozin |
A note on alpha-redundant vertices in graphs. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Conic reduction of graphs for the stable set problem. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin |
Stability in P5- and banner-free graphs. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim V. Lozin, Michael U. Gerber |
On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. |
Order |
2000 |
DBLP DOI BibTeX RDF |
jump number, bipartite graphs, polynomial algorithm |
| 1 | Vadim V. Lozin |
On a Generalization of Bi-Complement Reducible Graphs. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")