 | 2009 |
|---|
| 28 |       | Marina Lipshteyn,
Vadim E. Levit,
Ross M. McConnell:
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday
Springer 2009 |
| 27 | | Vadim E. Levit,
Eugen Mandrescu:
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph.
Graph Theory, Computational Intelligence and Thought 2009: 127-133 |
| 26 | | Vadim E. Levit,
David Tankus:
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6.
Graph Theory, Computational Intelligence and Thought 2009: 144-147 |
| 25 | | Yulia Kempner,
Vadim E. Levit:
Recognition of Antimatroidal Point Sets.
Graph Theory, Computational Intelligence and Thought 2009: 209-216 |
| 24 | | Mark Korenblit,
Vadim E. Levit:
A Note on the Recognition of Nested Graphs.
Graph Theory, Computational Intelligence and Thought 2009: 36-40 |
| 23 | | Vadim E. Levit,
David Tankus:
Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7
CoRR abs/0901.0858: (2009) |
| 22 | | Vadim E. Levit,
David Tankus:
On Relating Edges in Graphs without Cycles of Length 4
CoRR abs/0908.4016: (2009) |
| 2008 |
|---|
| 21 | | Vadim E. Levit,
Eugen Mandrescu:
Well-covered Graphs and Greedoids.
CATS 2008: 87-91 |
| 20 | | Vadim E. Levit,
Eugen Mandrescu:
The Clique Corona Operation and Greedoids.
COCOA 2008: 384-392 |
| 19 | | Vadim E. Levit,
Eugen Mandrescu:
On the roots of independence polynomials of almost all very well-covered graphs.
Discrete Applied Mathematics 156(4): 478-491 (2008) |
| 18 | | Vadim E. Levit,
Eugen Mandrescu:
The intersection of all maximum stable sets of a tree and its pendant vertices.
Discrete Mathematics 308(23): 5809-5814 (2008) |
| 2007 |
|---|
| 17 |  | Yulia Kempner,
Vadim E. Levit:
Representation of poly-antimatroids.
CTW 2007: 81-84 |
| 16 | | Vadim E. Levit,
Eugen Mandrescu:
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.
Discrete Applied Mathematics 155(18): 2414-2425 (2007) |
| 15 | | Yulia Kempner,
Vadim E. Levit:
A Geometric Characterization of Poly-antimatroids.
Electronic Notes in Discrete Mathematics 28: 357-364 (2007) |
| 14 | | Vadim E. Levit,
Eugen Mandrescu:
Matrices and alpha-Stable Bipartite Graphs.
J. UCS 13(11): 1692-1706 (2007) |
| 2006 |
|---|
| 13 | | Vadim E. Levit,
Eugen Mandrescu:
On alpha-critical edges in König-Egerváry graphs.
Discrete Mathematics 306(15): 1684-1693 (2006) |
| 12 | | Mark Korenblit,
Vadim E. Levit:
Nested Graphs.
Electronic Notes in Discrete Mathematics 24: 93-99 (2006) |
| 11 | | Vadim E. Levit,
Eugen Mandrescu:
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture.
Eur. J. Comb. 27(6): 931-939 (2006) |
| 2005 |
|---|
| 10 | | Vadim E. Levit,
Eugen Mandrescu:
Unicycle graphs and uniquely restricted maximum matchings.
Electronic Notes in Discrete Mathematics 22: 261-265 (2005) |
| 2003 |
|---|
| 9 | | Mark Korenblit,
Vadim E. Levit:
On Algebraic Expressions of Series-Parallel and Fibonacci Graphs.
DMTCS 2003: 215-224 |
| 8 | | Vadim E. Levit,
Eugen Mandrescu:
On Unimodality of Independence Polynomials of Some Well-Covered Trees.
DMTCS 2003: 237-256 |
| 7 | | Vadim E. Levit,
Eugen Mandrescu:
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings.
Discrete Applied Mathematics 132(1-3): 163-174 (2003) |
| 6 | | Vadim E. Levit,
Eugen Mandrescu:
On alpha+-stable Ko"nig-Egerváry graphs.
Discrete Mathematics 263(1-3): 179-190 (2003) |
| 5 | | Yulia Kempner,
Vadim E. Levit:
Correspondence between two Antimatroid Algorithmic Characterizations.
Electr. J. Comb. 10: (2003) |
| 2002 |
|---|
| 4 | | Vadim E. Levit,
Eugen Mandrescu:
Combinatorial properties of the family of maximum stable sets of a graph.
Discrete Applied Mathematics 117(1-3): 149-161 (2002) |
| 3 | | Endre Boros,
Martin Charles Golumbic,
Vadim E. Levit:
On the number of vertices belonging to all maximum stable sets of a graph.
Discrete Applied Mathematics 124(1-3): 17-25 (2002) |
| 2 | | Vadim E. Levit,
Eugen Mandrescu:
A new Greedoid: the family of local maximum stable sets of a forest.
Discrete Applied Mathematics 124(1-3): 91-101 (2002) |
| 2001 |
|---|
| 1 | | Vadim E. Levit,
Eugen Mandrescu:
On the structure of ?-stable graphs.
Discrete Mathematics 236(1-3): 227-243 (2001) |
