Eugen Mandrescu Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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
2008
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: Well-covered Graphs and Greedoids. CATS 2008: 87-91
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: The Clique Corona Operation and Greedoids. COCOA 2008: 384-392
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discrete Applied Mathematics 155(18): 2414-2425 (2007)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: Matrices and alpha-Stable Bipartite Graphs. J. UCS 13(11): 1692-1706 (2007)
2006
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: On alpha-critical edges in König-Egerváry graphs. Discrete Mathematics 306(15): 1684-1693 (2006)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: Unicycle graphs and uniquely restricted maximum matchings. Electronic Notes in Discrete Mathematics 22: 261-265 (2005)
2003
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: On Unimodality of Independence Polynomials of Some Well-Covered Trees. DMTCS 2003: 237-256
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: On alpha+-stable Ko"nig-Egerváry graphs. Discrete Mathematics 263(1-3): 179-190 (2003)
2002
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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)
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVadim E. Levit, Eugen Mandrescu: On the structure of ?-stable graphs. Discrete Mathematics 236(1-3): 227-243 (2001)

Coauthor Index

1Vadim E. Levit [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16]

Copyright © Sat Nov 14 20:26:04 2009 by Michael Ley (ley@uni-trier.de)