 | 2012 |
|---|
| 53 |       | Vadim E. Levit,
Eugen Mandrescu:
On local maximum stable set greedoids.
Discrete Mathematics 312(3): 588-596 (2012) |
| 52 | | Vadim E. Levit,
Eugen Mandrescu:
Critical Independent Sets and König-Egerváry Graphs.
Graphs and Combinatorics 28(2): 243-250 (2012) |
| 51 | | Vadim E. Levit,
Eugen Mandrescu:
Vertices Belonging to All Critical Sets of a Graph.
SIAM J. Discrete Math. 26(1): 399-403 (2012) |
| 2011 |
|---|
| 50 | | Vadim E. Levit,
Eugen Mandrescu:
A Set and Collection Lemma
CoRR abs/1101.4564: (2011) |
| 49 | | Vadim E. Levit,
Eugen Mandrescu:
Vertices Belonging to All Critical Independent Sets of a Graph
CoRR abs/1102.0401: (2011) |
| 48 | | Vadim E. Levit,
Eugen Mandrescu:
Critical Sets in Bipartite Graphs
CoRR abs/1102.1138: (2011) |
| 47 | | Vadim E. Levit,
Eugen Mandrescu:
An Algorithm Computing the Core of a Konig-Egervary Graph
CoRR abs/1102.1141: (2011) |
| 46 | | Vadim E. Levit,
Eugen Mandrescu:
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs
CoRR abs/1102.1142: (2011) |
| 45 | | Vadim E. Levit,
Eugen Mandrescu:
On the Structure of the Minimum Critical Independent Set of a Graph
CoRR abs/1102.1859: (2011) |
| 44 | | Vadim E. Levit,
Eugen Mandrescu:
On the Core of a Unicyclic Graph
CoRR abs/1102.4727: (2011) |
| 43 | | Vadim E. Levit,
Eugen Mandrescu:
On Symmetry of Independence Polynomials
CoRR abs/1105.2202: (2011) |
| 42 | | Vadim E. Levit,
Eugen Mandrescu:
On the Intersection of All Critical Sets of a Unicyclic Graph
CoRR abs/1108.3756: (2011) |
| 41 | | Vadim E. Levit,
David Tankus:
Weighted well-covered graphs without C4, C5, C6, C7.
Discrete Applied Mathematics 159(5): 354-359 (2011) |
| 40 | | Marina Lipshteyn,
Ross M. McConnell,
Haim Kaplan,
Vadim E. Levit:
Foreword.
Discrete Applied Mathematics 159(7): 497 (2011) |
| 39 | | Vadim E. Levit,
Eugen Mandrescu:
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number.
Discrete Mathematics 311(13): 1204-1206 (2011) |
| 38 | | Vadim E. Levit,
David Tankus:
Lower Bounds on the Odds Against Tree Spectral Sets.
Electronic Notes in Discrete Mathematics 38: 559-564 (2011) |
| 37 | | Vadim E. Levit,
Eugen Mandrescu:
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings.
Electronic Notes in Discrete Mathematics 38: 565-570 (2011) |
| 36 | | Vadim E. Levit,
Eugen Mandrescu:
On Symmetry of Independence Polynomials.
Symmetry 3(3): 472-486 (2011) |
| 2010 |
|---|
| 35 | | Vadim E. Levit,
Eugen Mandrescu:
When G^2 is a Konig-Egervary graph?
CoRR abs/1004.4804: (2010) |
| 34 | | Vadim E. Levit,
Eugen Mandrescu:
On the independence polynomial of an antiregular graph
CoRR abs/1007.0880: (2010) |
| 33 | | Vadim E. Levit,
Eugen Mandrescu:
Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids
CoRR abs/1008.2897: (2010) |
| 32 | | Vadim E. Levit,
Eugen Mandrescu:
Graph operations that are good for greedoids.
Discrete Applied Mathematics 158(13): 1418-1423 (2010) |
| 31 | | Yulia Kempner,
Vadim E. Levit:
Duality between quasi-concave functions and monotone linkage functions.
Discrete Mathematics 310(22): 3211-3218 (2010) |
| 2009 |
|---|
| 30 | | 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 |
| 29 | | 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 |
| 28 | | 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 |
| 27 | | Yulia Kempner,
Vadim E. Levit:
Recognition of Antimatroidal Point Sets.
Graph Theory, Computational Intelligence and Thought 2009: 209-216 |
| 26 | | Mark Korenblit,
Vadim E. Levit:
A Note on the Recognition of Nested Graphs.
Graph Theory, Computational Intelligence and Thought 2009: 36-40 |
| 25 | | Vadim E. Levit,
David Tankus:
Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7
CoRR abs/0901.0858: (2009) |
| 24 | | Vadim E. Levit,
David Tankus:
On Relating Edges in Graphs without Cycles of Length 4
CoRR abs/0908.4016: (2009) |
| 23 | | Vadim E. Levit,
Eugen Mandrescu:
A characterization of Konig-Egervary graphs using a common property of all maximum matchings
CoRR abs/0911.4626: (2009) |
| 22 | | Yulia Kempner,
Vadim E. Levit:
Distributive Lattice Polyhedra.
Electronic Notes in Discrete Mathematics 34: 483-487 (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) |
Data released under the ODC-BY 1.0 license — See also our legal information page