Вступ до криптології ОВ Вербіцький Львів: ВНТЛ 248, 1998 | 82 | 1998 |

Error reduction by parallel repetition—a negative result U Feige*, O Verbitsky† Combinatorica 22 (4), 461-478, 2002 | 58* | 2002 |

Towards the parallel repetition conjecture O Verbitsky Theoretical computer science 157 (2), 277-282, 1996 | 57 | 1996 |

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 | 52 | 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 | 52 | 2020 |

Testing graph isomorphism in parallel by playing a game M Grohe, O Verbitsky Automata, Languages and Programming, 3-14, 2006 | 50 | 2006 |

On the power of color refinement V Arvind, J Köbler, G Rattan, O Verbitsky Fundamentals of Computation Theory, 339-350, 2015 | 49 | 2015 |

Interval graphs: Canonical representations in Logspace J Köbler, S Kuhnert, B Laubner, O Verbitsky SIAM Journal on Computing 40 (5), 1292-1315, 2011 | 42 | 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 | 37 | 2005 |

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 |

Graph isomorphism, color refinement, and compactness V Arvind, J Köbler, G Rattan, O Verbitsky computational complexity, 1-59, 2015 | 28 | 2015 |

Logical complexity of graphs: a survey O Pikhurko, O Verbitsky | 27 | 2010 |

Planar graphs: Logical complexity and parallel isomorphism tests O Verbitsky STACS 2007, 682-693, 2007 | 24 | 2007 |

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 | 23 | 2017 |

On the obfuscation complexity of planar graphs O Verbitsky Theoretical Computer Science 396 (1-3), 294-300, 2008 | 22 | 2008 |

Drawing graphs on few lines and few planes S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff International Symposium on Graph Drawing and Network Visualization, 166-180, 2016 | 20 | 2016 |

Drawing graphs on few lines and few planes S Chaplick, K Fleszar, F Lipp, A Ravsky, O Verbitsky, A Wolff International Symposium on Graph Drawing and Network Visualization, 166-180, 2016 | 20 | 2016 |

Untangling planar graphs from a specified vertex position—Hard cases M Kang, O Pikhurko, A Ravsky, M Schacht, O Verbitsky Discrete Applied Mathematics 159 (8), 789-799, 2011 | 20* | 2011 |

On collinear sets in straight-line drawings A Ravsky, O Verbitsky Graph-Theoretic Concepts in Computer Science, 295-306, 2011 | 20 | 2011 |