Eugen Mandrescu

96 papers C 1Journal 90Unranked 5

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Graphs with core(G) = nucleus(G). CoRR Vadim E. Levit, Eugen Mandrescu, Kevin Pereyra
2026	J	`jnl`	Log-concavity of the independence polynomials of W graphs. Discret. Math. Dô Trong Hoang, Vadim E. Levit, Eugen Mandrescu, My Hanh Pham
2026	J	`jnl`	On the Kőnig-Egerváry index of a graph. Discret. Appl. Math. Daniel A. Jaume, Vadim E. Levit, Eugen Mandrescu, Gonzalo Molina, Kevin Pereyra
2026	J	`jnl`	The family of all local maximum independent sets is an augmentoid. CoRR Vadim E. Levit, Eugen Mandrescu
2025	J	`jnl`	On almost bipartite non-König-Egerváry graphs. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2024	J	`jnl`	Almost Bipartite non-König-Egerváry Graphs Revisited. CoRR Vadim E. Levit, Eugen Mandrescu
2024	J	`jnl`	Log-concavity of the independence polynomials of W CoRR Dô Trong Hoang, Vadim E. Levit, Eugen Mandrescu, My Hanh Pham
2024	J	`jnl`	On corona of Konig-Egervary graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2024	J	`jnl`	On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property. CoRR Vadim E. Levit, Eugen Mandrescu
2022	J	`jnl`	Critical sets, crowns and local maximum independent sets. J. Glob. Optim. Vadim E. Levit, Eugen Mandrescu
2022	J	`jnl`	On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2022	J	`jnl`	On graphs admitting two disjoint maximum independent sets. Art Discret. Appl. Math. Zakir Deniz, Vadim E. Levit, Eugen Mandrescu
2022	J	`jnl`	Some More Updates on an Annihilation Number Conjecture: Pros and Cons. Graphs Comb. Vadim E. Levit, Eugen Mandrescu
2020	J	`jnl`	Critical sets, crowns, and local maximum independent sets. CoRR Vadim E. Levit, Eugen Mandrescu
2020	J	`jnl`	On an annihilation number conjecture. Ars Math. Contemp. Vadim E. Levit, Eugen Mandrescu
2019	J	`jnl`	1-well-covered graphs revisited. Eur. J. Comb. Vadim E. Levit, Eugen Mandrescu
2019	—	`conf`	Critical and Maximum Independent Sets Revisited. MOTOR Vadim E. Levit, Eugen Mandrescu
2019	J	`jnl`	Monotonic Properties of Collections of Maximum Independent Sets of a Graph. Order Adi Jarden, Vadim E. Levit, Eugen Mandrescu
2019	J	`jnl`	On König-Egerváry collections of maximum critical independent sets. Art Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2019	J	`jnl`	On the Critical Difference of Almost Bipartite Graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2018	J	`jnl`	Critical and maximum independent sets of a graph. Discret. Appl. Math. Adi Jarden, Vadim E. Levit, Eugen Mandrescu
2018	J	`jnl`	Graph Operations Preserving Electron. Notes Discret. Math. Vadim E. Levit, Eugen Mandrescu
2018	J	`jnl`	On an Annihilation Number Conjecture. CoRR Vadim E. Levit, Eugen Mandrescu
2018	J	`jnl`	On graphs admitting two disjoint maximum independent sets. CoRR Zakir Deniz, Vadim E. Levit, Eugen Mandrescu
2017	J	`jnl`	The Roller-Coaster Conjecture Revisited. Graphs Comb. Vadim E. Levit, Eugen Mandrescu
2017	J	`jnl`	Two more characterizations of König-Egerváry graphs. Discret. Appl. Math. Adi Jarden, Vadim E. Levit, Eugen Mandrescu
2017	J	`jnl`	W Electron. Notes Discret. Math. Vadim E. Levit, Eugen Mandrescu
2016	J	`jnl`	1-well-covered graphs revisited. CoRR Vadim E. Levit, Eugen Mandrescu
2016	J	`jnl`	Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. J. Comb. Optim. Vadim E. Levit, Eugen Mandrescu
2016	J	`jnl`	Crowns in bipartite graphs. Electron. Notes Discret. Math. Vadim E. Levit, Eugen Mandrescu
2016	J	`jnl`	On the independence polynomial of the corona of graphs. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2016	J	`jnl`	The Roller-Coaster Conjecture Revisited. CoRR Vadim E. Levit, Eugen Mandrescu
2015	J	`jnl`	Critical and Maximum Independent Sets of a Graph. CoRR Adi Jarden, Vadim E. Levit, Eugen Mandrescu
2015	J	`jnl`	Monotonic Properties of Collections of Maximum Independent Sets of a Graph. CoRR Adi Jarden, Vadim E. Levit, Eugen Mandrescu
2015	J	`jnl`	On Konig-Egervary Collections of Maximum Critical Independent Sets. CoRR Vadim E. Levit, Eugen Mandrescu
2014	J	`jnl`	A Set and Collection Lemma. Electron. J. Comb. Vadim E. Levit, Eugen Mandrescu
2014	J	`jnl`	Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2014	J	`jnl`	Critical Independent Sets of a Graph. CoRR Vadim E. Levit, Eugen Mandrescu
2014	J	`jnl`	On the intersection of all critical sets of a unicyclic graph. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2013	J	`jnl`	On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs Comb. Vadim E. Levit, Eugen Mandrescu
2013	J	`jnl`	On f-Symmetries of the Independence Polynomial CoRR Vadim E. Levit, Eugen Mandrescu
2013	J	`jnl`	On maximum matchings in König-Egerváry graphs. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2013	J	`jnl`	On the structure of the minimum critical independent set of a graph. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2013	J	`jnl`	The Cyclomatic Number of a Graph and its Independence Polynomial at -1. Graphs Comb. Vadim E. Levit, Eugen Mandrescu
2013	J	`jnl`	When is G 2 a König-Egerváry Graph? Graphs Comb. Vadim E. Levit, Eugen Mandrescu
2012	J	`jnl`	Critical Independent Sets and König-Egerváry Graphs. Graphs Comb. Vadim E. Levit, Eugen Mandrescu
2012	J	`jnl`	Local maximum stable set greedoids stemming from very well-covered graphs. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2012	J	`jnl`	On local maximum stable set greedoids. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2012	J	`jnl`	On the core of a unicyclic graph. Ars Math. Contemp. Vadim E. Levit, Eugen Mandrescu
2012	J	`jnl`	Unimodality of some independence polynomials via their palindromicity. Australas. J Comb. Eugen Mandrescu
2012	J	`jnl`	Vertices Belonging to All Critical Sets of a Graph. SIAM J. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. Electron. Notes Discret. Math. Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	A Set and Collection Lemma CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	An Algorithm Computing the Core of a Konig-Egervary Graph CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	Critical Sets in Bipartite Graphs CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	On Symmetry of Independence Polynomials CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	On Symmetry of Independence Polynomials. Symmetry Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	On the Core of a Unicyclic Graph CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	On the Intersection of All Critical Sets of a Unicyclic Graph CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	On the Structure of the Minimum Critical Independent Set of a Graph CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	Vertices Belonging to All Critical Independent Sets of a Graph CoRR Vadim E. Levit, Eugen Mandrescu
2011	J	`jnl`	Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids. Discret. Math. Algorithms Appl. Vadim E. Levit, Eugen Mandrescu
2010	J	`jnl`	Graph operations that are good for greedoids. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2010	J	`jnl`	On the independence polynomial of an antiregular graph CoRR Vadim E. Levit, Eugen Mandrescu
2010	J	`jnl`	Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids CoRR Vadim E. Levit, Eugen Mandrescu
2010	J	`jnl`	When G^2 is a Konig-Egervary graph? CoRR Vadim E. Levit, Eugen Mandrescu
2009	J	`jnl`	A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number. CoRR Vadim E. Levit, Eugen Mandrescu
2009	J	`jnl`	A characterization of Konig-Egervary graphs using a common property of all maximum matchings CoRR Vadim E. Levit, Eugen Mandrescu
2009	J	`jnl`	Building Graphs Whose Independence Polynomials Have Only Real Roots. Graphs Comb. Eugen Mandrescu
2009	J	`jnl`	Critical independent sets and Konig-Egervary graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2009	J	`jnl`	Greedoids on Vertex Sets of Unicycle Graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2009	—	`conf`	On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. Graph Theory, Computational Intelligence and Thought Vadim E. Levit, Eugen Mandrescu
2009	J	`jnl`	On Konig-Egervary Square-Stable Graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2009	J	`jnl`	The independence polynomial of a graph at -1. CoRR Vadim E. Levit, Eugen Mandrescu
2008	J	`jnl`	Graph Operations that are Good for Greedoids. CoRR Vadim E. Levit, Eugen Mandrescu
2008	J	`jnl`	Interval greedoids and families of local maximum stable sets of graphs. CoRR Vadim E. Levit, Eugen Mandrescu
2008	J	`jnl`	On Duality between Local Maximum Stable Sets of a Graph and its Line-Graph. CoRR Vadim E. Levit, Eugen Mandrescu
2008	J	`jnl`	On the roots of independence polynomials of almost all very well-covered graphs. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2008	C	`conf`	The Clique Corona Operation and Greedoids. COCOA Vadim E. Levit, Eugen Mandrescu
2008	J	`jnl`	The intersection of all maximum stable sets of a tree and its pendant vertices. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2008	—	`conf`	Well-covered Graphs and Greedoids. CATS Vadim E. Levit, Eugen Mandrescu
2007	J	`jnl`	Matrices and alpha-Stable Bipartite Graphs. J. Univers. Comput. Sci. Vadim E. Levit, Eugen Mandrescu
2007	J	`jnl`	Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2006	J	`jnl`	Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture. Eur. J. Comb. Vadim E. Levit, Eugen Mandrescu
2006	J	`jnl`	On alpha-critical edges in König-Egerváry graphs. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2005	J	`jnl`	Unicycle graphs and uniquely restricted maximum matchings. Electron. Notes Discret. Math. Vadim E. Levit, Eugen Mandrescu
2003	J	`jnl`	Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2003	—	`conf`	On Unimodality of Independence Polynomials of Some Well-Covered Trees. DMTCS Vadim E. Levit, Eugen Mandrescu
2003	J	`jnl`	On alpha Discret. Math. Vadim E. Levit, Eugen Mandrescu
2002	J	`jnl`	A new Greedoid: the family of local maximum stable sets of a forest. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2002	J	`jnl`	Combinatorial properties of the family of maximum stable sets of a graph. Discret. Appl. Math. Vadim E. Levit, Eugen Mandrescu
2001	J	`jnl`	On the structure of ?-stable graphs. Discret. Math. Vadim E. Levit, Eugen Mandrescu
2001	—	`conf`	Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings. DMTCS Vadim E. Levit, Eugen Mandrescu
1998	J	`jnl`	On hereditary properties of composition graphs. Discuss. Math. Graph Theory Vadim E. Levit, Eugen Mandrescu