Vadim E. Levit

ORCID

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 57

Top Venues

CoRR

Discret. Appl. Math.

Electron. Notes Discret. Math.

Discret. Math.

Publications

Vadim E. Levit, David Tankus
Recognizing $\mathbf {W_2}$ Graphs. Graphs Comb. 40 (4) (2024)
Vadim E. Levit, David Tankus
Recognizing Relating Edges in Graphs without Cycles of Length 6. CoRR (2024)
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)
Ohr Kadrawi, Vadim E. Levit
Inequalities Connecting the Annihilation and Independence Numbers. CoRR (2023)
Ohr Kadrawi, Vadim E. Levit
The independence polynomial of trees is not always log-concave starting from order 26. CoRR (2023)
Vadim E. Levit, David Tankus
Graphs. CoRR (2023)
Vadim E. Levit, David Tankus
Well-Covered Graphs With Constraints On Δ And δ. Theory Comput. Syst. 67 (6) (2023)
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)
Ohr Kadrawi, Vadim E. Levit, Ron Yosef, Matan Mizrachi
A Linear Algorithm for Computing Independence Polynomials of Trees. CoRR (2022)
Dinesh Kumar Baghel, Vadim E. Levit, Erel Segal-Halevi
Fair Division Algorithms for Electricity Distribution. CoRR (2022)
Mark Korenblit, Vadim E. Levit
On lengths of edge-labeled graph expressions. Discret. Appl. Math. 319 (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, David Tankus
Recognizing Generating Subgraphs Revisited. Int. J. Found. Comput. Sci. 32 (1) (2021)
Yulia Kempner, Vadim E. Levit
Cospanning characterizations of antimatroids and convex geometries. CoRR (2021)
Yulia Kempner, Vadim E. Levit
Cospanning characterizations of violator and co-violator spaces. CoRR (2021)
Mark Korenblit, Vadim E. Levit
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. CALDAM (2020)
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)
Elizabeth J. Itskovich, Vadim E. Levit
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms 12 (11) (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)
Yulia Kempner, Vadim E. Levit
Violator spaces vs closure spaces. Eur. J. Comb. 80 (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, David Tankus
Complexity Results for Generating Subgraphs. Algorithmica 80 (8) (2018)
Vadim E. Levit, Eugen Mandrescu
On an Annihilation Number Conjecture. CoRR (2018)
Adi Jarden, Vadim E. Levit, Robert Shwartz
Matchings in graphs and groups. Discret. Appl. Math. 247 (2018)
Yulia Kempner, Vadim E. Levit
Krein-Milman Spaces. Electron. Notes Discret. Math. 68 (2018)
Adi Jarden, Vadim E. Levit, Eugen Mandrescu
Critical and maximum independent sets of a graph. Discret. Appl. Math. 247 (2018)
Vadim E. Levit, David Tankus
Generating subgraphs in chordal graphs. CoRR (2018)
Vadim E. Levit, David Tankus
Recognizing generating subgraphs revisited. CoRR (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, David Tankus
Well-dominated graphs without cycles of lengths 4 and 5. Discret. Math. 340 (8) (2017)
Yonah Cherniavsky, Vadim E. Levit, Avraham Goldstein, Robert Shwartz
Hultman Numbers and Generalized Commuting Probability in Finite Groups. J. Integer Seq. 20 (10) (2017)
Mark Korenblit, Vadim E. Levit
Graph Expression Complexities and Simultaneous Linear Recurrences. ICTCS/CILC (2017)
Mark Korenblit, Vadim E. Levit
Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs. Electron. Notes Discret. Math. 63 (2017)
Vadim E. Levit, Eugen Mandrescu
-graphs and shedding vertices. Electron. Notes Discret. Math. 61 (2017)
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit
Balanced Abelian group-valued functions on directed graphs. Ars Math. Contemp. 13 (2) (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)
Yulia Kempner, Vadim E. Levit
Violator spaces and closure operator. CoRR (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)
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit, Robert Shwartz
Enumeration of balanced finite group valued functions on directed graphs. Inf. Process. Lett. 116 (7) (2016)
Vadim E. Levit, Eugen Mandrescu
1-well-covered graphs revisited. CoRR (2016)
Vadim E. Levit, David Tankus
Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. 186 (2015)
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, David Tankus
Weighted well-covered claw-free graphs. Discret. Math. 338 (3) (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, David Tankus
Complexity results on w-well-covered graphs. CoRR (2014)
Yulia Kempner, Vadim E. Levit
Poly-antimatroid polyhedra. Ars Math. Contemp. 7 (1) (2014)
Vadim E. Levit, David Tankus
Well-dominated graphs without cycles of lengths 4 and 5. CoRR (2014)
Vadim E. Levit, Eugen Mandrescu
A Set and Collection Lemma. Electron. J. Comb. 21 (1) (2014)
Vadim E. Levit, Martin Milanic
Equistable simplicial, very well-covered, and line graphs. Discret. Appl. Math. 165 (2014)
Vadim E. Levit, Eugen Mandrescu
Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs. CoRR (2014)
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit
Groups of balanced labelings on graphs. Discret. Math. 320 (2014)
Vadim E. Levit, David Tankus
On relating edges in graphs without cycles of length 4. J. Discrete Algorithms 26 (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)
Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit
Balanced Abelian group valued functions on directed graphs: Extended abstract. CTW (2013)
Vadim E. Levit, Eugen Mandrescu
On maximum matchings in König-Egerváry graphs. Discret. Appl. Math. 161 (10-11) (2013)
Mark Korenblit, Vadim E. Levit
Fibonacci Graphs and their Expressions CoRR (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, David Tankus
Weighted Well-Covered Claw-Free Graphs. CoRR (2013)
Mark Korenblit, Vadim E. Levit
A Solution of Simultaneous Recurrences. CoRR (2013)
Mark Korenblit, Vadim E. Levit
Decomposition Lemmas. CoRR (2013)
Vadim E. Levit, Eugen Mandrescu
When is G 2 a König-Egerváry Graph? Graphs Comb. 29 (5) (2013)
Mark Korenblit, Vadim E. Levit
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. FAW-AAIM (2013)
Vadim E. Levit, Eugen Mandrescu
On f-Symmetries of the Independence Polynomial CoRR (2013)
Yulia Kempner, Vadim E. Levit
Geometry of poset antimatroids. Electron. Notes Discret. Math. 40 (2013)
Mark Korenblit, Vadim E. Levit
On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs CoRR (2013)
Vadim E. Levit, Eugen Mandrescu
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs Comb. 29 (6) (2013)
Vadim E. Levit, Eugen Mandrescu
Critical Independent Sets and König-Egerváry Graphs. Graphs Comb. 28 (2) (2012)
Vadim E. Levit, Martin Milanic, David Tankus
On the Recognition of k-Equistable Graphs. WG (2012)
Vadim E. Levit, David Tankus
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6 CoRR (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)
Mark Korenblit, Vadim E. Levit
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids CoRR (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)
Mark Korenblit, Vadim E. Levit
Mincuts in generalized Fibonacci graphs of degree 3. J. Comput. Methods Sci. Eng. 11 (5-6) (2011)
Vadim E. Levit, David Tankus
. Discret. Appl. Math. 159 (5) (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, David Tankus
Lower Bounds on the Odds Against Tree Spectral Sets. 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.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vadim E. Levit