The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vadim V. Lozin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
    Clique-Width for Four-Vertex Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:185-196 [Conf]
  2. Rodica Boliac, Vadim V. Lozin
    On the Clique-Width of Graphs in Hereditary Classes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:44-54 [Conf]
  3. Vadim V. Lozin
    On a Generalization of Bi-Complement Reducible Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:528-538 [Conf]
  4. Vadim V. Lozin, Martin Milanic
    A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:26-30 [Conf]
  5. Rodica Boliac, Kathie Cameron, Vadim V. Lozin
    On computing the dissociation number and the induced matching number of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  6. Andreas Brandstädt, Vadim V. Lozin
    On the linear structure and clique-width of bipartite permutation graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:67, n:, pp:- [Journal]
  7. Vladimir E. Alekseev, Vadim V. Lozin
    Local transformations of graphs preserving independence number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:17-30 [Journal]
  8. Vladimir E. Alekseev, Vadim V. Lozin
    Augmenting graphs for independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:3-10 [Journal]
  9. Gabriela Alexe, Peter L. Hammer, Vadim V. Lozin, Dominique de Werra
    Struction revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:27-46 [Journal]
  10. Andreas Brandstädt, Vadim V. Lozin
    A note on alpha-redundant vertices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:3, pp:301-308 [Journal]
  11. Rodica Boliac, Vadim V. Lozin
    An augmenting graph approach to the stable set problem in P5-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:3, pp:567-575 [Journal]
  12. Michael U. Gerber, Alain Hertz, Vadim V. Lozin
    Stable sets in two subclasses of banner-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:121-136 [Journal]
  13. Michael U. Gerber, Vadim V. Lozin
    On the stable set problem in special P5-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:125, n:2-3, pp:215-224 [Journal]
  14. Vadim V. Lozin, Raffaele Mosca
    Independent sets in extensions of 2K2-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:74-80 [Journal]
  15. Vadim V. Lozin, Dominique de Werra
    Special issue on stability in graphs and related topics. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:1-2 [Journal]
  16. Vladimir E. Alekseev, Vadim V. Lozin
    On orthogonal representations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:226, n:1-3, pp:359-363 [Journal]
  17. Vladimir E. Alekseev, Vadim V. Lozin
    Independent sets of maximum weight in (p, q)-colorable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:265, n:1-3, pp:351-356 [Journal]
  18. Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin
    Boundary classes of graphs for the dominating set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:1-6 [Journal]
  19. Andreas Brandstädt, Peter L. Hammer, Van Bang Le, Vadim V. Lozin
    Bisplit graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:11-32 [Journal]
  20. Vadim V. Lozin
    Conic reduction of graphs for the stable set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:199-211 [Journal]
  21. Vadim V. Lozin
    Bipartite graphs without a skew star. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:1, pp:83-100 [Journal]
  22. Vadim V. Lozin, Dieter Rautenbach
    Chordal bipartite graphs of bounded tree- and clique-width. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:283, n:1-3, pp:151-158 [Journal]
  23. Vadim V. Lozin, Raffaele Mosca
    Polar graphs and maximal independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:22, pp:2901-2908 [Journal]
  24. Michael U. Gerber, Vadim V. Lozin
    Robust Algorithms for the Stable Set Problem. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:3, pp:347-356 [Journal]
  25. Alain Hertz, Vadim V. Lozin, David Schindl
    Finding augmenting chains in extensions of claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:6, pp:311-316 [Journal]
  26. Vadim V. Lozin
    On maximum induced matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:1, pp:7-11 [Journal]
  27. Vadim V. Lozin
    Between 2- and 3-colorability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:4, pp:179-182 [Journal]
  28. Vadim V. Lozin, Dieter Rautenbach
    Some results on graphs without long induced paths. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:4, pp:167-171 [Journal]
  29. Michael U. Gerber, Alain Hertz, Vadim V. Lozin
    Augmenting chains in graphs without a skew star. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:352-366 [Journal]
  30. Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin
    Clique-Width for 4-Vertex Forbidden Subgraphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:4, pp:561-590 [Journal]
  31. Vadim V. Lozin, Michael U. Gerber
    On the Jump Number Problem in Hereditary Classes of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Order, 2000, v:17, n:4, pp:377-385 [Journal]
  32. Martin Kochol, Vadim V. Lozin, Bert Randerath
    The 3-Colorability Problem on Graphs with Maximum Degree Four. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1128-1139 [Journal]
  33. Vadim V. Lozin, Dieter Rautenbach
    On the Band-, Tree-, and Clique-Width of Graphs with Bounded Vertex Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:195-206 [Journal]
  34. Rodica Boliac, Vadim V. Lozin
    Independent domination in finitely defined classes of graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:271-284 [Journal]
  35. Marcin Kaminski, Vadim V. Lozin
    Vertex 3-colorability of Claw-free Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2007, v:2, n:1, pp:- [Journal]
  36. Vadim V. Lozin, Martin Milanic
    Maximum independent sets in graphs of low degree. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:874-880 [Conf]
  37. Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, J. Sawada, X. Shu
    Deciding k-colourability of P_5-free graphs in polynomial time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  38. Marcin Kaminski, Vadim V. Lozin
    Polynomial-time algorithm for vertex k-colorability of P_5-free graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  39. Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin
    New Results on Generalized Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:215-222 [Journal]
  40. L. Sunil Chandran, Vadim V. Lozin, C. R. Subramanian
    Graphs of low chordality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2005, v:7, n:1, pp:25-36 [Journal]
  41. Vadim V. Lozin, Dieter Rautenbach
    The relative clique-width of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:846-858 [Journal]

  42. Dominating Induced Matchings. [Citation Graph (, )][DBLP]


  43. Independent Sets of Maximum Weight in Apple-Free Graphs. [Citation Graph (, )][DBLP]


  44. From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. [Citation Graph (, )][DBLP]


  45. The Maximum Independent Set Problem in Planar Graphs. [Citation Graph (, )][DBLP]


  46. A Note on k-Colorability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  47. Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. [Citation Graph (, )][DBLP]


  48. Tree-Width and Optimization in Bounded Degree Graphs. [Citation Graph (, )][DBLP]


  49. On the maximum independent set problem in subclasses of planar and more general graphs. [Citation Graph (, )][DBLP]


  50. A Note on the Parameterized Complexity of the Maximum Independent Set Problem. [Citation Graph (, )][DBLP]


  51. Bipartite Graphs of Large Clique-Width. [Citation Graph (, )][DBLP]


  52. On Independent Vertex Sets in Subclasses of Apple-Free Graphs. [Citation Graph (, )][DBLP]


  53. Deciding k-Colorability of P5-Free Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  54. Minimal Universal Bipartite Graphs. [Citation Graph (, )][DBLP]


  55. Boundary Classes of Planar Graphs. [Citation Graph (, )][DBLP]


  56. On finding augmenting graphs. [Citation Graph (, )][DBLP]


  57. Recent developments on graphs of bounded clique-width. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002