Vadim E. Levit - Concepedia

Author

Vadim E. Levit

Also Known As

Eugen Mandrescu, Levit, Vadim E., McConnell, Ross M, V. E. Levit, V.E. Levit, VADIM E. LEVIT, Vadim E. Levit, Vadim E. Levit, Vadim Levit

238

Publications

1.4K

Citations

H-Index

Concepts

All Affiliations

Holon Institute of Technology Ariel University Ben-Gurion University of the Negev

About

Vadim E. Levit is an author at Holon Institute of Technology specializing in graph theory, discrete mathematics, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	291
2	Education	8	8	225
3	Computer Science	5	5	202
4	Business	3	3	40
5	Medicine	1	1	18

Vadim E. Levit

Publications

880

Citations

H-Index

Page 1

	Year	Citations
The independence polynomial of a graph - a survey Vadim E. Levit, Eugen Mǎndrescu	2005	129
An improved algorithm for cyclic flowshop scheduling in a robotic cell Eugene Levner, Vladimir Kats, Vadim E. Levit European Journal of Operational Research EngineeringImproved AlgorithmScheduling ProblemCyclic Flowshop SchedulingMechatronics	1997	115
On the number of vertices belonging to all maximum stable sets of a graph Endre Boros, Martin Charles Golumbic, Vadim E. Levit Discrete Applied Mathematics Network ScienceGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryTopological Graph Theory	2002	66
Combinatorial properties of the family of maximum stable sets of a graph Vadim E. Levit, Eugen Mǎndrescu Discrete Applied Mathematics Graph TheoryAlgebraic Graph TheoryStructural Graph TheoryTopological Graph TheoryExtremal Graph Theory	2002	53
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture Vadim E. Levit, Eugen Mǎndrescu European Journal of Combinatorics Graph MinorGeometric Graph TheoryGraph TheoryAlgebraic Graph TheoryTopological Graph Theory	2005	43
Critical Independent Sets and König–Egerváry Graphs Vadim E. Levit, Eugen Mǎndrescu Graphs and Combinatorics Graph TheoryAlgebraic Graph TheoryCritical Independent SetsTopological Graph TheoryDiscrete Mathematics	2011	42
On the roots of independence polynomials of almost all very well-covered graphs Vadim E. Levit, Eugen Mǎndrescu Discrete Applied Mathematics Well-covered GraphsGeometric Graph TheoryGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2007	41
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings Vadim E. Levit, Eugen Mǎndrescu Discrete Applied Mathematics Maximum MatchingsGraph TheoryExtremal Graph TheoryStructural Graph TheoryExtremal Set Theory	2003	38
Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs Tal Grinshpoun, Tamir Tassa, Vadim E. Levit, Artificial Intelligence Privacy ProtectionEngineeringInformation SecurityPrivacy ServiceData Privacy	2018	28
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids Vadim E. Levit, Eugen Mǎndrescu Discrete Applied Mathematics Maximum MatchingsCorresponding GreedoidsTriangle-free GraphsEngineeringGraph Theory	2007	26

Page 1