| 2026 | ICALP | Canonical Labelling of Random Regular Graphs. | Mikhail Isaev, Tams Makai, Brendan D. McKay, Pawel Pralat, Jane Tan, Maksim Zhukovskii |
| 2025 | ESA | Reconstructing Random Graphs from Distance Queries. | Michael Krivelevich, Maksim Zhukovskii |
| 2025 | ICALP | Tiling Random Regular Graphs Efficiently. | Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii |
| 2025 | STACS | Canonical Labeling of Sparse Random Graphs. | Oleg Verbitsky, Maksim Zhukovskii |
| 2024 | ICALP | Tight Bounds on Adjacency Labels for Monotone Graph Classes. | douard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii |
| 2024 | LICS | First order complexity of finite random structures. | Danila Demin, Maksim Zhukovskii |
| 2024 | LICS | First order distinguishability of sparse random graphs. | Tal Hershko, Maksim Zhukovskii |
| 2024 | SODA | Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. | Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii |
| 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 |
| 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 |
| 2013 | ECIR | URL Redirection Accounting for Improving Link-Based Ranking Methods. | Maksim Zhukovskii, Gleb Gusev, Pavel Serdyukov |