The SCEAS System
| |||||||

## Search the dblp DataBase
Vadim E. Levit:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - Vadim E. Levit, Eugen Mandrescu
**On alpha**[Citation Graph (0, 0)][DBLP]^{+}-stable Ko"nig-Egerváry graphs. Discrete Mathematics, 2003, v:263, n:1-3, pp:179-190 [Journal] - 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] - 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] **On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6.**[Citation Graph (, )][DBLP]**On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph.**[Citation Graph (, )][DBLP]**A Note on the Recognition of Nested Graphs.**[Citation Graph (, )][DBLP]**Recognition of Antimatroidal Point Sets.**[Citation Graph (, )][DBLP]**Well-covered Graphs and Greedoids.**[Citation Graph (, )][DBLP]**The Clique Corona Operation and Greedoids.**[Citation Graph (, )][DBLP]**Representation of poly-antimatroids.**[Citation Graph (, )][DBLP]**Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7**[Citation Graph (, )][DBLP]**On Relating Edges in Graphs without Cycles of Length 4**[Citation Graph (, )][DBLP]**A characterization of Konig-Egervary graphs using a common property of all maximum matchings**[Citation Graph (, )][DBLP]**When G^2 is a Konig-Egervary graph?**[Citation Graph (, )][DBLP]**On the independence polynomial of an antiregular graph**[Citation Graph (, )][DBLP]**Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids**[Citation Graph (, )][DBLP]**Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.**[Citation Graph (, )][DBLP]**On the roots of independence polynomials of almost all very well-covered graphs.**[Citation Graph (, )][DBLP]**Graph operations that are good for greedoids.**[Citation Graph (, )][DBLP]**The intersection of all maximum stable sets of a tree and its pendant vertices.**[Citation Graph (, )][DBLP]**Duality between quasi-concave functions and monotone linkage functions.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |