| 2025 | STACS | Canonical Labeling of Sparse Random Graphs. | Oleg Verbitsky, Maksim Zhukovskii |
| 2024 | STACS | On a Hierarchy of Spectral Invariants for Graphs. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2024 | WALCOM | Canonization of a Random Circulant Graph by Counting Walks. | Oleg Verbitsky, Maksim Zhukovskii |
| 2023 | ESA | Canonization of a Random Graph by Two Matrix-Vector Multiplications. | Oleg Verbitsky, Maksim Zhukovskii |
| 2022 | WG | On Anti-stochastic Properties of Unlabeled Graphs. | Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii |
| 2021 | CIAC | The Weisfeiler-Leman Algorithm and Recognition of Graph Properties. | Frank Fuhlbrck, Johannes Kbler, Ilia Ponomarenko, Oleg Verbitsky |
| 2020 | LATA | On the Weisfeiler-Leman Dimension of Fractional Packing. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2020 | STACS | Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. | Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2019 | FCT | On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. | Vikraman Arvind, Frank Fuhlbrck, Johannes Kbler, Oleg Verbitsky |
| 2017 | CSL | On the First-Order Complexity of Induced Subgraph Isomorphism. | Oleg Verbitsky, Maksim Zhukovskii |
| 2017 | CSR | The Descriptive Complexity of Subgraph Isomorphism Without Numerics. | Oleg Verbitsky, Maksim Zhukovskii |
| 2017 | WADS | The Complexity of Drawing Graphs on Few Lines and Few Planes. | Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff |
| 2016 | GD | Drawing Graphs on Few Lines and Few Planes. | Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff |
| 2015 | FCT | On the Power of Color Refinement. | Vikraman Arvind, Johannes Kbler, Gaurav Rattan, Oleg Verbitsky |
| 2015 | LICS | Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth. | Andreas Krebs, Oleg Verbitsky |
| 2015 | MFCS | On Tinhofer's Linear Programming Approach to Isomorphism Testing. | Vikraman Arvind, Johannes Kbler, Gaurav Rattan, Oleg Verbitsky |
| 2013 | CSL | Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy. | Christoph Berkholz, Andreas Krebs, Oleg Verbitsky |
| 2013 | MFCS | On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing. | Christoph Berkholz, Oleg Verbitsky |
| 2013 | MFCS | Helly Circular-Arc Graph Isomorphism Is in Logspace. | Johannes Kbler, Sebastian Kuhnert, Oleg Verbitsky |
| 2011 | WG | On Collinear Sets in Straight-Line Drawings. | Alexander Ravsky, Oleg Verbitsky |
| 2010 | ICALP | Interval Graphs: Canonical Representation in Logspace. | Johannes Kbler, Sebastian Kuhnert, Bastian Laubner, Oleg Verbitsky |
| 2008 | CSR | From Invariants to Canonization in Parallel. | Johannes Kbler, Oleg Verbitsky |
| 2007 | STACS | Planar Graphs: Logical Complexity and Parallel Isomorphism Tests. | Oleg Verbitsky |
| 2006 | ICALP | Testing Graph Isomorphism in Parallel by Playing a Game. | Martin Grohe, Oleg Verbitsky |
| 2005 | STACS | On the Computational Complexity of the Forcing Chromatic Number. | Frank Harary, Wolfgang Slany, Oleg Verbitsky |