Eugen Mandrescu

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 25

Top Topics

Maximum Matching

Bipartite Graph

Mutual Reinforcement

Top Venues

Discret. Appl. Math.

Electron. Notes Discret. Math.

Art Discret. Appl. Math.

Publications

Vadim E. Levit, Eugen Mandrescu
Almost Bipartite non-König-Egerváry Graphs Revisited. CoRR (2024)
Vadim E. Levit, Eugen Mandrescu
On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property. CoRR (2024)
Vadim E. Levit, Eugen Mandrescu
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs. CoRR (2022)
Vadim E. Levit, Eugen Mandrescu
Critical sets, crowns and local maximum independent sets. J. Glob. Optim. 83 (3) (2022)
Vadim E. Levit, Eugen Mandrescu
Some More Updates on an Annihilation Number Conjecture: Pros and Cons. Graphs Comb. 38 (5) (2022)
Zakir Deniz, Vadim E. Levit, Eugen Mandrescu
On graphs admitting two disjoint maximum independent sets. Art Discret. Appl. Math. 6 (1) (2022)
Vadim E. Levit, Eugen Mandrescu
Critical sets, crowns, and local maximum independent sets. CoRR (2020)
Vadim E. Levit, Eugen Mandrescu
On an annihilation number conjecture. Ars Math. Contemp. 18 (2) (2020)
Adi Jarden, Vadim E. Levit, Eugen Mandrescu
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. Order 36 (2) (2019)
Vadim E. Levit, Eugen Mandrescu
Critical and Maximum Independent Sets Revisited. MOTOR (2019)
Vadim E. Levit, Eugen Mandrescu
On König-Egerváry collections of maximum critical independent sets. Art Discret. Appl. Math. 2 (1) (2019)
Vadim E. Levit, Eugen Mandrescu
On the Critical Difference of Almost Bipartite Graphs. CoRR (2019)
Vadim E. Levit, Eugen Mandrescu
1-well-covered graphs revisited. Eur. J. Comb. 80 (2019)
Vadim E. Levit, Eugen Mandrescu
On an Annihilation Number Conjecture. CoRR (2018)
Adi Jarden, Vadim E. Levit, Eugen Mandrescu
Critical and maximum independent sets of a graph. Discret. Appl. Math. 247 (2018)
Vadim E. Levit, Eugen Mandrescu
-Property. Electron. Notes Discret. Math. 68 (2018)
Zakir Deniz, Vadim E. Levit, Eugen Mandrescu
On graphs admitting two disjoint maximum independent sets. CoRR (2018)
Vadim E. Levit, Eugen Mandrescu
The Roller-Coaster Conjecture Revisited. Graphs Comb. 33 (6) (2017)
Vadim E. Levit, Eugen Mandrescu
-graphs and shedding vertices. Electron. Notes Discret. Math. 61 (2017)
Adi Jarden, Vadim E. Levit, Eugen Mandrescu
Two more characterizations of König-Egerváry graphs. Discret. Appl. Math. 231 (2017)
Vadim E. Levit, Eugen Mandrescu
Crowns in bipartite graphs. Electron. Notes Discret. Math. 54 (2016)
Vadim E. Levit, Eugen Mandrescu
The Roller-Coaster Conjecture Revisited. CoRR (2016)
Vadim E. Levit, Eugen Mandrescu
Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. J. Comb. Optim. 32 (1) (2016)
Vadim E. Levit, Eugen Mandrescu
On the independence polynomial of the corona of graphs. Discret. Appl. Math. 203 (2016)
Vadim E. Levit, Eugen Mandrescu
1-well-covered graphs revisited. CoRR (2016)
Adi Jarden, Vadim E. Levit, Eugen Mandrescu
Critical and Maximum Independent Sets of a Graph. CoRR (2015)
Adi Jarden, Vadim E. Levit, Eugen Mandrescu
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. CoRR (2015)
Vadim E. Levit, Eugen Mandrescu
On Konig-Egervary Collections of Maximum Critical Independent Sets. CoRR (2015)
Vadim E. Levit, Eugen Mandrescu
On the intersection of all critical sets of a unicyclic graph. Discret. Appl. Math. 162 (2014)
Vadim E. Levit, Eugen Mandrescu
A Set and Collection Lemma. Electron. J. Comb. 21 (1) (2014)
Vadim E. Levit, Eugen Mandrescu
Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs. CoRR (2014)
Vadim E. Levit, Eugen Mandrescu
Critical Independent Sets of a Graph. CoRR (2014)
Vadim E. Levit, Eugen Mandrescu
The Cyclomatic Number of a Graph and its Independence Polynomial at -1. Graphs Comb. 29 (2) (2013)
Vadim E. Levit, Eugen Mandrescu
On maximum matchings in König-Egerváry graphs. Discret. Appl. Math. 161 (10-11) (2013)
Vadim E. Levit, Eugen Mandrescu
On the structure of the minimum critical independent set of a graph. Discret. Math. 313 (5) (2013)
Vadim E. Levit, Eugen Mandrescu
When is G 2 a König-Egerváry Graph? Graphs Comb. 29 (5) (2013)
Vadim E. Levit, Eugen Mandrescu
On f-Symmetries of the Independence Polynomial CoRR (2013)
Vadim E. Levit, Eugen Mandrescu
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs Comb. 29 (6) (2013)
Eugen Mandrescu
Unimodality of some independence polynomials via their palindromicity. Australas. J Comb. 53 (2012)
Vadim E. Levit, Eugen Mandrescu
Critical Independent Sets and König-Egerváry Graphs. Graphs Comb. 28 (2) (2012)
Vadim E. Levit, Eugen Mandrescu
Local maximum stable set greedoids stemming from very well-covered graphs. Discret. Appl. Math. 160 (12) (2012)
Vadim E. Levit, Eugen Mandrescu
On the core of a unicyclic graph. Ars Math. Contemp. 5 (2) (2012)
Vadim E. Levit, Eugen Mandrescu
Vertices Belonging to All Critical Sets of a Graph. SIAM J. Discret. Math. 26 (1) (2012)
Vadim E. Levit, Eugen Mandrescu
On local maximum stable set greedoids. Discret. Math. 312 (3) (2012)
Vadim E. Levit, Eugen Mandrescu
Vertices Belonging to All Critical Independent Sets of a Graph CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
On the Structure of the Minimum Critical Independent Set of a Graph CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids. Discret. Math. Algorithms Appl. 3 (2) (2011)
Vadim E. Levit, Eugen Mandrescu
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. Electron. Notes Discret. Math. 38 (2011)
Vadim E. Levit, Eugen Mandrescu
On Symmetry of Independence Polynomials CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
A Set and Collection Lemma CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
An Algorithm Computing the Core of a Konig-Egervary Graph CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
Critical Sets in Bipartite Graphs CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
On Symmetry of Independence Polynomials. Symmetry 3 (3) (2011)
Vadim E. Levit, Eugen Mandrescu
On the Core of a Unicyclic Graph CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
On the Intersection of All Critical Sets of a Unicyclic Graph CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs CoRR (2011)
Vadim E. Levit, Eugen Mandrescu
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. Discret. Math. 311 (13) (2011)
Vadim E. Levit, Eugen Mandrescu
When G^2 is a Konig-Egervary graph? CoRR (2010)
Vadim E. Levit, Eugen Mandrescu
On the independence polynomial of an antiregular graph CoRR (2010)
Vadim E. Levit, Eugen Mandrescu
Graph operations that are good for greedoids. Discret. Appl. Math. 158 (13) (2010)
Vadim E. Levit, Eugen Mandrescu
Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids CoRR (2010)
Vadim E. Levit, Eugen Mandrescu
The independence polynomial of a graph at -1. CoRR (2009)
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)
Vadim E. Levit, Eugen Mandrescu
Greedoids on Vertex Sets of Unicycle Graphs. CoRR (2009)
Vadim E. Levit, Eugen Mandrescu
Critical independent sets and Konig-Egervary graphs. CoRR (2009)
Vadim E. Levit, Eugen Mandrescu
A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number. CoRR (2009)
Vadim E. Levit, Eugen Mandrescu
A characterization of Konig-Egervary graphs using a common property of all maximum matchings CoRR (2009)
Eugen Mandrescu
Building Graphs Whose Independence Polynomials Have Only Real Roots. Graphs Comb. 25 (4) (2009)
Vadim E. Levit, Eugen Mandrescu
On Konig-Egervary Square-Stable Graphs. CoRR (2009)
Vadim E. Levit, Eugen Mandrescu
The intersection of all maximum stable sets of a tree and its pendant vertices. Discret. Math. 308 (23) (2008)
Vadim E. Levit, Eugen Mandrescu
On Duality between Local Maximum Stable Sets of a Graph and its Line-Graph. CoRR (2008)
Vadim E. Levit, Eugen Mandrescu
Well-covered Graphs and Greedoids. CATS (2008)
Vadim E. Levit, Eugen Mandrescu
Interval greedoids and families of local maximum stable sets of graphs. CoRR (2008)
Vadim E. Levit, Eugen Mandrescu
Graph Operations that are Good for Greedoids. CoRR (2008)
Vadim E. Levit, Eugen Mandrescu
On the roots of independence polynomials of almost all very well-covered graphs. Discret. Appl. Math. 156 (4) (2008)
Vadim E. Levit, Eugen Mandrescu
The Clique Corona Operation and Greedoids. COCOA (2008)
Vadim E. Levit, Eugen Mandrescu
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discret. Appl. Math. 155 (18) (2007)
Vadim E. Levit, Eugen Mandrescu
Matrices and alpha-Stable Bipartite Graphs. J. Univers. Comput. Sci. 13 (11) (2007)
Vadim E. Levit, Eugen Mandrescu
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture. Eur. J. Comb. 27 (6) (2006)
Vadim E. Levit, Eugen Mandrescu
On alpha-critical edges in König-Egerváry graphs. Discret. Math. 306 (15) (2006)
Vadim E. Levit, Eugen Mandrescu
Unicycle graphs and uniquely restricted maximum matchings. Electron. Notes Discret. Math. 22 (2005)
Vadim E. Levit, Eugen Mandrescu
On Unimodality of Independence Polynomials of Some Well-Covered Trees. DMTCS (2003)
Vadim E. Levit, Eugen Mandrescu
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discret. Appl. Math. 132 (1-3) (2003)
Vadim E. Levit, Eugen Mandrescu
-stable Ko"nig-Egerváry graphs. Discret. Math. 263 (1-3) (2003)
Vadim E. Levit, Eugen Mandrescu
Combinatorial properties of the family of maximum stable sets of a graph. Discret. Appl. Math. 117 (1-3) (2002)
Vadim E. Levit, Eugen Mandrescu
A new Greedoid: the family of local maximum stable sets of a forest. Discret. Appl. Math. 124 (1-3) (2002)
Vadim E. Levit, Eugen Mandrescu
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings. DMTCS (2001)
Vadim E. Levit, Eugen Mandrescu
On the structure of ?-stable graphs. Discret. Math. 236 (1-3) (2001)
Vadim E. Levit, Eugen Mandrescu
On hereditary properties of composition graphs. Discuss. Math. Graph Theory 18 (2) (1998)
Elefterie Olaru, Eugen Mandrescu
-strongly perfect cartesian product of graphs. J. Graph Theory 16 (4) (1992)