Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVadim E. Levit
Person information
- affiliation: Ariel University, Department of Computer Science, Israel
- affiliation (former): Holon Institute of Technology, Department of Computer Science, Israel
- not to be confused with: Vadim Levit 0001
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i60]Vadim E. Levit, Eugen Mandrescu:
On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property. CoRR abs/2401.05523 (2024)- [i59]Vadim E. Levit, David Tankus:
Recognizing Relating Edges in Graphs without Cycles of Length 6. CoRR abs/2403.14824 (2024) - 2023
- [j75]Vadim E. Levit
, David Tankus:
Well-Covered Graphs With Constraints On Δ And δ. Theory Comput. Syst. 67(6): 1197-1208 (2023) - [i58]Ohr Kadrawi, Vadim E. Levit:
The independence polynomial of trees is not always log-concave starting from order 26. CoRR abs/2305.01784 (2023) - [i57]Vadim E. Levit, David Tankus:
Recognizing W2 Graphs. CoRR abs/2306.17272 (2023) - [i56]Ohr Kadrawi, Vadim E. Levit:
Inequalities Connecting the Annihilation and Independence Numbers. CoRR abs/2308.01685 (2023) - 2022
- [j74]Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. Art Discret. Appl. Math. 6(1): 1 (2022) - [j73]Mark Korenblit, Vadim E. Levit:
On lengths of edge-labeled graph expressions. Discret. Appl. Math. 319: 583-594 (2022) - [j72]Vadim E. Levit, Eugen Mandrescu:
Some More Updates on an Annihilation Number Conjecture: Pros and Cons. Graphs Comb. 38(5): 141 (2022) - [j71]Vadim E. Levit, Eugen Mandrescu:
Critical sets, crowns and local maximum independent sets. J. Glob. Optim. 83(3): 481-495 (2022) - [i55]Ohr Kadrawi, Vadim E. Levit, Ron Yosef, Matan Mizrachi:
A Linear Algorithm for Computing Independence Polynomials of Trees. CoRR abs/2201.00432 (2022) - [i54]Dinesh Kumar Baghel, Vadim E. Levit, Erel Segal-Halevi:
Fair Division Algorithms for Electricity Distribution. CoRR abs/2205.14531 (2022) - [i53]Vadim E. Levit, Eugen Mandrescu:
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs. CoRR abs/2209.00308 (2022) - 2021
- [j70]Vadim E. Levit, David Tankus:
Recognizing Generating Subgraphs Revisited. Int. J. Found. Comput. Sci. 32(1): 93-114 (2021) - [i52]Yulia Kempner, Vadim E. Levit:
Cospanning characterizations of violator and co-violator spaces. CoRR abs/2105.05074 (2021) - [i51]Yulia Kempner, Vadim E. Levit:
Cospanning characterizations of antimatroids and convex geometries. CoRR abs/2107.08556 (2021) - 2020
- [j69]Vadim E. Levit, Eugen Mandrescu:
On an annihilation number conjecture. Ars Math. Contemp. 18(2): 359-369 (2020) - [c15]Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. CALDAM 2020: 248-259 - [i50]Vadim E. Levit, Eugen Mandrescu:
Critical sets, crowns, and local maximum independent sets. CoRR abs/2008.04587 (2020)
2010 – 2019
- 2019
- [j68]Vadim E. Levit, Eugen Mandrescu:
On König-Egerváry collections of maximum critical independent sets. Art Discret. Appl. Math. 2(1): #P1.02 (2019) - [j67]Elizabeth J. Itskovich, Vadim E. Levit:
What Do a Longest Increasing Subsequence and a Longest Decreasing Subsequence Know about Each Other? Algorithms 12(11): 237 (2019) - [j66]Yulia Kempner, Vadim E. Levit:
Violator spaces vs closure spaces. Eur. J. Comb. 80: 203-213 (2019) - [j65]Vadim E. Levit, Eugen Mandrescu:
1-well-covered graphs revisited. Eur. J. Comb. 80: 261-272 (2019) - [j64]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. Order 36(2): 199-207 (2019) - [c14]Vadim E. Levit, Eugen Mandrescu:
Critical and Maximum Independent Sets Revisited. MOTOR 2019: 3-18 - [i49]Vadim E. Levit, Eugen Mandrescu:
On the Critical Difference of Almost Bipartite Graphs. CoRR abs/1905.09462 (2019) - 2018
- [j63]Vadim E. Levit, David Tankus:
Complexity Results for Generating Subgraphs. Algorithmica 80(8): 2384-2399 (2018) - [j62]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Critical and maximum independent sets of a graph. Discret. Appl. Math. 247: 127-134 (2018) - [j61]Adi Jarden, Vadim E. Levit, Robert Shwartz:
Matchings in graphs and groups. Discret. Appl. Math. 247: 216-224 (2018) - [j60]Vadim E. Levit, Eugen Mandrescu:
Graph Operations Preserving W2-Property. Electron. Notes Discret. Math. 68: 35-40 (2018) - [j59]Yulia Kempner, Vadim E. Levit:
Krein-Milman Spaces. Electron. Notes Discret. Math. 68: 281-286 (2018) - [i48]Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. CoRR abs/1807.06914 (2018) - [i47]Vadim E. Levit, David Tankus:
Generating subgraphs in chordal graphs. CoRR abs/1811.04429 (2018) - [i46]Vadim E. Levit, David Tankus:
Recognizing generating subgraphs revisited. CoRR abs/1811.04433 (2018) - [i45]Vadim E. Levit, Eugen Mandrescu:
On an Annihilation Number Conjecture. CoRR abs/1811.04722 (2018) - 2017
- [j58]Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit:
Balanced Abelian group-valued functions on directed graphs. Ars Math. Contemp. 13(2): 307-315 (2017) - [j57]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Two more characterizations of König-Egerváry graphs. Discret. Appl. Math. 231: 175-180 (2017) - [j56]Vadim E. Levit, David Tankus:
Well-dominated graphs without cycles of lengths 4 and 5. Discret. Math. 340(8): 1793-1801 (2017) - [j55]Vadim E. Levit, Eugen Mandrescu:
W2-graphs and shedding vertices. Electron. Notes Discret. Math. 61: 797-803 (2017) - [j54]Mark Korenblit, Vadim E. Levit:
Estimation of Expressions' Complexities for Two-Terminal Directed Acyclic Graphs. Electron. Notes Discret. Math. 63: 109-116 (2017) - [j53]Vadim E. Levit, Eugen Mandrescu:
The Roller-Coaster Conjecture Revisited. Graphs Comb. 33(6): 1499-1508 (2017) - [j52]Yonah Cherniavsky, Vadim E. Levit, Avraham Goldstein, Robert Shwartz:
Hultman Numbers and Generalized Commuting Probability in Finite Groups. J. Integer Seq. 20(10): 17.10.7 (2017) - [c13]Mark Korenblit, Vadim E. Levit:
Graph Expression Complexities and Simultaneous Linear Recurrences. ICTCS/CILC 2017: 104-108 - 2016
- [j51]Vadim E. Levit, Eugen Mandrescu:
On the independence polynomial of the corona of graphs. Discret. Appl. Math. 203: 85-93 (2016) - [j50]Vadim E. Levit, Eugen Mandrescu:
Crowns in bipartite graphs. Electron. Notes Discret. Math. 54: 45-50 (2016) - [j49]Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit, Robert Shwartz:
Enumeration of balanced finite group valued functions on directed graphs. Inf. Process. Lett. 116(7): 484-488 (2016) - [j48]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): 267-277 (2016) - [i44]Yulia Kempner, Vadim E. Levit:
Violator spaces and closure operator. CoRR abs/1607.02785 (2016) - [i43]Vadim E. Levit, Eugen Mandrescu:
1-well-covered graphs revisited. CoRR abs/1610.03972 (2016) - [i42]Vadim E. Levit, Eugen Mandrescu:
The Roller-Coaster Conjecture Revisited. CoRR abs/1612.03736 (2016) - 2015
- [j47]Vadim E. Levit, David Tankus:
Well-covered graphs without cycles of lengths 4, 5 and 6. Discret. Appl. Math. 186: 158-167 (2015) - [j46]Vadim E. Levit, David Tankus:
Weighted well-covered claw-free graphs. Discret. Math. 338(3): 99-106 (2015) - [i41]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Monotonic Properties of Collections of Maximum Independent Sets of a Graph. CoRR abs/1506.00249 (2015) - [i40]Adi Jarden, Vadim E. Levit, Eugen Mandrescu:
Critical and Maximum Independent Sets of a Graph. CoRR abs/1506.00255 (2015) - [i39]Vadim E. Levit, Eugen Mandrescu:
On Konig-Egervary Collections of Maximum Critical Independent Sets. CoRR abs/1512.01994 (2015) - 2014
- [j45]Yulia Kempner, Vadim E. Levit:
Poly-antimatroid polyhedra. Ars Math. Contemp. 7(1): 73-82 (2014) - [j44]Vadim E. Levit, Eugen Mandrescu:
A Set and Collection Lemma. Electron. J. Comb. 21(1): 1 (2014) - [j43]Vadim E. Levit, Eugen Mandrescu:
On the intersection of all critical sets of a unicyclic graph. Discret. Appl. Math. 162: 409-414 (2014) - [j42]Vadim E. Levit, Martin Milanic:
Equistable simplicial, very well-covered, and line graphs. Discret. Appl. Math. 165: 205-212 (2014) - [j41]Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit:
Groups of balanced labelings on graphs. Discret. Math. 320: 15-25 (2014) - [j40]Vadim E. Levit, David Tankus:
On relating edges in graphs without cycles of length 4. J. Discrete Algorithms 26: 28-33 (2014) - [i38]Vadim E. Levit, David Tankus:
Complexity results on w-well-covered graphs. CoRR abs/1401.0294 (2014) - [i37]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) - [i36]Vadim E. Levit, Eugen Mandrescu:
Critical Independent Sets of a Graph. CoRR abs/1407.7368 (2014) - [i35]Vadim E. Levit, David Tankus:
Well-dominated graphs without cycles of lengths 4 and 5. CoRR abs/1409.1466 (2014) - 2013
- [j39]Vadim E. Levit, Eugen Mandrescu:
On maximum matchings in König-Egerváry graphs. Discret. Appl. Math. 161(10-11): 1635-1638 (2013) - [j38]Vadim E. Levit, Eugen Mandrescu:
On the structure of the minimum critical independent set of a graph. Discret. Math. 313(5): 605-610 (2013) - [j37]Yulia Kempner, Vadim E. Levit:
Geometry of poset antimatroids. Electron. Notes Discret. Math. 40: 169-173 (2013) - [j36]Vadim E. Levit, Eugen Mandrescu:
The Cyclomatic Number of a Graph and its Independence Polynomial at -1. Graphs Comb. 29(2): 259-273 (2013) - [j35]Vadim E. Levit, Eugen Mandrescu:
When is G 2 a König-Egerváry Graph? Graphs Comb. 29(5): 1453-1458 (2013) - [j34]Vadim E. Levit, Eugen Mandrescu:
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs Comb. 29(6): 1867-1879 (2013) - [c12]Mark Korenblit, Vadim E. Levit:
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. FAW-AAIM 2013: 94-105 - [i34]Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit:
Balanced Abelian group valued functions on directed graphs: Extended abstract. CTW 2013: 51-54 - [i33]Vadim E. Levit, Eugen Mandrescu:
On f-Symmetries of the Independence Polynomial. CoRR abs/1303.2564 (2013) - [i32]Mark Korenblit, Vadim E. Levit:
On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs. CoRR abs/1305.2645 (2013) - [i31]Mark Korenblit, Vadim E. Levit:
Fibonacci Graphs and their Expressions. CoRR abs/1305.2647 (2013) - [i30]Mark Korenblit, Vadim E. Levit:
Decomposition Lemmas. CoRR abs/1306.1857 (2013) - [i29]Mark Korenblit, Vadim E. Levit:
A Solution of Simultaneous Recurrences. CoRR abs/1306.1860 (2013) - [i28]Vadim E. Levit, David Tankus:
Weighted Well-Covered Claw-Free Graphs. CoRR abs/1312.7563 (2013) - 2012
- [j33]Vadim E. Levit, Eugen Mandrescu:
On the core of a unicyclic graph. Ars Math. Contemp. 5(2): 325-331 (2012) - [j32]Vadim E. Levit, Eugen Mandrescu:
Local maximum stable set greedoids stemming from very well-covered graphs. Discret. Appl. Math. 160(12): 1864-1871 (2012) - [j31]Vadim E. Levit, Eugen Mandrescu:
On local maximum stable set greedoids. Discret. Math. 312(3): 588-596 (2012) - [j30]Vadim E. Levit, Eugen Mandrescu:
Critical Independent Sets and König-Egerváry Graphs. Graphs Comb. 28(2): 243-250 (2012) - [j29]Vadim E. Levit, Eugen Mandrescu:
Vertices Belonging to All Critical Sets of a Graph. SIAM J. Discret. Math. 26(1): 399-403 (2012) - [c11]Vadim E. Levit, Martin Milanic, David Tankus:
On the Recognition of k-Equistable Graphs. WG 2012: 286-296 - [i27]Vadim E. Levit, David Tankus:
Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6. CoRR abs/1210.6918 (2012) - [i26]Mark Korenblit, Vadim E. Levit:
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. CoRR abs/1211.1661 (2012) - 2011
- [j28]Vadim E. Levit, David Tankus:
Weighted well-covered graphs without C4, C5, C6, C7. Discret. Appl. Math. 159(5): 354-359 (2011) - [j27]Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit:
Foreword. Discret. Appl. Math. 159(7): 497 (2011) - [j26]Vadim E. Levit, Eugen Mandrescu:
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. Discret. Math. 311(13): 1204-1206 (2011) - [j25]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): 245-252 (2011) - [j24]Vadim E. Levit, David Tankus:
Lower Bounds on the Odds Against Tree Spectral Sets. Electron. Notes Discret. Math. 38: 559-564 (2011) - [j23]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: 565-570 (2011) - [j22]Mark Korenblit, Vadim E. Levit:
Mincuts in generalized Fibonacci graphs of degree 3. J. Comput. Methods Sci. Eng. 11(5-6): 271-280 (2011) - [j21]Vadim E. Levit, Eugen Mandrescu:
On Symmetry of Independence Polynomials. Symmetry 3(3): 472-486 (2011) - [i25]Vadim E. Levit, Eugen Mandrescu:
A Set and Collection Lemma. CoRR abs/1101.4564 (2011) - [i24]Vadim E. Levit, Eugen Mandrescu:
Vertices Belonging to All Critical Independent Sets of a Graph. CoRR abs/1102.0401 (2011) - [i23]Vadim E. Levit, Eugen Mandrescu:
Critical Sets in Bipartite Graphs. CoRR abs/1102.1138 (2011) - [i22]Vadim E. Levit, Eugen Mandrescu:
An Algorithm Computing the Core of a Konig-Egervary Graph. CoRR abs/1102.1141 (2011) - [i21]Vadim E. Levit, Eugen Mandrescu:
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs. CoRR abs/1102.1142 (2011) - [i20]Vadim E. Levit, Eugen Mandrescu:
On the Structure of the Minimum Critical Independent Set of a Graph. CoRR abs/1102.1859 (2011) - [i19]Vadim E. Levit, Eugen Mandrescu:
On the Core of a Unicyclic Graph. CoRR abs/1102.4727 (2011) - [i18]Vadim E. Levit, Eugen Mandrescu:
On Symmetry of Independence Polynomials. CoRR abs/1105.2202 (2011) - [i17]Vadim E. Levit, Eugen Mandrescu:
On the Intersection of All Critical Sets of a Unicyclic Graph. CoRR abs/1108.3756 (2011) - 2010
- [j20]Vadim E. Levit, Eugen Mandrescu:
Graph operations that are good for greedoids. Discret. Appl. Math. 158(13): 1418-1423 (2010) - [j19]Yulia Kempner, Vadim E. Levit:
Duality between quasi-concave functions and monotone linkage functions. Discret. Math. 310(22): 3211-3218 (2010) - [i16]Vadim E. Levit, Eugen Mandrescu:
When G^2 is a Konig-Egervary graph? CoRR abs/1004.4804 (2010) - [i15]Vadim E. Levit, Eugen Mandrescu:
On the independence polynomial of an antiregular graph. CoRR abs/1007.0880 (2010) - [i14]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
- [j18]Yulia Kempner, Vadim E. Levit:
Distributive Lattice Polyhedra. Electron. Notes Discret. Math. 34: 483-487 (2009) - [c10]Mark Korenblit, Vadim E. Levit:
A Note on the Recognition of Nested Graphs. Graph Theory, Computational Intelligence and Thought 2009: 36-40 - [c9]Vadim E. Levit, Eugen Mandrescu:
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph. Graph Theory, Computational Intelligence and Thought 2009: 127-133 - [c8]Vadim E. Levit, David Tankus:
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6. Graph Theory, Computational Intelligence and Thought 2009: 144-147 - [c7]Yulia Kempner, Vadim E. Levit:
Recognition of Antimatroidal Point Sets. Graph Theory, Computational Intelligence and Thought 2009: 209-216 - [e1]Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell:
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5420, Springer 2009, ISBN 978-3-642-02028-5 [contents] - [i13]Vadim E. Levit, David Tankus:
Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7. CoRR abs/0901.0858 (2009) - [i12]Vadim E. Levit, Eugen Mandrescu:
The independence polynomial of a graph at -1. CoRR abs/0904.4819 (2009) - [i11]Vadim E. Levit, Eugen Mandrescu:
Greedoids on Vertex Sets of Unicycle Graphs. CoRR abs/0905.1024 (2009) - [i10]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) - [i9]Vadim E. Levit, Eugen Mandrescu:
Critical independent sets and Konig-Egervary graphs. CoRR abs/0906.4609 (2009) - [i8]Vadim E. Levit, Eugen Mandrescu:
On Konig-Egervary Square-Stable Graphs. CoRR abs/0908.1313 (2009) - [i7]Vadim E. Levit, David Tankus:
On Relating Edges in Graphs without Cycles of Length 4. CoRR abs/0908.4016 (2009) - [i6]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
- [j17]Vadim E. Levit, Eugen Mandrescu:
On the roots of independence polynomials of almost all very well-covered graphs. Discret. Appl. Math. 156(4): 478-491 (2008) - [j16]Vadim E. Levit, Eugen Mandrescu:
The intersection of all maximum stable sets of a tree and its pendant vertices. Discret. Math. 308(23): 5809-5814 (2008) - [c6]Vadim E. Levit, Eugen Mandrescu:
Well-covered Graphs and Greedoids. CATS 2008: 87-91 - [c5]Vadim E. Levit, Eugen Mandrescu:
The Clique Corona Operation and Greedoids. COCOA 2008: 384-392 - [i5]Yulia Kempner, Vadim E. Levit:
Geometry of antimatroidal point sets. CoRR abs/0806.2096 (2008) - [i4]Yulia Kempner, Vadim E. Levit:
Duality between quasi-concave functions and monotone linkage functions. CoRR abs/0808.3244 (2008) - [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
- [j15]Vadim E. Levit, Eugen Mandrescu:
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discret. Appl. Math. 155(18): 2414-2425 (2007) - [j14]Yulia Kempner, Vadim E. Levit:
A Geometric Characterization of Poly-antimatroids. Electron. Notes Discret. Math. 28: 357-364 (2007) - [j13]Vadim E. Levit, Eugen Mandrescu:
Matrices and alpha-Stable Bipartite Graphs. J. Univers. Comput. Sci. 13(11): 1692-1706 (2007) - [c4]Yulia Kempner, Vadim E. Levit:
Representation of poly-antimatroids. CTW 2007: 81-84 - 2006
- [j12]Vadim E. Levit, Eugen Mandrescu:
On alpha-critical edges in König-Egerváry graphs. Discret. Math. 306(15): 1684-1693 (2006) - [j11]Vadim E. Levit, Eugen Mandrescu:
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture. Eur. J. Comb. 27(6): 931-939 (2006) - [j10]Mark Korenblit, Vadim E. Levit:
Nested Graphs. Electron. Notes Discret. Math. 24: 93-99 (2006) - 2005
- [j9]Vadim E. Levit, Eugen Mandrescu:
Unicycle graphs and uniquely restricted maximum matchings. Electron. Notes Discret. Math. 22: 261-265 (2005) - 2003
- [j8]Yulia Kempner, Vadim E. Levit:
Correspondence between two Antimatroid Algorithmic Characterizations. Electron. J. Comb. 10 (2003) - [j7]Vadim E. Levit, Eugen Mandrescu:
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, Eugen Mandrescu:
On alpha+-stable Ko"nig-Egerváry graphs. Discret. Math. 263(1-3): 179-190 (2003) - [c3]Mark Korenblit, Vadim E. Levit:
On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. DMTCS 2003: 215-224 - [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, Eugen Mandrescu:
Combinatorial properties of the family of maximum stable sets of a graph. Discret. Appl. Math. 117(1-3): 149-161 (2002) - [j4]Endre Boros, Martin Charles Golumbic, Vadim E. Levit:
On the number of vertices belonging to all maximum stable sets of a graph. Discret. Appl. Math. 124(1-3): 17-25 (2002) - [j3]Vadim E. Levit, Eugen Mandrescu:
A new Greedoid: the family of local maximum stable sets of a forest. Discret. Appl. Math. 124(1-3): 91-101 (2002) - 2001
- [j2]Vadim E. Levit, Eugen Mandrescu:
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
- [j1]Vadim E. Levit, Eugen Mandrescu:
On hereditary properties of composition graphs. Discuss. Math. Graph Theory 18(2): 183-195 (1998)
Coauthor Index
[i60] [j74] [j72] [j71] [i53] [j69] [i50] [j68] [j65] [j64] [c14] [i49] [j62] [j60] [i48] [i45] [j57] [j55] [j53] [j51] [j50] [j48] [i43] [i42] [i41] [i40] [i39] [j44] [j43] [i37] [i36] [j39] [j38] [j36] [j35] [j34] [i33] [j33] [j32] [j31] [j30] [j29] [j26] [j25] [j23] [j21] [i25] [i24] [i23] [i22] [i21] [i20] [i19] [i18] [i17] [j20] [i16] [i15] [i14] [c9] [i12] [i11] [i10] [i9] [i8] [i6] [j17] [j16] [c6] [c5] [i3] [i2] [i1] [j15] [j13] [j12] [j11] [j9] [j7] [j6] [c2] [j5] [j3] [j2] [c1] [j1]
a service of 
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-04-12 18:27 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:
