On a sequence of random distance graphs subject to the zero-one law. - Maksim E. Zhukovskii (Probl. Inf. Transm., 2011)

Zero-one k-law. - Maksim Zhukovskii (Discret. Math., 2012)

URL Redirection Accounting for Improving Link-Based Ranking Methods. - Maksim Zhukovskii; Gleb Gusev; Pavel Serdyukov (ECIR, 2013)

Extension of the Zero-one k-law. - Maksim E. Zhukovskii (Electron. Notes Discret. Math., 2013)

Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. - Lev Bogolubsky; Pavel E. Dvurechensky; Alexander V. Gasnikov; Gleb Gusev; Yurii E. Nesterov; Andrei M. Raigorodskii; Aleksey Tikhonov; Maksim Zhukovskii (NIPS, 2016)

The Descriptive Complexity of Subgraph Isomorphism in the Absence of Order. - Oleg Verbitsky 001; Maksim Zhukovskii (CoRR, 2016)

Bounded quantifier depth spectra for random graphs. - Joel H. Spencer; Maksim E. Zhukovskii (Discret. Math., 2016)

Monadic second-order properties of very sparse random graphs. - L. B. Ostrovsky; Maksim E. Zhukovskii (Ann. Pure Appl. Log., 2017)

Around power law for PageRank components in Buckley-Osthus model of web graph. - Alexander V. Gasnikov; Maksim Zhukovskii; Sergey Kim; Fedor Noskov; Stepan Plaunov; Daniil Smirnov (CoRR, 2017)

On the zero-one k-law extensions. - Maksim E. Zhukovskii (Eur. J. Comb., 2017)

Quantifier Alternation in First-Order Formulas with Infinite Spectra. - Maksim E. Zhukovskii (Probl. Inf. Transm., 2017)

First order sentences about random graphs: Small number of alternations. - A. D. Matushkin; Maksim E. Zhukovskii (Discret. Appl. Math., 2018)

Short Monadic Second Order Sentences about Sparse Random Graphs. - Andrey Kupavskii; Maksim Zhukovskii (SIAM J. Discret. Math., 2018)

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false. - S. N. Popova; Maksim E. Zhukovskii (Ann. Pure Appl. Log., 2019)

On the First-Order Complexity of Induced Subgraph Isomorphism. - Oleg Verbitsky 001; Maksim Zhukovskii (Log. Methods Comput. Sci., 2019)

The Descriptive Complexity of Subgraph Isomorphism Without Numerics. - Oleg Verbitsky 001; Maksim Zhukovskii (Theory Comput. Syst., 2019)

Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. - Oleg Verbitsky 001; Maksim Zhukovskii (ACM Trans. Comput. Log., 2019)

Zero-one laws for k-variable first-order logic of sparse random graphs. - Andriaherimanana Sarobidy Razafimahatratra; Maksim Zhukovskii (Discret. Appl. Math., 2020)

Existential monadic second order convergence law fails on sparse random graphs. - Alena Egorova; Maksim Zhukovskii (Eur. J. Comb., 2020)

Logical laws for short existential monadic second-order sentences about graphs. - Maksim E. Zhukovskii (J. Math. Log., 2020)

Maximum induced forests in random graphs. - M. Krivoshapko; Maksim Zhukovskii (Discret. Appl. Math., 2021)

Maximum sparse induced subgraphs of the binomial random graph with given number of edges. - Dmitry Kamaldinov; Arkadiy Skorkin; Maksim Zhukovskii (Discret. Math., 2021)

On Anti-stochastic Properties of Unlabeled Graphs. - Sergei Kiselev; Andrey Kupavskii; Oleg Verbitsky 001; Maksim Zhukovskii (WG, 2022)

A very sharp threshold for first order logic distinguishability of random graphs. - Itai Benjamini; Maksim Zhukovskii (CoRR, 2022)

Distribution of tree parameters by martingale approach. - Mikhail Isaev; Angus Southwell; Maksim Zhukovskii (Comb. Probab. Comput., 2022)

On the sizes of large subgraphs of the binomial random graph. - József Balogh; Maksim Zhukovskii (Discret. Math., 2022)

Large cycles in random generalized Johnson graphs. - Vladislav Kozhevnikov; Andrei M. Raigorodskii; Maksim Zhukovskii (Discret. Math., 2022)

γ-variable first-order logic of uniform attachment random graphs. - Yury A. Malyshkin; Maksim E. Zhukovskii (Discret. Math., 2022)

Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth. - Moumanti Podder; Maksim Zhukovskii (ACM Trans. Comput. Log., 2022)

EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs. - Margarita Akhmejanova; Maksim Zhukovskii (SIAM J. Discret. Math., 2022)

Canonization of a Random Graph by Two Matrix-Vector Multiplications. - Oleg Verbitsky 001; Maksim Zhukovskii (ESA, 2023)

Small But Unwieldy. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2023)

Reconstruction of colours. - Yury Demidovich; Yaroslav Panichkin; Maksim Zhukovskii (CoRR, 2023)

Tight concentration of star saturation number in random graphs. - S. Demyanov; Maksim Zhukovskii (Discret. Math., 2023)

The distribution of the maximum number of common neighbors in the random graph. - I. V. Rodionov; Maksim E. Zhukovskii (Eur. J. Comb., 2023)

Tight asymptotics of clique-chromatic numbers of dense random graphs. - Yury Demidovich; Maksim Zhukovskii (J. Graph Theory, 2023)

Cycle Saturation in Random Graphs. - Yury Demidovich; Arkadiy Skorkin; Maksim Zhukovskii (SIAM J. Discret. Math., 2023)

Weak saturation stability. - O. Kalinichenko; Maksim Zhukovskii (Eur. J. Comb., 2023)

Large cycles in generalized Johnson graphs. - Vladislav Kozhevnikov; Maksim Zhukovskii (J. Graph Theory, 2023)

Tight Bounds on Adjacency Labels for Monotone Graph Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (ICALP, 2024)

First order complexity of finite random structures. - Danila Demin; Maksim Zhukovskii (LICS, 2024)

First order distinguishability of sparse random graphs. - Tal Hershko; Maksim Zhukovskii (LICS, 2024)

Canonization of a Random Circulant Graph by Counting Walks. - Oleg Verbitsky 001; Maksim Zhukovskii (WALCOM, 2024)

Gathering Information about a Graph by Counting Walks from a Single Vertex. - Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001; Maksim Zhukovskii (CoRR, 2024)

Canonical labelling of sparse random graphs. - Oleg Verbitsky 001; Maksim Zhukovskii (CoRR, 2024)

Functionality of Random Graphs. - John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (CoRR, 2024)

Maximum chordal subgraphs of random graphs. - Michael Krivelevich; Maksim Zhukovskii (Comb. Probab. Comput., 2024)

Threshold for stability of weak saturation. - Mohammadreza Bidgoli; Ali Mohammadian; Behruz Tayfeh-Rezaie; Maksim Zhukovskii (J. Graph Theory, 2024)

Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. - Édouard Bonnet; Julien Duron; John Sylvester 001; Viktor Zamaraev; Maksim Zhukovskii (SIAM J. Comput., 2024)

On Isomorphism-Invariant Antistochastic Properties of Random Graphs. - Sergei Kiselev; Andrey Kupavskii; Oleg Verbitsky 001; Maksim Zhukovskii (SIAM J. Discret. Math., 2024)

Maximum Number of Symmetric Extensions in Random Graphs. - Stepan Vakhrushev; Maksim Zhukovskii (SIAM J. Discret. Math., 2024)

On vertex Ramsey graphs with forbidden subgraphs. - Sahar Diskin; Ilay Hoshen; Michael Krivelevich; Maksim Zhukovskii (Discret. Math., 2024)

Spectrum of FO Logic with Quantifier Depth 4 is Finite. - Yury Yarovikov; Maksim Zhukovskii (ACM Trans. Comput. Log., 2024)

Tiling Random Regular Graphs Efficiently. - Sahar Diskin; Ilay Hoshen; Maksim Zhukovskii (ICALP, 2025)

Canonical Labeling of Sparse Random Graphs. - Oleg Verbitsky 001; Maksim Zhukovskii (STACS, 2025)

Saturation numbers of bipartite graphs in random graphs. - Meysam Miralaei; Ali Mohammadian; Behruz Tayfeh-Rezaie; Maksim Zhukovskii (Discret. Math., 2025)

On the maximum number of common neighbours in dense random regular graphs. - Mikhail Isaev; Maksim Zhukovskii (Eur. J. Comb., 2025)

Weak saturation in graphs: A combinatorial approach. - Nikolai Terekhov; Maksim Zhukovskii (J. Comb. Theory B, 2025)

A Jump of the Saturation Number in Random Graphs? - Sahar Diskin; Ilay Hoshen; Maksim Zhukovskii (Random Struct. Algorithms, 2025)

Randomly Twisted Hypercubes: Between Structure and Randomness. - Itai Benjamini; Yotam Dikstein; Renan Gross; Maksim Zhukovskii (Random Struct. Algorithms, 2025)

New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density. - Oleg Pikhurko; Oleg Verbitsky 001; Maksim Zhukovskii (IEEE Trans. Inf. Theory, 2025)