The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vadim E. Levit: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Korenblit, Vadim E. Levit
    On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:215-224 [Conf]
  2. Vadim E. Levit, Eugen Mandrescu
    On Unimodality of Independence Polynomials of Some Well-Covered Trees. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:237-256 [Conf]
  3. Yulia Kempner, Vadim E. Levit
    Correspondence between two Antimatroid Algorithmic Characterizations. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  4. Endre Boros, Martin Charles Golumbic, Vadim E. Levit
    On the number of vertices belonging to all maximum stable sets of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:17-25 [Journal]
  5. Vadim E. Levit, Eugen Mandrescu
    A new Greedoid: the family of local maximum stable sets of a forest. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:91-101 [Journal]
  6. Vadim E. Levit, Eugen Mandrescu
    Combinatorial properties of the family of maximum stable sets of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:117, n:1-3, pp:149-161 [Journal]
  7. Vadim E. Levit, Eugen Mandrescu
    Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:163-174 [Journal]
  8. Vadim E. Levit, Eugen Mandrescu
    On the structure of ?-stable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:227-243 [Journal]
  9. Vadim E. Levit, Eugen Mandrescu
    On alpha+-stable Ko"nig-Egerváry graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:179-190 [Journal]
  10. Vadim E. Levit, Eugen Mandrescu
    On alpha-critical edges in König-Egerváry graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1684-1693 [Journal]
  11. Vadim E. Levit, Eugen Mandrescu
    Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:6, pp:931-939 [Journal]

  12. On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. [Citation Graph (, )][DBLP]


  13. On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. [Citation Graph (, )][DBLP]


  14. A Note on the Recognition of Nested Graphs. [Citation Graph (, )][DBLP]


  15. Recognition of Antimatroidal Point Sets. [Citation Graph (, )][DBLP]


  16. Well-covered Graphs and Greedoids. [Citation Graph (, )][DBLP]


  17. The Clique Corona Operation and Greedoids. [Citation Graph (, )][DBLP]


  18. Representation of poly-antimatroids. [Citation Graph (, )][DBLP]


  19. Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 [Citation Graph (, )][DBLP]


  20. On Relating Edges in Graphs without Cycles of Length 4 [Citation Graph (, )][DBLP]


  21. A characterization of Konig-Egervary graphs using a common property of all maximum matchings [Citation Graph (, )][DBLP]


  22. When G^2 is a Konig-Egervary graph? [Citation Graph (, )][DBLP]


  23. On the independence polynomial of an antiregular graph [Citation Graph (, )][DBLP]


  24. Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids [Citation Graph (, )][DBLP]


  25. Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. [Citation Graph (, )][DBLP]


  26. On the roots of independence polynomials of almost all very well-covered graphs. [Citation Graph (, )][DBLP]


  27. Graph operations that are good for greedoids. [Citation Graph (, )][DBLP]


  28. The intersection of all maximum stable sets of a tree and its pendant vertices. [Citation Graph (, )][DBLP]


  29. Duality between quasi-concave functions and monotone linkage functions. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002