Segueix
Vadim E. Levit
Vadim E. Levit
Altres nomsVE Levit, Levit VE, Левит ВЕ
Professor, Department of Mathematics, Ariel University
Correu electrònic verificat a ariel.ac.il - Pàgina d'inici
Títol
Citada per
Citada per
Any
The independence polynomial of a graph-a survey
VE Levit, E Mandrescu
Proceedings of the 1st International Conference on Algebraic Informatics …, 2005
2062005
An improved algorithm for cyclic flowshop scheduling in a robotic cell
E Levner, V Kats, VE Levit
European Journal of Operational Research 97 (3), 500-508, 1997
1381997
On the number of vertices belonging to all maximum stable sets of a graph
E Boros, MC Golumbic, VE Levit
Discrete Applied Mathematics 124 (1), 17-25, 2002
692002
On the roots of independence polynomials of almost all very well-covered graphs
VE Levit, E Mandrescu
Discrete Applied Mathematics 156 (4), 478-491, 2008
592008
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture
VE Levit, E Mandrescu
European Journal of Combinatorics 27 (6), 931-939, 2006
562006
Combinatorial properties of the family of maximum stable sets of a graph
VE Levit, E Mandrescu
Discrete Applied Mathematics 117 (1-3), 149-161, 2002
552002
On well-covered trees with unimodal independence polynomials
VE Levit, E Mandrescu
Congressus Numerantium, 193-202, 2002
532002
On α+-stable König–Egerváry graphs
VE Levit, E Mandrescu
Discrete Mathematics 263 (1), 179-190, 2003
502003
Well-covered and König-Egerváry graphs
VE Levit, E Mandrescu
Congressus Numerantium, 209-218, 1998
491998
On unimodality of independence polynomials of some well-covered trees
VE Levit, E Mandrescu
International Conference on Discrete Mathematics and Theoretical Computer …, 2003
472003
Critical independent sets and König–Egerváry graphs
VE Levit, E Mandrescu
Graphs and Combinatorics 28 (2), 243–250, 2012
432012
DGAP-the dynamic generalized assignment problem
K Kogan, A Shtub, VE Levit
Annals of Operations Research 69, 227-239, 1997
411997
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
VE Levit, E Mandrescu
Discrete Applied Mathematics 132 (1-3), 163-174, 2003
352003
On algebraic expressions of series-parallel and Fibonacci graphs
M Korenblit, VE Levit
International Conference on Discrete Mathematics and Theoretical Computer …, 2003
352003
Very well-covered graphs with log-concave independence polynomials
VE Levit, E Mandrescu
Carpathian Journal of Mathematics 20 (1), 73-80, 2004
332004
On maximum matchings in König–Egerváry graphs
VE Levit, E Mandrescu
Discrete Applied Mathematics 161 (10-11), 1635-1638, 2013
322013
Independence polynomials and the unimodality conjecture for very well-covered, quasi-regularizable, and perfect graphs
VE Levit, E Mandrescu
Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge …, 2007
312007
Partial unimodality for independence polynomials of Konig-Egervary graphs
VE Levit, E Mandrescu
Congressus Numerantium 179, 109–119, 2006
272006
Vertices Belonging to All Critical Sets of a Graph
VE Levit, E Mandrescu
SIAM J. Discrete Math. 26, 399-403, 2012
252012
A family of graphs whose independence polynomials are both palindromic and unimodal
VE Levit, E Mandrescu
Carpathian Journal of Mathematics, 108-116, 2007
252007
En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.
Articles 1–20