Oleg Verbitsky

2.2k total citations
72 papers, 1.3k citations indexed

About

Oleg Verbitsky is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Orthopedics and Sports Medicine. According to data from OpenAlex, Oleg Verbitsky has authored 72 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computational Theory and Mathematics, 13 papers in Discrete Mathematics and Combinatorics and 11 papers in Orthopedics and Sports Medicine. Recurrent topics in Oleg Verbitsky's work include Advanced Graph Theory Research (28 papers), Complexity and Algorithms in Graphs (16 papers) and Limits and Structures in Graph Theory (12 papers). Oleg Verbitsky is often cited by papers focused on Advanced Graph Theory Research (28 papers), Complexity and Algorithms in Graphs (16 papers) and Limits and Structures in Graph Theory (12 papers). Oleg Verbitsky collaborates with scholars based in Germany, Israel and Ukraine. Oleg Verbitsky's co-authors include J. Mizrahi, E. Isakov, Svetlana Pushkar, Arkady Voloshin, Rafael Beyar, S. Sideman, Johannes Köbler, Oleg Pikhurko, Uriel Feige and Eitan Kimmel and has published in prestigious journals such as The Journal of Clinical Endocrinology & Metabolism, Journal of Applied Physiology and SIAM Journal on Computing.

In The Last Decade

Oleg Verbitsky

68 papers receiving 1.2k citations

Peers

Oleg Verbitsky

OSM

CTM

PHYSI

Matt Spencer Norway

Peter Kropf Switzerland

Alpha Agape Gopalai Malaysia

Ian Palmer United States

Osama Abdel‐Raouf Egypt

István Bíró Hungary

Ragnhild Gunderson Norway

Neucimar J. Leite Brazil

Jeffrey A. Reinbolt United States

Narender P. Reddy United States

Matt Spencer Norway

Oleg Verbitsky

2.6k ×4.4

OSM

624 ×1.1

56 ×0.4

CTM

4 ×0.0

178 ×1.9

PHYSI

Citations per year, relative to Oleg Verbitsky Oleg Verbitsky (= 1×) peers Matt Spencer

Countries citing papers authored by Oleg Verbitsky

Since Specialization

Citations

This map shows the geographic impact of Oleg Verbitsky'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 Oleg Verbitsky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oleg Verbitsky more than expected).

Fields of papers citing papers by Oleg Verbitsky

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Oleg Verbitsky. 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 Oleg Verbitsky. The network helps show where Oleg Verbitsky may publish in the future.

Co-authorship network of co-authors of Oleg Verbitsky

This figure shows the co-authorship network connecting the top 25 collaborators of Oleg Verbitsky. A scholar is included among the top collaborators of Oleg Verbitsky 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 Oleg Verbitsky. Oleg Verbitsky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Köbler, Johannes, et al.. (2019). Identifiability of Graphs with Small Color Classes by the\n Weisfeiler-Leman Algorithm. arXiv (Cornell University). 4 indexed citations

Zhukovskii, Maksim & Oleg Verbitsky. (2019). On the First-Order Complexity of Induced Subgraph Isomorphism. Logical Methods in Computer Science. 15.

Verbitsky, Oleg & Maksim Zhukovskii. (2017). On the First-Order Complexity of Induced Subgraph Isomorphism. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations

Berkholz, Christoph & Oleg Verbitsky. (2017). On the speed of constraint propagation and the time complexity of arc consistency testing. Journal of Computer and System Sciences. 91. 104–114. 1 indexed citations

Köbler, Johannes, et al.. (2016). Circular-arc hypergraphs: Rigidity via connectedness. Discrete Applied Mathematics. 217. 220–228. 2 indexed citations

Köbler, Johannes, et al.. (2016). Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace. Journal of Discrete Algorithms. 38-41. 38–49. 6 indexed citations

Köbler, Johannes, et al.. (2016). On the isomorphism problem for Helly circular-arc graphs. Information and Computation. 247. 266–277. 1 indexed citations

Krebs, Andreas & Oleg Verbitsky. (2014). Universal covers, color refinement, and two-variable logic with counting quantifiers: Lower bounds for the depth.. arXiv (Cornell University). 1 indexed citations

Köbler, Johannes, et al.. (2012). Around and Beyond the Isomorphism Problem for Interval Graphs. Bulletin of the European Association for Theoretical Computer Science. 2(107). 43–71. 2 indexed citations

10.

Kang, Mihyun, et al.. (2011). Untangling planar graphs from a specified vertex position—Hard cases. Discrete Applied Mathematics. 159(8). 789–799. 2 indexed citations

11.

Банах, Тарас, et al.. (2010). Fermat’s Spiral and the Line Between Yin and Yang. American Mathematical Monthly. 117(9). 786–800. 1 indexed citations

12.

Kang, Mihyun, et al.. (2008). Obfuscated Drawings of Planar Graphs. arXiv (Cornell University). 2 indexed citations

13.

Verbitsky, Oleg. (2008). On the obfuscation complexity of planar graphs. Theoretical Computer Science. 396(1-3). 294–300. 7 indexed citations

14.

Pikhurko, Oleg, Joel Spencer, & Oleg Verbitsky. (2005). Succinct definitions in the first order theory of graphs. Annals of Pure and Applied Logic. 139(1-3). 74–109. 12 indexed citations

15.

Verbitsky, Oleg. (2005). The first order definability of graphs with separators via the Ehrenfeucht game. Theoretical Computer Science. 343(1-2). 158–176. 3 indexed citations

16.

Pikhurko, Oleg, Joel Spencer, & Oleg Verbitsky. (2004). Succinct Definitions in the First Order Theory of Graphs II: No Quantifier Alternation. arXiv (Cornell University). 1 indexed citations

17.

Harary, Frank, Wolfgang Slany, & Oleg Verbitsky. (2001). A Symmetric Strategy in Graph Avoidance Games. arXiv (Cornell University). 369–381. 2 indexed citations

18.

Mizrahi, J., Oleg Verbitsky, & E. Isakov. (2000). Shock accelerations and attenuation in downhill and level running. Clinical Biomechanics. 15(1). 15–20. 87 indexed citations

19.

Voloshin, Arkady, J. Mizrahi, Oleg Verbitsky, & E. Isakov. (1998). Dynamic loading on the human musculoskeletal system —effect of fatigue. Clinical Biomechanics. 13(7). 515–520. 99 indexed citations

20.

Verbitsky, Oleg. (1995). The Parallel Repetition Conjecture for Trees is True. Electronic colloquium on computational complexity. 2. 2 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