Ariel University

List of publications from the DBLP Bibliography Server - FAQOther views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2015 | ||
---|---|---|

j44 | Vadim E. Levit, David Tankus: Weighted well-covered claw-free graphs. Discrete Mathematics 338(3): 99-106 (2015) | |

2014 | ||

j43 | ||

j42 | Vadim E. Levit, Eugen Mandrescu: On the intersection of all critical sets of a unicyclic graph. Discrete Applied Mathematics 162: 409-414 (2014) | |

j41 | Vadim E. Levit, Martin Milanic: Equistable simplicial, very well-covered, and line graphs. Discrete Applied Mathematics 165: 205-212 (2014) | |

j40 | Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit: Groups of balanced labelings on graphs. Discrete Mathematics 320: 15-25 (2014) | |

j39 | Vadim E. Levit, David Tankus: On relating edges in graphs without cycles of length 4. J. Discrete Algorithms 26: 28-33 (2014) | |

i27 | Vadim E. Levit, David Tankus: Complexity results on w-well-covered graphs. CoRR abs/1401.0294 (2014) | |

i26 | 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) | |

i25 | ||

i24 | Vadim E. Levit, David Tankus: Well-dominated graphs without cycles of lengths 4 and 5. CoRR abs/1409.1466 (2014) | |

2013 | ||

j38 | Vadim E. Levit, Eugen Mandrescu: On maximum matchings in König-Egerváry graphs. Discrete Applied Mathematics 161(10-11): 1635-1638 (2013) | |

j37 | Vadim E. Levit, Eugen Mandrescu: On the structure of the minimum critical independent set of a graph. Discrete Mathematics 313(5): 605-610 (2013) | |

j36 | Yulia Kempner, Vadim E. Levit: Geometry of poset antimatroids. Electronic Notes in Discrete Mathematics 40: 169-173 (2013) | |

j35 | Vadim E. Levit, Eugen Mandrescu: The Cyclomatic Number of a Graph and its Independence Polynomial at -1. Graphs and Combinatorics 29(2): 259-273 (2013) | |

j34 | Vadim E. Levit, Eugen Mandrescu: When is G 2 a König-Egerváry Graph? Graphs and Combinatorics 29(5): 1453-1458 (2013) | |

j33 | Vadim E. Levit, Eugen Mandrescu: On Unicyclic Graphs with Uniquely Restricted Maximum Matchings. Graphs and Combinatorics 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 | |

c11 | Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit: Balanced Abelian group valued functions on directed graphs: Extended abstract. CTW 2013: 51-54 | |

i23 | Vadim E. Levit, Eugen Mandrescu: On f-Symmetries of the Independence Polynomial. CoRR abs/1303.2564 (2013) | |

i22 | Mark Korenblit, Vadim E. Levit: On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs. CoRR abs/1305.2645 (2013) | |

i21 | ||

i20 | ||

i19 | ||

i18 | ||

2012 | ||

j32 | Vadim E. Levit, Eugen Mandrescu: Local maximum stable set greedoids stemming from very well-covered graphs. Discrete Applied Mathematics 160(12): 1864-1871 (2012) | |

j31 | Vadim E. Levit, Eugen Mandrescu: On local maximum stable set greedoids. Discrete Mathematics 312(3): 588-596 (2012) | |

j30 | Vadim E. Levit, Eugen Mandrescu: Critical Independent Sets and König-Egerváry Graphs. Graphs and Combinatorics 28(2): 243-250 (2012) | |

j29 | Vadim E. Levit, Eugen Mandrescu: Vertices Belonging to All Critical Sets of a Graph. SIAM J. Discrete Math. 26(1): 399-403 (2012) | |

c10 | Vadim E. Levit, Martin Milanic, David Tankus: On the Recognition of k-Equistable Graphs. WG 2012: 286-296 | |

i17 | Vadim E. Levit, David Tankus: Well-Covered Graphs Without Cycles of Lengths 4, 5 and 6. CoRR abs/1210.6918 (2012) | |

i16 | 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 C _{4}, C_{5}, C_{6}, C_{7}. Discrete Applied Mathematics 159(5): 354-359 (2011) | |

j27 | Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit: Foreword. Discrete Applied Mathematics 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. Discrete Mathematics 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. Discrete Math., Alg. and Appl. 3(2): 245-252 (2011) | |

j24 | Vadim E. Levit, David Tankus: Lower Bounds on the Odds Against Tree Spectral Sets. Electronic Notes in Discrete Mathematics 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. Electronic Notes in Discrete Mathematics 38: 565-570 (2011) | |

j22 | Mark Korenblit, Vadim E. Levit: Mincuts in generalized Fibonacci graphs of degree 3. J. Comput. Meth. in Science and Engineering 11(5-6): 271-280 (2011) | |

j21 | Vadim E. Levit, Eugen Mandrescu: On Symmetry of Independence Polynomials. Symmetry 3(3): 472-486 (2011) | |

i15 | ||

i14 | Vadim E. Levit, Eugen Mandrescu: Vertices Belonging to All Critical Independent Sets of a Graph. CoRR abs/1102.0401 (2011) | |

i13 | ||

i12 | Vadim E. Levit, Eugen Mandrescu: An Algorithm Computing the Core of a Konig-Egervary Graph. CoRR abs/1102.1141 (2011) | |

i11 | Vadim E. Levit, Eugen Mandrescu: Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs. CoRR abs/1102.1142 (2011) | |

i10 | Vadim E. Levit, Eugen Mandrescu: On the Structure of the Minimum Critical Independent Set of a Graph. CoRR abs/1102.1859 (2011) | |

i9 | ||

i8 | ||

i7 | 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. Discrete Applied Mathematics 158(13): 1418-1423 (2010) | |

j19 | Yulia Kempner, Vadim E. Levit: Duality between quasi-concave functions and monotone linkage functions. Discrete Mathematics 310(22): 3211-3218 (2010) | |

i6 | ||

i5 | Vadim E. Levit, Eugen Mandrescu: On the independence polynomial of an antiregular graph. CoRR abs/1007.0880 (2010) | |

i4 | 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) | |

2009 | ||

j18 | Yulia Kempner, Vadim E. Levit: Distributive Lattice Polyhedra. Electronic Notes in Discrete Mathematics 34: 483-487 (2009) | |

c9 | Mark Korenblit, Vadim E. Levit: A Note on the Recognition of Nested Graphs. Graph Theory, Computational Intelligence and Thought 2009: 36-40 | |

c8 | 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 | |

c7 | 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 | |

c6 | 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 (Eds.): 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 | |

i3 | Vadim E. Levit, David Tankus: Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7. CoRR abs/0901.0858 (2009) | |

i2 | Vadim E. Levit, David Tankus: On Relating Edges in Graphs without Cycles of Length 4. CoRR abs/0908.4016 (2009) | |

i1 | 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. Discrete Applied Mathematics 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. Discrete Mathematics 308(23): 5809-5814 (2008) | |

c5 | ||

c4 | ||

2007 | ||

j15 | Vadim E. Levit, Eugen Mandrescu: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discrete Applied Mathematics 155(18): 2414-2425 (2007) | |

j14 | Yulia Kempner, Vadim E. Levit: A Geometric Characterization of Poly-antimatroids. Electronic Notes in Discrete Mathematics 28: 357-364 (2007) | |

j13 | Vadim E. Levit, Eugen Mandrescu: Matrices and alpha-Stable Bipartite Graphs. J. UCS 13(11): 1692-1706 (2007) | |

c3 | ||

2006 | ||

j12 | Vadim E. Levit, Eugen Mandrescu: On alpha-critical edges in König-Egerváry graphs. Discrete Mathematics 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. Electronic Notes in Discrete Mathematics 24: 93-99 (2006) | |

2005 | ||

j9 | Vadim E. Levit, Eugen Mandrescu: Unicycle graphs and uniquely restricted maximum matchings. Electronic Notes in Discrete Mathematics 22: 261-265 (2005) | |

2003 | ||

j8 | Yulia Kempner, Vadim E. Levit: Correspondence between two Antimatroid Algorithmic Characterizations. Electr. J. Comb. 10 (2003) | |

j7 | Vadim E. Levit, Eugen Mandrescu: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discrete Applied Mathematics 132(1-3): 163-174 (2003) | |

j6 | Vadim E. Levit, Eugen Mandrescu: On alpha ^{+}-stable Ko"nig-Egerváry graphs. Discrete Mathematics 263(1-3): 179-190 (2003) | |

c2 | Mark Korenblit, Vadim E. Levit: On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. DMTCS 2003: 215-224 | |

c1 | 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. Discrete Applied Mathematics 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. Discrete Applied Mathematics 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. Discrete Applied Mathematics 124(1-3): 91-101 (2002) | |

2001 | ||

j2 | Vadim E. Levit, Eugen Mandrescu: On the structure of ?-stable graphs. Discrete Mathematics 236(1-3): 227-243 (2001) | |

1998 | ||

j1 | Vadim E. Levit, Eugen Mandrescu: On hereditary properties of composition graphs. Discussiones Mathematicae Graph Theory 18(2): 183-195 (1998) |