default search action
Eugen Mandrescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i37]Vadim E. Levit, Eugen Mandrescu:
On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property. CoRR abs/2401.05523 (2024) - [i36]Vadim E. Levit, Eugen Mandrescu:
Almost Bipartite non-König-Egerváry Graphs Revisited. CoRR abs/2405.13176 (2024) - [i35]Dô Trong Hoang, Vadim E. Levit, Eugen Mandrescu, My Hanh Pham:
Log-concavity of the independence polynomials of Wp graphs. CoRR abs/2409.00827 (2024) - 2022
- [j48]Zakir Deniz
, Vadim E. Levit
On graphs admitting two disjoint maximum independent sets. Art Discret. Appl. Math. 6(1): 1 (2022) - [j47]Vadim E. Levit
Some More Updates on an Annihilation Number Conjecture: Pros and Cons. Graphs Comb. 38(5): 141 (2022) - [j46]Vadim E. Levit
Critical sets, crowns and local maximum independent sets. J. Glob. Optim. 83(3): 481-495 (2022) - [i34]Vadim E. Levit
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs. CoRR abs/2209.00308 (2022) - 2020
- [j45]Vadim E. Levit
On an annihilation number conjecture. Ars Math. Contemp. 18(2): 359-369 (2020) - [i33]Vadim E. Levit, Eugen Mandrescu:
Critical sets, crowns, and local maximum independent sets. CoRR abs/2008.04587 (2020)
2010 – 2019
- 2019
- [j44]Vadim E. Levit
On König-Egerváry collections of maximum critical independent sets. Art Discret. Appl. Math. 2(1): #P1.02 (2019) - [j43]Vadim E. Levit
1-well-covered graphs revisited. Eur. J. Comb. 80: 261-272 (2019) - [j42]Adi Jarden, Vadim E. Levit
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. Order 36(2): 199-207 (2019) - [c6]Vadim E. Levit
Critical and Maximum Independent Sets Revisited. MOTOR 2019: 3-18 - [i32]Vadim E. Levit, Eugen Mandrescu:
On the Critical Difference of Almost Bipartite Graphs. CoRR abs/1905.09462 (2019) - 2018
- [j41]Adi Jarden
Critical and maximum independent sets of a graph. Discret. Appl. Math. 247: 127-134 (2018) - [j40]Vadim E. Levit
Graph Operations Preserving W2-Property. Electron. Notes Discret. Math. 68: 35-40 (2018) - [i31]Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. CoRR abs/1807.06914 (2018) - [i30]Vadim E. Levit, Eugen Mandrescu:
On an Annihilation Number Conjecture. CoRR abs/1811.04722 (2018) - 2017
- [j39]Adi Jarden, Vadim E. Levit
Two more characterizations of König-Egerváry graphs. Discret. Appl. Math. 231: 175-180 (2017) - [j38]Vadim E. Levit
W2-graphs and shedding vertices. Electron. Notes Discret. Math. 61: 797-803 (2017) - [j37]Vadim E. Levit
The Roller-Coaster Conjecture Revisited. Graphs Comb. 33(6): 1499-1508 (2017) - 2016
- [j36]Vadim E. Levit
On the independence polynomial of the corona of graphs. Discret. Appl. Math. 203: 85-93 (2016) - [j35]Vadim E. Levit
Crowns in bipartite graphs. Electron. Notes Discret. Math. 54: 45-50 (2016) - [j34]Vadim E. Levit
Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs. J. Comb. Optim. 32(1): 267-277 (2016) - [i29]Vadim E. Levit, Eugen Mandrescu:
1-well-covered graphs revisited. CoRR abs/1610.03972 (2016) - [i28]Vadim E. Levit, Eugen Mandrescu:
The Roller-Coaster Conjecture Revisited. CoRR abs/1612.03736 (2016) - 2015
- [i27]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. CoRR abs/1506.00249 (2015) - [i26]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Critical and Maximum Independent Sets of a Graph. CoRR abs/1506.00255 (2015) - [i25]Vadim E. Levit, Eugen Mandrescu:
On Konig-Egervary Collections of Maximum Critical Independent Sets. CoRR abs/1512.01994 (2015) - 2014
- [j33]Vadim E. Levit, Eugen Mandrescu:
A Set and Collection Lemma. Electron. J. Comb. 21(1): 1 (2014) - [j32]Vadim E. Levit
On the intersection of all critical sets of a unicyclic graph. Discret. Appl. Math. 162: 409-414 (2014) - [i24]Vadim E. Levit, Eugen Mandrescu:
Computing Unique Maximum Matchings in O(m) time for Konig-Egervary Graphs and Unicyclic Graphs. CoRR abs/1402.2903 (2014) - [i23]Vadim E. Levit, Eugen Mandrescu:
Critical Independent Sets of a Graph. CoRR abs/1407.7368 (2014) - 2013
- [j31]Vadim E. Levit
On maximum matchings in König-Egerváry graphs. Discret. Appl. Math. 161(10-11): 1635-1638 (2013) - [j30]Vadim E. Levit
On the structure of the minimum critical independent set of a graph. Discret. Math. 313(5): 605-610 (2013) - [j29]Vadim E. Levit
The Cyclomatic Number of a Graph and its Independence Polynomial at -1. Graphs Comb. 29(2): 259-273 (2013) - [j28]Vadim E. Levit
When is G 2 a König-Egerváry Graph? Graphs Comb. 29(5): 1453-1458 (2013) - [j27]Vadim E. Levit
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs Comb. 29(6): 1867-1879 (2013) - [i22]Vadim E. Levit, Eugen Mandrescu:
On f-Symmetries of the Independence Polynomial. CoRR abs/1303.2564 (2013) - 2012
- [j26]Eugen Mandrescu:
Unimodality of some independence polynomials via their palindromicity. Australas. J Comb. 53: 77-82 (2012) - [j25]Vadim E. Levit, Eugen Mandrescu:
On the core of a unicyclic graph. Ars Math. Contemp. 5(2): 325-331 (2012) - [j24]Vadim E. Levit
Local maximum stable set greedoids stemming from very well-covered graphs. Discret. Appl. Math. 160(12): 1864-1871 (2012) - [j23]Vadim E. Levit
On local maximum stable set greedoids. Discret. Math. 312(3): 588-596 (2012) - [j22]Vadim E. Levit
Critical Independent Sets and König-Egerváry Graphs. Graphs Comb. 28(2): 243-250 (2012) - [j21]Vadim E. Levit
Vertices Belonging to All Critical Sets of a Graph. SIAM J. Discret. Math. 26(1): 399-403 (2012) - 2011
- [j20]Vadim E. Levit
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. Discret. Math. 311(13): 1204-1206 (2011) - [j19]Vadim E. Levit
Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids. Discret. Math. Algorithms Appl. 3(2): 245-252 (2011) - [j18]Vadim E. Levit
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings. Electron. Notes Discret. Math. 38: 565-570 (2011) - [j17]Vadim E. Levit
On Symmetry of Independence Polynomials. Symmetry 3(3): 472-486 (2011) - [i21]Vadim E. Levit, Eugen Mandrescu:
A Set and Collection Lemma. CoRR abs/1101.4564 (2011) - [i20]Vadim E. Levit, Eugen Mandrescu:
Vertices Belonging to All Critical Independent Sets of a Graph. CoRR abs/1102.0401 (2011) - [i19]Vadim E. Levit, Eugen Mandrescu:
Critical Sets in Bipartite Graphs. CoRR abs/1102.1138 (2011) - [i18]Vadim E. Levit, Eugen Mandrescu:
An Algorithm Computing the Core of a Konig-Egervary Graph. CoRR abs/1102.1141 (2011) - [i17]Vadim E. Levit, Eugen Mandrescu:
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs. CoRR abs/1102.1142 (2011) - [i16]Vadim E. Levit, Eugen Mandrescu:
On the Structure of the Minimum Critical Independent Set of a Graph. CoRR abs/1102.1859 (2011) - [i15]Vadim E. Levit, Eugen Mandrescu:
On the Core of a Unicyclic Graph. CoRR abs/1102.4727 (2011) - [i14]Vadim E. Levit, Eugen Mandrescu:
On Symmetry of Independence Polynomials. CoRR abs/1105.2202 (2011) - [i13]Vadim E. Levit, Eugen Mandrescu:
On the Intersection of All Critical Sets of a Unicyclic Graph. CoRR abs/1108.3756 (2011) - 2010
- [j16]Vadim E. Levit
Graph operations that are good for greedoids. Discret. Appl. Math. 158(13): 1418-1423 (2010) - [i12]Vadim E. Levit, Eugen Mandrescu:
When G^2 is a Konig-Egervary graph? CoRR abs/1004.4804 (2010) - [i11]Vadim E. Levit, Eugen Mandrescu:
On the independence polynomial of an antiregular graph. CoRR abs/1007.0880 (2010) - [i10]Vadim E. Levit, Eugen Mandrescu:
Very Well-Covered Graphs of Girth at least Four and Local Maximum Stable Set Greedoids. CoRR abs/1008.2897 (2010)
2000 – 2009
- 2009
- [j15]Eugen Mandrescu:
Building Graphs Whose Independence Polynomials Have Only Real Roots. Graphs Comb. 25(4): 545-556 (2009) - [c5]Vadim E. Levit
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. Graph Theory, Computational Intelligence and Thought 2009: 127-133 - [i9]Vadim E. Levit, Eugen Mandrescu:
The independence polynomial of a graph at -1. CoRR abs/0904.4819 (2009) - [i8]Vadim E. Levit, Eugen Mandrescu:
Greedoids on Vertex Sets of Unicycle Graphs. CoRR abs/0905.1024 (2009) - [i7]Vadim E. Levit, Eugen Mandrescu:
A Simple Proof of an Inequality Connecting the Alternating Number of Independent Sets and the Decycling Number. CoRR abs/0905.3487 (2009) - [i6]Vadim E. Levit, Eugen Mandrescu:
Critical independent sets and Konig-Egervary graphs. CoRR abs/0906.4609 (2009) - [i5]Vadim E. Levit, Eugen Mandrescu:
On Konig-Egervary Square-Stable Graphs. CoRR abs/0908.1313 (2009) - [i4]Vadim E. Levit, Eugen Mandrescu:
A characterization of Konig-Egervary graphs using a common property of all maximum matchings. CoRR abs/0911.4626 (2009) - 2008
- [j14]Vadim E. Levit
On the roots of independence polynomials of almost all very well-covered graphs. Discret. Appl. Math. 156(4): 478-491 (2008) - [j13]Vadim E. Levit
The intersection of all maximum stable sets of a tree and its pendant vertices. Discret. Math. 308(23): 5809-5814 (2008) - [c4]Vadim E. Levit, Eugen Mandrescu:
Well-covered Graphs and Greedoids. CATS 2008: 87-91 - [c3]Vadim E. Levit
The Clique Corona Operation and Greedoids. COCOA 2008: 384-392 - [i3]Vadim E. Levit, Eugen Mandrescu:
On Duality between Local Maximum Stable Sets of a Graph and its Line-Graph. CoRR abs/0809.0259 (2008) - [i2]Vadim E. Levit, Eugen Mandrescu:
Graph Operations that are Good for Greedoids. CoRR abs/0809.1806 (2008) - [i1]Vadim E. Levit, Eugen Mandrescu:
Interval greedoids and families of local maximum stable sets of graphs. CoRR abs/0811.4089 (2008) - 2007
- [j12]Vadim E. Levit
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discret. Appl. Math. 155(18): 2414-2425 (2007) - [j11]Vadim E. Levit, Eugen Mandrescu:
Matrices and alpha-Stable Bipartite Graphs. J. Univers. Comput. Sci. 13(11): 1692-1706 (2007) - 2006
- [j10]Vadim E. Levit
On alpha-critical edges in König-Egerváry graphs. Discret. Math. 306(15): 1684-1693 (2006) - [j9]Vadim E. Levit
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture. Eur. J. Comb. 27(6): 931-939 (2006) - 2005
- [j8]Vadim E. Levit
Unicycle graphs and uniquely restricted maximum matchings. Electron. Notes Discret. Math. 22: 261-265 (2005) - 2003
- [j7]Vadim E. Levit
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discret. Appl. Math. 132(1-3): 163-174 (2003) - [j6]Vadim E. Levit
On alpha+-stable Ko"nig-Egerváry graphs. Discret. Math. 263(1-3): 179-190 (2003) - [c2]Vadim E. Levit, Eugen Mandrescu:
On Unimodality of Independence Polynomials of Some Well-Covered Trees. DMTCS 2003: 237-256 - 2002
- [j5]Vadim E. Levit
Combinatorial properties of the family of maximum stable sets of a graph. Discret. Appl. Math. 117(1-3): 149-161 (2002) - [j4]Vadim E. Levit
A new Greedoid: the family of local maximum stable sets of a forest. Discret. Appl. Math. 124(1-3): 91-101 (2002) - 2001
- [j3]Vadim E. Levit
On the structure of ?-stable graphs. Discret. Math. 236(1-3): 227-243 (2001) - [c1]Vadim E. Levit, Eugen Mandrescu:
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings. DMTCS 2001: 151-157
1990 – 1999
- 1998
- [j2]Vadim E. Levit, Eugen Mandrescu:
On hereditary properties of composition graphs. Discuss. Math. Graph Theory 18(2): 183-195 (1998) - 1992
- [j1]Elefterie Olaru, Eugen Mandrescu:
s-strongly perfect cartesian product of graphs. J. Graph Theory 16(4): 297-303 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: