Vadim E. Levit - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Vadim E. Levit' as author, editor, or advisor:

A new Greedoid: the family of local maximum stable sets of a forestVadim E. Levit, Eugen Mandrescu. DAM, 124(1-3):91-101, 2002.
The Clique Corona Operation and GreedoidsVadim E. Levit, Eugen Mandrescu. cocoa 2008: 384-392 [doi]
Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set GreedoidsVadim E. Levit, Eugen Mandrescu. dmaa, 3(2):245-252, 2011. [doi]
ForewordMarina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit. DAM, 159(7):497, 2011. [doi]
Critical sets, crowns and local maximum independent setsVadim E. Levit, Eugen Mandrescu. jgo, 83(3):481-495, 2022. [doi]
Unicycle graphs and uniquely restricted maximum matchingsVadim E. Levit, Eugen Mandrescu. endm, 22:261-265, 2005. [doi]
Poly-antimatroid polyhedraYulia Kempner, Vadim E. Levit. arsmc, 7(1):73-82, 2014. [doi]
On alpha-critical edges in König-Egerváry graphsVadim E. Levit, Eugen Mandrescu. DM, 306(15):1684-1693, 2006. [doi]
Local maximum stable set greedoids stemming from very well-covered graphsVadim E. Levit, Eugen Mandrescu. DAM, 160(12):1864-1871, 2012. [doi]
Monotonic Properties of Collections of Maximum Independent Sets of a GraphAdi Jarden, Vadim E. Levit, Eugen Mandrescu. order, 36(2):199-207, 2019. [doi]
Combinatorial properties of the family of maximum stable sets of a graphVadim E. Levit, Eugen Mandrescu. DAM, 117(1-3):149-161, 2002.
Distributive Lattice PolyhedraYulia Kempner, Vadim E. Levit. endm, 34:483-487, 2009. [doi]
Geometry of poset antimatroidsYulia Kempner, Vadim E. Levit. endm, 40:169-173, 2013. [doi]
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum MatchingsVadim E. Levit, Eugen Mandrescu. dmtcs 2001: 151-157 [doi]
On the structure of the minimum critical independent set of a graphVadim E. Levit, Eugen Mandrescu. DM, 313(5):605-610, 2013. [doi]
Some More Updates on an Annihilation Number Conjecture: Pros and ConsVadim E. Levit, Eugen Mandrescu. gc, 38(5):141, 2022. [doi]
On the roots of independence polynomials of almost all very well-covered graphsVadim E. Levit, Eugen Mandrescu. DAM, 156(4):478-491, 2008. [doi]
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchingsVadim E. Levit, Eugen Mandrescu. DAM, 132(1-3):163-174, 2003. [doi]
A simple proof of an inequality connecting the alternating number of independent sets and the decycling numberVadim E. Levit, Eugen Mandrescu. DM, 311(13):1204-1206, 2011. [doi]
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square RhomboidsMark Korenblit, Vadim E. Levit. AAIM 2013: 94-105 [doi]
Equistable simplicial, very well-covered, and line graphsVadim E. Levit, Martin Milanic. DAM, 165:205-212, 2014. [doi]
On graphs admitting two disjoint maximum independent setsZakir Deniz, Vadim E. Levit, Eugen Mandrescu. adam, 6(1):1, September 2022. [doi]
Balanced Abelian group-valued functions on directed graphsYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit. arsmc, 13(2):307-315, 2017. [doi]
Matrices and alpha-Stable Bipartite GraphsVadim E. Levit, Eugen Mandrescu. jucs, 13(11):1692-1706, 2007. [doi]
Lower Bounds on the Odds Against Tree Spectral SetsVadim E. Levit, David Tankus. endm, 38:559-564, 2011. [doi]
Vertices Belonging to All Critical Sets of a GraphVadim E. Levit, Eugen Mandrescu. siamdm, 26(1):399-403, 2012. [doi]
Duality between quasi-concave functions and monotone linkage functionsYulia Kempner, Vadim E. Levit. DM, 310(22):3211-3218, 2010. [doi]
On almost bipartite non-König-Egerváry graphsVadim E. Levit, Eugen Mandrescu. DAM, 366:127-134, 2025. [doi]
Weighted well-covered claw-free graphsVadim E. Levit, David Tankus. DM, 338(3):99-106, 2015. [doi]
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoidsVadim E. Levit, Eugen Mandrescu. DAM, 155(18):2414-2425, 2007. [doi]
On hereditary properties of composition graphsVadim E. Levit, Eugen Mandrescu. dmgt, 18(2):183-195, 1998. [doi]
On the structure of ?-stable graphsVadim E. Levit, Eugen Mandrescu. DM, 236(1-3):227-243, 2001. [doi]
On local maximum stable set greedoidsVadim E. Levit, Eugen Mandrescu. DM, 312(3):588-596, 2012. [doi]
Well-covered graphs without cycles of lengths 4, 5 and 6Vadim E. Levit, David Tankus. DAM, 186:158-167, 2015. [doi]
Complexity Results for Generating SubgraphsVadim E. Levit, David Tankus. algorithmica, 80(8):2384-2399, 2018. [doi]
On Unimodality of Independence Polynomials of Some Well-Covered TreesVadim E. Levit, Eugen Mandrescu. dmtcs 2003: 237-256 [doi]
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6Vadim E. Levit, David Tankus. BIRTHDAY 2009: 144-147 [doi]
2-graphs and shedding verticesVadim E. Levit, Eugen Mandrescu. endm, 61:797-803, 2017. [doi]
Critical Independent Sets and König-Egerváry GraphsVadim E. Levit, Eugen Mandrescu. gc, 28(2):243-250, 2012. [doi]
On lengths of edge-labeled graph expressionsMark Korenblit, Vadim E. Levit. DAM, 319:583-594, 2022. [doi]
Two more characterizations of König-Egerváry graphsAdi Jarden, Vadim E. Levit, Eugen Mandrescu. DAM, 231:175-180, 2017. [doi]
On Symmetry of Independence PolynomialsVadim E. Levit, Eugen Mandrescu. symmetry, 3(3):472-486, 2011. [doi]
Balanced Abelian group valued functions on directed graphs: Extended abstractYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit. colognetwente 2013: 51-54
Well-Covered Graphs With Constraints On Δ And δVadim E. Levit, David Tankus. mst, 67(6):1197-1208, December 2023. [doi]
The intersection of all maximum stable sets of a tree and its pendant verticesVadim E. Levit, Eugen Mandrescu. DM, 308(23):5809-5814, 2008. [doi]
On König-Egerváry collections of maximum critical independent setsVadim E. Levit, Eugen Mandrescu. adam, 2(1), 2019. [doi]
A Geometric Characterization of Poly-antimatroidsYulia Kempner, Vadim E. Levit. endm, 28:357-364, 2007. [doi]
A Note on the Recognition of Nested GraphsMark Korenblit, Vadim E. Levit. BIRTHDAY 2009: 36-40 [doi]
On Duality between Local Maximum Stable Sets of a Graph and Its Line-GraphVadim E. Levit, Eugen Mandrescu. BIRTHDAY 2009: 127-133 [doi]
A Set and Collection LemmaVadim E. Levit, Eugen Mandrescu. combinatorics, 21(1):1, 2014. [doi]
Enumeration of balanced finite group valued functions on directed graphsYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit, Robert Shwartz. ipl, 116(7):484-488, 2016. [doi]
On relating edges in graphs without cycles of length 4Vadim E. Levit, David Tankus. jda, 26:28-33, 2014. [doi]
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th BirthdayMarina Lipshteyn, Vadim E. Levit, Ross M. McConnell, editors, Volume 5420 of Lecture Notes in Computer Science, Springer, 2009. [doi]
Hultman Numbers and Generalized Commuting Probability in Finite GroupsYonah Cherniavsky, Vadim E. Levit, Avraham Goldstein, Robert Shwartz. jintseq, 20(10), 2017. [doi]
Nested GraphsMark Korenblit, Vadim E. Levit. endm, 24:93-99, 2006. [doi]
Matchings in graphs and groupsAdi Jarden, Vadim E. Levit, Robert Shwartz. DAM, 247:216-224, 2018. [doi]
On an annihilation number conjectureVadim E. Levit, Eugen Mandrescu. arsmc, 18(2):359-369, 2020. [doi]
Critical and maximum independent sets of a graphAdi Jarden, Vadim E. Levit, Eugen Mandrescu. DAM, 247:127-134, 2018. [doi]
Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic GraphsMark Korenblit, Vadim E. Levit. endm, 63:109-116, 2017. [doi]
Critical and Maximum Independent Sets RevisitedVadim E. Levit, Eugen Mandrescu. motor 2019: 3-18 [doi]
On the number of vertices belonging to all maximum stable sets of a graphEndre Boros, Martin Charles Golumbic, Vadim E. Levit. DAM, 124(1-3):17-25, 2002.
On Algebraic Expressions of Series-Parallel and Fibonacci GraphsMark Korenblit, Vadim E. Levit. dmtcs 2003: 215-224 [doi]
Recognizing $\mathbf {W_2}$ GraphsVadim E. Levit, David Tankus. gc, 40(4):72, August 2024. [doi]
Groups of balanced labelings on graphsYonah Cherniavsky, Avraham Goldstein, Vadim E. Levit. DM, 320:15-25, 2014. [doi]
2-PropertyVadim E. Levit, Eugen Mandrescu. endm, 68:35-40, 2018. [doi]
On the core of a unicyclic graphVadim E. Levit, Eugen Mandrescu. arsmc, 5(2):325-331, 2012. [doi]
Correspondence between two Antimatroid Algorithmic CharacterizationsYulia Kempner, Vadim E. Levit. combinatorics, 10, 2003. [doi]
Well-covered Graphs and GreedoidsVadim E. Levit, Eugen Mandrescu. cats 2008: 87-91 [doi]
On Unicyclic Graphs with Uniquely Restricted Maximum MatchingsVadim E. Levit, Eugen Mandrescu. gc, 29(6):1867-1879, 2013. [doi]
On Algebraic Expressions of Two-Terminal Directed Acyclic GraphsMark Korenblit, Vadim E. Levit. caldam 2020: 248-259 [doi]
Violator spaces vs closure spacesYulia Kempner, Vadim E. Levit. ejc, 80:203-213, 2019. [doi]
Mincuts in generalized Fibonacci graphs of degree 3Mark Korenblit, Vadim E. Levit. jcmse, 11(5-6):271-280, 2011. [doi]
Greedoids and Violator SpacesYulia Kempner, Vadim E. Levit. axioms, 13(9):633, 2024. [doi]
Well-dominated graphs without cycles of lengths 4 and 5Vadim E. Levit, David Tankus. DM, 340(8):1793-1801, 2017. [doi]
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other?Elizabeth J. Itskovich, Vadim E. Levit. algorithms, 12(11):237, 2019. [doi]
On the Recognition of k-Equistable GraphsVadim E. Levit, Martin Milanic, David Tankus. wg 2012: 286-296 [doi]
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum MatchingsVadim E. Levit, Eugen Mandrescu. endm, 38:565-570, 2011. [doi]
Weighted well-covered graphs without C::4::, C::5::, C::6::, C::7::Vadim E. Levit, David Tankus. DAM, 159(5):354-359, 2011. [doi]
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjectureVadim E. Levit, Eugen Mandrescu. ejc, 27(6):931-939, 2006. [doi]
On the intersection of all critical sets of a unicyclic graphVadim E. Levit, Eugen Mandrescu. DAM, 162:409-414, 2014. [doi]
On maximum matchings in König-Egerváry graphsVadim E. Levit, Eugen Mandrescu. DAM, 161(10-11):1635-1638, 2013. [doi]
1-well-covered graphs revisitedVadim E. Levit, Eugen Mandrescu. ejc, 80:261-272, 2019. [doi]
Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphsVadim E. Levit, Eugen Mandrescu. jco, 32(1):267-277, 2016. [doi]
Graph Expression Complexities and Simultaneous Linear RecurrencesMark Korenblit, Vadim E. Levit. ictcs 2017: 104-108 [doi]
Recognition of Antimatroidal Point SetsYulia Kempner, Vadim E. Levit. BIRTHDAY 2009: 209-216 [doi]
On the independence polynomial of the corona of graphsVadim E. Levit, Eugen Mandrescu. DAM, 203:85-93, 2016. [doi]
Graph operations that are good for greedoidsVadim E. Levit, Eugen Mandrescu. DAM, 158(13):1418-1423, 2010. [doi]
The Cyclomatic Number of a Graph and its Independence Polynomial at -1Vadim E. Levit, Eugen Mandrescu. gc, 29(2):259-273, 2013. [doi]
Krein-Milman SpacesYulia Kempner, Vadim E. Levit. endm, 68:281-286, 2018. [doi]
Representation of poly-antimatroidsYulia Kempner, Vadim E. Levit. colognetwente 2007: 81-84
On alpha:::+:::-stable Ko nig-Egerváry graphsVadim E. Levit, Eugen Mandrescu. DM, 263(1-3):179-190, 2003. [doi]
Recognizing Generating Subgraphs RevisitedVadim E. Levit, David Tankus. ijfcs, 32(1):93-114, 2021. [doi]
The Roller-Coaster Conjecture RevisitedVadim E. Levit, Eugen Mandrescu. gc, 33(6):1499-1508, 2017. [doi]
When is G 2 a König-Egerváry Graph?Vadim E. Levit, Eugen Mandrescu. gc, 29(5):1453-1458, 2013. [doi]
Crowns in bipartite graphsVadim E. Levit, Eugen Mandrescu. endm, 54:45-50, 2016. [doi]

runs on WebDSL