Vadim E. Levit

1.4k total citations
81 papers, 541 citations indexed

About

Vadim E. Levit is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Vadim E. Levit has authored 81 papers receiving a total of 541 indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computational Theory and Mathematics, 34 papers in Geometry and Topology and 31 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Vadim E. Levit's work include Advanced Graph Theory Research (55 papers), Graph theory and applications (30 papers) and Complexity and Algorithms in Graphs (25 papers). Vadim E. Levit is often cited by papers focused on Advanced Graph Theory Research (55 papers), Graph theory and applications (30 papers) and Complexity and Algorithms in Graphs (25 papers). Vadim E. Levit collaborates with scholars based in Israel, United States and Brazil. Vadim E. Levit's co-authors include Eugen Mǎndrescu, Vladimir Kats, Eugene Levner, Tal Grinshpoun, Amnon Meisels, Endre Boros, Martin Charles Golumbic, Tamir Tassa, Roie Zivan and Ana L. C. Bazzan and has published in prestigious journals such as European Journal of Operational Research, Artificial Intelligence and Computers & Mathematics with Applications.

In The Last Decade

Vadim E. Levit

63 papers receiving 505 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Vadim E. Levit Israel 12 328 238 181 100 72 81 541
Frédéric Maffray France 16 1.0k 3.1× 186 0.8× 480 2.7× 17 0.2× 162 2.3× 111 1.1k
Wenan Zang Hong Kong 12 339 1.0× 87 0.4× 167 0.9× 29 0.3× 86 1.2× 56 415
Dwight Duffus United States 14 430 1.3× 160 0.7× 172 1.0× 14 0.1× 54 0.8× 51 566
Mustapha Chellali Algeria 21 1.2k 3.7× 201 0.8× 215 1.2× 12 0.1× 356 4.9× 135 1.4k
V. Neumann‐Lara Mexico 15 562 1.7× 291 1.2× 311 1.7× 10 0.1× 45 0.6× 40 654
Nader Jafari Rad Iran 13 606 1.8× 123 0.5× 95 0.5× 8 0.1× 169 2.3× 126 679
David P. Jacobs United States 16 304 0.9× 201 0.8× 47 0.3× 22 0.2× 230 3.2× 55 564
Iztok Peterin Slovenia 11 359 1.1× 134 0.6× 123 0.7× 8 0.1× 63 0.9× 71 408
Bill Sands Canada 11 308 0.9× 111 0.5× 133 0.7× 7 0.1× 16 0.2× 43 380
C. Berge France 9 218 0.7× 65 0.3× 64 0.4× 23 0.2× 29 0.4× 13 278

Countries citing papers authored by Vadim E. Levit

Since Specialization
Citations

This map shows the geographic impact of Vadim E. Levit's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Vadim E. Levit with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vadim E. Levit more than expected).

Fields of papers citing papers by Vadim E. Levit

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Vadim E. Levit. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Vadim E. Levit. The network helps show where Vadim E. Levit may publish in the future.

Co-authorship network of co-authors of Vadim E. Levit

This figure shows the co-authorship network connecting the top 25 collaborators of Vadim E. Levit. A scholar is included among the top collaborators of Vadim E. Levit based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Vadim E. Levit. Vadim E. Levit is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Levit, Vadim E. & Eugen Mǎndrescu. (2025). On almost bipartite non-König–Egerváry graphs. Discrete Applied Mathematics. 366. 127–134. 1 indexed citations
2.
Levit, Vadim E., et al.. (2018). Incentive-based search for efficient equilibria of the public goods game. Artificial Intelligence. 262. 142–162. 5 indexed citations
3.
Levit, Vadim E., et al.. (2016). Two more characterizations of König–Egerváry graphs. Discrete Applied Mathematics. 231. 175–180. 4 indexed citations
4.
Levit, Vadim E., et al.. (2015). Tradeoffs between incentive mechanisms in Boolean games. International Conference on Artificial Intelligence. 68–74. 2 indexed citations
5.
Levit, Vadim E., et al.. (2014). Hultman Numbers and Generalized Commuting Probability in Finite Groups. 20.
6.
Levit, Vadim E. & Eugen Mǎndrescu. (2013). On the intersection of all critical sets of a unicyclic graph. Discrete Applied Mathematics. 162. 409–414. 4 indexed citations
7.
Levit, Vadim E. & Eugen Mǎndrescu. (2012). On the structure of the minimum critical independent set of a graph. Discrete Mathematics. 313(5). 605–610. 3 indexed citations
8.
Levit, Vadim E. & Eugen Mǎndrescu. (2012). Local maximum stable set greedoids stemming from very well-covered graphs. Discrete Applied Mathematics. 160(12). 1864–1871. 1 indexed citations
9.
Levit, Vadim E. & Eugen Mǎndrescu. (2011). On local maximum stable set greedoids. Discrete Mathematics. 312(3). 588–596. 3 indexed citations
10.
Levit, Vadim E. & Eugen Mǎndrescu. (2010). A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. Discrete Mathematics. 311(13). 1204–1206. 4 indexed citations
11.
Levit, Vadim E., et al.. (2009). Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. CERN Document Server (European Organization for Nuclear Research). 8 indexed citations
12.
Levit, Vadim E., et al.. (2009). Duality between quasi-concave functions and monotone linkage functions. Discrete Mathematics. 310(22). 3211–3218. 2 indexed citations
13.
Levit, Vadim E. & Eugen Mǎndrescu. (2008). Well-covered graphs and greedoids. 87–91. 3 indexed citations
14.
Levit, Vadim E. & Eugen Mǎndrescu. (2007). Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. Discrete Applied Mathematics. 155(18). 2414–2425. 9 indexed citations
15.
Levit, Vadim E. & Eugen Mǎndrescu. (2006). On α-critical edges in König–Egerváry graphs. Discrete Mathematics. 306(15). 1684–1693. 10 indexed citations
16.
Levit, Vadim E. & Eugen Mǎndrescu. (2005). Square-stable and well-covered graphs.. 10. 297–307. 1 indexed citations
17.
Levit, Vadim E. & Eugen Mǎndrescu. (2003). On α+-stable König–Egerváry graphs. Discrete Mathematics. 263(1-3). 179–190. 16 indexed citations
18.
Levit, Vadim E. & Eugen Mǎndrescu. (2002). Combinatorial properties of the family of maximum stable sets of a graph. Discrete Applied Mathematics. 117(1-3). 149–161. 21 indexed citations
19.
Levit, Vadim E. & Eugen Mǎndrescu. (1999). Maximum Stable Sets and Pendant Vertices in Trees. arXiv (Cornell University). 2 indexed citations
20.
Aizenberg, Lev, Victor Adamchik, & Vadim E. Levit. (1997). Approaching the Riemann hypothesis with Mathematica. 7(1). 54–57. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026