dblp.uni-trier.dewww.uni-trier.de

Vadim E. Levit

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
22EEVadim E. Levit, David Tankus: Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 CoRR abs/0901.0858: (2009)
2008
21EEVadim E. Levit, Eugen Mandrescu: Well-covered Graphs and Greedoids. CATS 2008: 87-91
20EEVadim E. Levit, Eugen Mandrescu: The Clique Corona Operation and Greedoids. COCOA 2008: 384-392
19EEVadim 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)
18EEVadim 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
16EEVadim E. Levit, Eugen Mandrescu: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discrete Applied Mathematics 155(18): 2414-2425 (2007)
15EEYulia Kempner, Vadim E. Levit: A Geometric Characterization of Poly-antimatroids. Electronic Notes in Discrete Mathematics 28: 357-364 (2007)
14EEVadim E. Levit, Eugen Mandrescu: Matrices and alpha-Stable Bipartite Graphs. J. UCS 13(11): 1692-1706 (2007)
2006
13EEVadim E. Levit, Eugen Mandrescu: On alpha-critical edges in König-Egerváry graphs. Discrete Mathematics 306(15): 1684-1693 (2006)
12EEMark Korenblit, Vadim E. Levit: Nested Graphs. Electronic Notes in Discrete Mathematics 24: 93-99 (2006)
11EEVadim 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
10EEVadim E. Levit, Eugen Mandrescu: Unicycle graphs and uniquely restricted maximum matchings. Electronic Notes in Discrete Mathematics 22: 261-265 (2005)
2003
9EEMark Korenblit, Vadim E. Levit: On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. DMTCS 2003: 215-224
8EEVadim E. Levit, Eugen Mandrescu: On Unimodality of Independence Polynomials of Some Well-Covered Trees. DMTCS 2003: 237-256
7EEVadim 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)
6EEVadim E. Levit, Eugen Mandrescu: On alpha+-stable Ko"nig-Egerváry graphs. Discrete Mathematics 263(1-3): 179-190 (2003)
5EEYulia 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
1EEVadim E. Levit, Eugen Mandrescu: On the structure of ?-stable graphs. Discrete Mathematics 236(1-3): 227-243 (2001)

Coauthor Index

1Endre Boros [3]
2Martin Charles Golumbic [3]
3Yulia Kempner [5] [15] [17]
4Mark Korenblit [9] [12]
5Eugen Mandrescu [1] [2] [4] [6] [7] [8] [10] [11] [13] [14] [16] [18] [19] [20] [21]
6David Tankus [22]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)