Oleg Verbitsky
Oleg Verbitsky
Інститут прикладних проблем механіки і математики ім.Я.С.Підстригача, Humboldt Universität zu Berlin
Verified email at informatik.hu-berlin.de - Homepage
Title
Cited by
Cited by
Year
Вступ до криптології
ОВ Вербіцький
Львів: ВНТЛ 248, 1998
671998
Error reduction by parallel repetition—a negative result
U Feige*, O Verbitsky†
Combinatorica 22 (4), 461-478, 2002
59*2002
Towards the parallel repetition conjecture
O Verbitsky
Theoretical computer science 157 (2), 277-282, 1996
521996
Testing graph isomorphism in parallel by playing a game
M Grohe, O Verbitsky
Automata, Languages and Programming, 3-14, 2006
462006
Interval graphs: Canonical representations in Logspace
J Köbler, S Kuhnert, B Laubner, O Verbitsky
SIAM Journal on Computing 40 (5), 1292-1315, 2011
382011
On the power of color refinement
V Arvind, J Köbler, G Rattan, O Verbitsky
Fundamentals of Computation Theory, 339-350, 2015
372015
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
342020
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
342020
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
332005
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
282006
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
282006
Graph isomorphism, color refinement, and compactness
V Arvind, J Köbler, G Rattan, O Verbitsky
computational complexity, 1-59, 2015
252015
Logical complexity of graphs: a survey
O Pikhurko, O Verbitsky
242010
On the obfuscation complexity of planar graphs
O Verbitsky
Theoretical Computer Science 396 (1-3), 294-300, 2008
232008
Planar graphs: Logical complexity and parallel isomorphism tests
O Verbitsky
STACS 2007, 682-693, 2007
222007
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
212017
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
202016
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
202016
A Ramsey treatment of symmetry
T Banakh, O Verbitsky, Y Vorobets
the electronic journal of combinatorics 7 (1), 52, 2000
202000
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
19*2011
The system can't perform the operation now. Try again later.
Articles 1–20