On hereditary properties of composition graphs. - Vadim E. Levit; Eugen Mandrescu (Discuss. Math. Graph Theory, 1998)

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings. - Vadim E. Levit; Eugen Mandrescu (DMTCS, 2001)

On the structure of ?-stable graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2001)

On the number of vertices belonging to all maximum stable sets of a graph. - Endre Boros; Martin Charles Golumbic; Vadim E. Levit (Discret. Appl. Math., 2002)

A new Greedoid: the family of local maximum stable sets of a forest. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2002)

Combinatorial properties of the family of maximum stable sets of a graph. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2002)

On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. - Mark Korenblit; Vadim E. Levit (DMTCS, 2003)

On Unimodality of Independence Polynomials of Some Well-Covered Trees. - Vadim E. Levit; Eugen Mandrescu (DMTCS, 2003)

Correspondence between two Antimatroid Algorithmic Characterizations. - Yulia Kempner; Vadim E. Levit (Electron. J. Comb., 2003)

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2003)

On alpha+-stable Ko"nig-Egerváry graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2003)

Unicycle graphs and uniquely restricted maximum matchings. - Vadim E. Levit; Eugen Mandrescu (Electron. Notes Discret. Math., 2005)

On alpha-critical edges in König-Egerváry graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2006)

Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture. - Vadim E. Levit; Eugen Mandrescu (Eur. J. Comb., 2006)

Nested Graphs. - Mark Korenblit; Vadim E. Levit (Electron. Notes Discret. Math., 2006)

Representation of poly-antimatroids. - Yulia Kempner; Vadim E. Levit (CTW, 2007)

Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2007)

A Geometric Characterization of Poly-antimatroids. - Yulia Kempner; Vadim E. Levit (Electron. Notes Discret. Math., 2007)

Matrices and alpha-Stable Bipartite Graphs. - Vadim E. Levit; Eugen Mandrescu (J. Univers. Comput. Sci., 2007)

Well-covered Graphs and Greedoids. - Vadim E. Levit; Eugen Mandrescu (CATS, 2008)

The Clique Corona Operation and Greedoids. - Vadim E. Levit; Eugen Mandrescu (COCOA, 2008)

Geometry of antimatroidal point sets. - Yulia Kempner; Vadim E. Levit (CoRR, 2008)

Interval greedoids and families of local maximum stable sets of graphs. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2008)

On the roots of independence polynomials of almost all very well-covered graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2008)

The intersection of all maximum stable sets of a tree and its pendant vertices. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2008)

Recognition of Antimatroidal Point Sets. - Yulia Kempner; Vadim E. Levit (Graph Theory, Computational Intelligence and Thought, 2009)

A Note on the Recognition of Nested Graphs. - Mark Korenblit; Vadim E. Levit (Graph Theory, Computational Intelligence and Thought, 2009)

On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. - Vadim E. Levit; Eugen Mandrescu (Graph Theory, Computational Intelligence and Thought, 2009)

On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. - Vadim E. Levit; David Tankus (Graph Theory, Computational Intelligence and Thought, 2009)

The independence polynomial of a graph at -1. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2009)

Greedoids on Vertex Sets of Unicycle Graphs. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2009)

On Konig-Egervary Square-Stable Graphs. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2009)

Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7 - Vadim E. Levit; David Tankus (CoRR, 2009)

Distributive Lattice Polyhedra. - Yulia Kempner; Vadim E. Levit (Electron. Notes Discret. Math., 2009)

When G^2 is a Konig-Egervary graph? - Vadim E. Levit; Eugen Mandrescu (CoRR, 2010)

On the independence polynomial of an antiregular graph - Vadim E. Levit; Eugen Mandrescu (CoRR, 2010)

Graph operations that are good for greedoids. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2010)

Duality between quasi-concave functions and monotone linkage functions. - Yulia Kempner; Vadim E. Levit (Discret. Math., 2010)

Vertices Belonging to All Critical Independent Sets of a Graph - Vadim E. Levit; Eugen Mandrescu (CoRR, 2011)

Critical Sets in Bipartite Graphs - Vadim E. Levit; Eugen Mandrescu (CoRR, 2011)

An Algorithm Computing the Core of a Konig-Egervary Graph - Vadim E. Levit; Eugen Mandrescu (CoRR, 2011)

Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs - Vadim E. Levit; Eugen Mandrescu (CoRR, 2011)

Weighted well-covered graphs without C4, C5, C6, C7. - Vadim E. Levit; David Tankus (Discret. Appl. Math., 2011)

Foreword. - Marina Lipshteyn; Ross M. McConnell; Haim Kaplan; Vadim E. Levit (Discret. Appl. Math., 2011)

A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2011)

Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids. - Vadim E. Levit; Eugen Mandrescu (Discret. Math. Algorithms Appl., 2011)

A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. - Vadim E. Levit; Eugen Mandrescu (Electron. Notes Discret. Math., 2011)

Lower Bounds on the Odds Against Tree Spectral Sets. - Vadim E. Levit; David Tankus (Electron. Notes Discret. Math., 2011)

Mincuts in generalized Fibonacci graphs of degree 3. - Mark Korenblit; Vadim E. Levit (J. Comput. Methods Sci. Eng., 2011)

On Symmetry of Independence Polynomials. - Vadim E. Levit; Eugen Mandrescu (Symmetry, 2011)

On the Recognition of k-Equistable Graphs. - Vadim E. Levit; Martin Milanic; David Tankus (WG, 2012)

On the core of a unicyclic graph. - Vadim E. Levit; Eugen Mandrescu (Ars Math. Contemp., 2012)

Local maximum stable set greedoids stemming from very well-covered graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2012)

On local maximum stable set greedoids. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2012)

Critical Independent Sets and König-Egerváry Graphs. - Vadim E. Levit; Eugen Mandrescu (Graphs Comb., 2012)

Vertices Belonging to All Critical Sets of a Graph. - Vadim E. Levit; Eugen Mandrescu (SIAM J. Discret. Math., 2012)

A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. - Mark Korenblit; Vadim E. Levit (FAW-AAIM, 2013)

Balanced Abelian group valued functions on directed graphs: Extended abstract. - Yonah Cherniavsky; Avraham Goldstein; Vadim E. Levit (CTW, 2013)

Decomposition Lemmas. - Mark Korenblit; Vadim E. Levit (CoRR, 2013)

A Solution of Simultaneous Recurrences. - Mark Korenblit; Vadim E. Levit (CoRR, 2013)

On f-Symmetries of the Independence Polynomial - Vadim E. Levit; Eugen Mandrescu (CoRR, 2013)

On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs - Mark Korenblit; Vadim E. Levit (CoRR, 2013)

Fibonacci Graphs and their Expressions - Mark Korenblit; Vadim E. Levit (CoRR, 2013)

On maximum matchings in König-Egerváry graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2013)

On the structure of the minimum critical independent set of a graph. - Vadim E. Levit; Eugen Mandrescu (Discret. Math., 2013)

Geometry of poset antimatroids. - Yulia Kempner; Vadim E. Levit (Electron. Notes Discret. Math., 2013)

The Cyclomatic Number of a Graph and its Independence Polynomial at -1. - Vadim E. Levit; Eugen Mandrescu (Graphs Comb., 2013)

When is G 2 a König-Egerváry Graph? - Vadim E. Levit; Eugen Mandrescu (Graphs Comb., 2013)

On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. - Vadim E. Levit; Eugen Mandrescu (Graphs Comb., 2013)

Poly-antimatroid polyhedra. - Yulia Kempner; Vadim E. Levit (Ars Math. Contemp., 2014)

A Set and Collection Lemma. - Vadim E. Levit; Eugen Mandrescu (Electron. J. Comb., 2014)

Critical Independent Sets of a Graph. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2014)

Complexity results on w-well-covered graphs. - Vadim E. Levit; David Tankus (CoRR, 2014)

On the intersection of all critical sets of a unicyclic graph. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2014)

Equistable simplicial, very well-covered, and line graphs. - Vadim E. Levit; Martin Milanic (Discret. Appl. Math., 2014)

Groups of balanced labelings on graphs. - Yonah Cherniavsky; Avraham Goldstein; Vadim E. Levit (Discret. Math., 2014)

On relating edges in graphs without cycles of length 4. - Vadim E. Levit; David Tankus (J. Discrete Algorithms, 2014)

Well-covered graphs without cycles of lengths 4, 5 and 6. - Vadim E. Levit; David Tankus (Discret. Appl. Math., 2015)

Weighted well-covered claw-free graphs. - Vadim E. Levit; David Tankus (Discret. Math., 2015)

Violator spaces and closure operator. - Yulia Kempner; Vadim E. Levit (CoRR, 2016)

On the independence polynomial of the corona of graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2016)

Crowns in bipartite graphs. - Vadim E. Levit; Eugen Mandrescu (Electron. Notes Discret. Math., 2016)

Enumeration of balanced finite group valued functions on directed graphs. - Yonah Cherniavsky; Avraham Goldstein; Vadim E. Levit; Robert Shwartz (Inf. Process. Lett., 2016)

Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. - Vadim E. Levit; Eugen Mandrescu (J. Comb. Optim., 2016)

Graph Expression Complexities and Simultaneous Linear Recurrences. - Mark Korenblit; Vadim E. Levit (ICTCS/CILC, 2017)

Balanced Abelian group-valued functions on directed graphs. - Yonah Cherniavsky; Avraham Goldstein; Vadim E. Levit (Ars Math. Contemp., 2017)

Two more characterizations of König-Egerváry graphs. - Adi Jarden; Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2017)

Well-dominated graphs without cycles of lengths 4 and 5. - Vadim E. Levit; David Tankus (Discret. Math., 2017)

Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs. - Mark Korenblit; Vadim E. Levit (Electron. Notes Discret. Math., 2017)

W2-graphs and shedding vertices. - Vadim E. Levit; Eugen Mandrescu (Electron. Notes Discret. Math., 2017)

The Roller-Coaster Conjecture Revisited. - Vadim E. Levit; Eugen Mandrescu (Graphs Comb., 2017)

Hultman Numbers and Generalized Commuting Probability in Finite Groups. - Yonah Cherniavsky; Vadim E. Levit; Avraham Goldstein; Robert Shwartz (J. Integer Seq., 2017)

Complexity Results for Generating Subgraphs. - Vadim E. Levit; David Tankus (Algorithmica, 2018)

Generating subgraphs in chordal graphs. - Vadim E. Levit; David Tankus (CoRR, 2018)

Critical and maximum independent sets of a graph. - Adi Jarden; Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2018)

Matchings in graphs and groups. - Adi Jarden; Vadim E. Levit; Robert Shwartz (Discret. Appl. Math., 2018)

Krein-Milman Spaces. - Yulia Kempner; Vadim E. Levit (Electron. Notes Discret. Math., 2018)

Graph Operations Preserving W2-Property. - Vadim E. Levit; Eugen Mandrescu (Electron. Notes Discret. Math., 2018)

Critical and Maximum Independent Sets Revisited. - Vadim E. Levit; Eugen Mandrescu (MOTOR, 2019)

On König-Egerváry collections of maximum critical independent sets. - Vadim E. Levit; Eugen Mandrescu (Art Discret. Appl. Math., 2019)

What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? - Elizabeth J. Itskovich; Vadim E. Levit (Algorithms, 2019)

On the Critical Difference of Almost Bipartite Graphs. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2019)

Violator spaces vs closure spaces. - Yulia Kempner; Vadim E. Levit (Eur. J. Comb., 2019)

1-well-covered graphs revisited. - Vadim E. Levit; Eugen Mandrescu (Eur. J. Comb., 2019)

Monotonic Properties of Collections of Maximum Independent Sets of a Graph. - Adi Jarden; Vadim E. Levit; Eugen Mandrescu (Order, 2019)

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. - Mark Korenblit; Vadim E. Levit (CALDAM, 2020)

On an annihilation number conjecture. - Vadim E. Levit; Eugen Mandrescu (Ars Math. Contemp., 2020)

Cospanning characterizations of violator and co-violator spaces. - Yulia Kempner; Vadim E. Levit (CoRR, 2021)

Cospanning characterizations of antimatroids and convex geometries. - Yulia Kempner; Vadim E. Levit (CoRR, 2021)

Recognizing Generating Subgraphs Revisited. - Vadim E. Levit; David Tankus (Int. J. Found. Comput. Sci., 2021)

A Linear Algorithm for Computing Independence Polynomials of Trees. - Ohr Kadrawi; Vadim E. Levit; Ron Yosef; Matan Mizrachi (CoRR, 2022)

Fair Division Algorithms for Electricity Distribution. - Dinesh Kumar Baghel; Vadim E. Levit; Erel Segal-Halevi (CoRR, 2022)

On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2022)

On lengths of edge-labeled graph expressions. - Mark Korenblit; Vadim E. Levit (Discret. Appl. Math., 2022)

Some More Updates on an Annihilation Number Conjecture: Pros and Cons. - Vadim E. Levit; Eugen Mandrescu (Graphs Comb., 2022)

Critical sets, crowns and local maximum independent sets. - Vadim E. Levit; Eugen Mandrescu (J. Glob. Optim., 2022)

On graphs admitting two disjoint maximum independent sets. - Zakir Deniz; Vadim E. Levit; Eugen Mandrescu (Art Discret. Appl. Math., 2022)

Recognizing W2 Graphs. - Vadim E. Levit; David Tankus (CoRR, 2023)

Inequalities Connecting the Annihilation and Independence Numbers. - Ohr Kadrawi; Vadim E. Levit (CoRR, 2023)

Well-Covered Graphs With Constraints On Δ And δ. - Vadim E. Levit; David Tankus (Theory Comput. Syst., 2023)

Greedoids and Violator Spaces. - Yulia Kempner; Vadim E. Levit (Axioms, 2024)

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2024)

Almost Bipartite non-König-Egerváry Graphs Revisited. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2024)

Log-concavity of the independence polynomials of Wp graphs. - Dô Trong Hoang; Vadim E. Levit; Eugen Mandrescu; My Hanh Pham (CoRR, 2024)

On corona of Konig-Egervary graphs. - Vadim E. Levit; Eugen Mandrescu (CoRR, 2024)

Recognizing $ mathbf {W_2}$ Graphs. - Vadim E. Levit; David Tankus (Graphs Comb., 2024)

The independence polynomial of trees is not always log-concave starting from order 26. - Ohr Kadrawi; Vadim E. Levit (Ars Math. Contemp., 2025)

On almost bipartite non-König-Egerváry graphs. - Vadim E. Levit; Eugen Mandrescu (Discret. Appl. Math., 2025)

Recognizing Relating Edges in Graphs Without Cycles of Length 6. - Vadim E. Levit; David Tankus (Graphs Comb., 2025)