| On Weisfeiler-Leman invariance: Subgraph counts and related graph properties V Arvind, F Fuhlbrück, J Köbler, O Verbitsky Journal of Computer and System Sciences 113, 42-59, 2020 | 97 | 2020 |
| On Weisfeiler-Leman invariance: Subgraph counts and related graph properties V Arvind, F Fuhlbrück, J Köbler, O Verbitsky Journal of Computer and System Sciences 113, 42-59, 2020 | 97 | 2020 |
| Вступ до криптології ОВ Вербіцький Львів: ВНТЛ 248, 1998 | 85 | 1998 |
| On the power of color refinement V Arvind, J Köbler, G Rattan, O Verbitsky Fundamentals of Computation Theory, 339-350, 2015 | 74 | 2015 |
| Towards the parallel repetition conjecture O Verbitsky Theoretical computer science 157 (2), 277-282, 1996 | 62 | 1996 |
| Error reduction by parallel repetition—a negative result U Feige*, O Verbitsky† Combinatorica 22 (4), 461-478, 2002 | 61* | 2002 |
| Testing graph isomorphism in parallel by playing a game M Grohe, O Verbitsky Automata, Languages and Programming, 3-14, 2006 | 60 | 2006 |
| Interval graphs: Canonical representations in Logspace J Köbler, S Kuhnert, B Laubner, O Verbitsky SIAM Journal on Computing 40 (5), 1292-1315, 2011 | 43 | 2011 |
| How complex are random graphs in first order logic? JH Kim, O Pikhurko, JH Spencer, O Verbitsky Random Structures & Algorithms 26 (1‐2), 119-145, 2005 | 39 | 2005 |
| Graph isomorphism, color refinement, and compactness V Arvind, J Köbler, G Rattan, O Verbitsky computational complexity, 1-59, 2015 | 37 | 2015 |
| Logical complexity of graphs: a survey O Pikhurko, O Verbitsky | 33 | 2010 |
| Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth A Krebs, O Verbitsky 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 689-700, 2015 | 30 | 2015 |
| Succinct definitions in the first order theory of graphs O Pikhurko, J Spencer, O Verbitsky Annals of Pure and Applied Logic 139 (1-3), 74-109, 2006 | 29 | 2006 |
| Succinct definitions in the first order theory of graphs O Pikhurko, J Spencer, O Verbitsky Annals of Pure and Applied Logic 139 (1-3), 74-109, 2006 | 29 | 2006 |
| Planar graphs: Logical complexity and parallel isomorphism tests O Verbitsky STACS 2007, 682-693, 2007 | 26 | 2007 |
| Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm F Fuhlbrück, J Köbler, O Verbitsky SIAM Journal on Discrete Mathematics 35 (3), 1792-1853, 2021 | 25 | 2021 |
| The Complexity of Drawing Graphs on Few Lines and Few Planes S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff Workshop on Algorithms and Data Structures, 265-276, 2017 | 25 | 2017 |
| On collinear sets in straight-line drawings A Ravsky, O Verbitsky Graph-Theoretic Concepts in Computer Science, 295-306, 2011 | 22 | 2011 |
| On the obfuscation complexity of planar graphs O Verbitsky Theoretical Computer Science 396 (1-3), 294-300, 2008 | 22 | 2008 |
| From invariants to canonization in parallel J Köbler, O Verbitsky Computer Science–Theory and Applications, 216-227, 2008 | 22 | 2008 |
