Maksim Zhukovskii

69 papers A* 5A 4B 3Misc 1Journal 55Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Canonical labelling of random regular graphs.
CoRR
Mikhail Isaev, Tamás Makai, Brendan D. McKay, Pawel Pralat, Jane Tan, Maksim Zhukovskii
2026 J jnl
Canonization of a random circulant graph by counting walks.
Comb. Probab. Comput.
Oleg Verbitsky, Maksim Zhukovskii
2026 J jnl
Covering three-tori with cubes.
Australas. J Comb.
Ilya I. Bogdanov, Oleg Grigoryan, Maksim Zhukovskii
2026 J jnl
Saturation in random hypergraphs.
Comb. Probab. Comput.
Sahar Diskin, Ilay Hoshen, Dániel Korándi, Benny Sudakov, Maksim Zhukovskii
2025 J jnl
A Jump of the Saturation Number in Random Graphs?
Random Struct. Algorithms
Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii
2025 A conf
Canonical Labeling of Sparse Random Graphs.
STACS
Oleg Verbitsky, Maksim Zhukovskii
2025 J jnl
New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density.
IEEE Trans. Inf. Theory
Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii
2025 J jnl
On the maximum number of common neighbours in dense random regular graphs.
Eur. J. Comb.
Mikhail Isaev, Maksim Zhukovskii
2025 J jnl
Randomly Twisted Hypercubes: Between Structure and Randomness.
Random Struct. Algorithms
Itai Benjamini, Yotam Dikstein, Renan Gross, Maksim Zhukovskii
2025 A conf
Reconstructing Random Graphs from Distance Queries.
ESA
Michael Krivelevich, Maksim Zhukovskii
2025 J jnl
Saturation numbers of bipartite graphs in random graphs.
Discret. Math.
Meysam Miralaei, Ali Mohammadian, Behruz Tayfeh-Rezaie, Maksim Zhukovskii
2025 A* conf
Tiling Random Regular Graphs Efficiently.
ICALP
Sahar Diskin, Ilay Hoshen, Maksim Zhukovskii
2025 J jnl
Weak saturation in graphs: A combinatorial approach.
J. Comb. Theory B
Nikolai Terekhov, Maksim Zhukovskii
2025 J jnl
Weak saturation rank: a failure of the linear algebraic approach to weak saturation.
Comb.
Nikolai Terekhov, Maksim Zhukovskii
2024 J jnl
Canonical labelling of sparse random graphs.
CoRR
Oleg Verbitsky, Maksim Zhukovskii
2024 B conf
Canonization of a Random Circulant Graph by Counting Walks.
WALCOM
Oleg Verbitsky, Maksim Zhukovskii
2024 A* conf
First order complexity of finite random structures.
LICS
Danila Demin, Maksim Zhukovskii
2024 J jnl
First order complexity of finite random structures.
CoRR
Danila Demin, Maksim Zhukovskii
2024 A* conf
First order distinguishability of sparse random graphs.
LICS
Tal Hershko, Maksim Zhukovskii
2024 J jnl
First order distinguishability of sparse random graphs.
CoRR
Tal Hershko, Maksim Zhukovskii
2024 J jnl
Functionality of Random Graphs.
CoRR
John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024 J jnl
Gathering Information about a Graph by Counting Walks from a Single Vertex.
CoRR
Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky, Maksim Zhukovskii
2024 J jnl
Maximum Number of Symmetric Extensions in Random Graphs.
SIAM J. Discret. Math.
Stepan Vakhrushev, Maksim Zhukovskii
2024 J jnl
Maximum chordal subgraphs of random graphs.
Comb. Probab. Comput.
Michael Krivelevich, Maksim Zhukovskii
2024 J jnl
New bounds for the optimal density of covering single-insertion codes via the Turán density.
CoRR
Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii
2024 J jnl
On Isomorphism-Invariant Antistochastic Properties of Random Graphs.
SIAM J. Discret. Math.
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
2024 J jnl
On vertex Ramsey graphs with forbidden subgraphs.
Discret. Math.
Sahar Diskin, Ilay Hoshen, Michael Krivelevich, Maksim Zhukovskii
2024 A* conf
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.
SODA
Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024 J jnl
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes.
SIAM J. Comput.
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2024 J jnl
Spectrum of FO Logic with Quantifier Depth 4 is Finite.
ACM Trans. Comput. Log.
Yury Yarovikov, Maksim Zhukovskii
2024 J jnl
Threshold for stability of weak saturation.
J. Graph Theory
Mohammadreza Bidgoli, Ali Mohammadian, Behruz Tayfeh-Rezaie, Maksim Zhukovskii
2024 A* conf
Tight Bounds on Adjacency Labels for Monotone Graph Classes.
ICALP
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023 A conf
Canonization of a Random Graph by Two Matrix-Vector Multiplications.
ESA
Oleg Verbitsky, Maksim Zhukovskii
2023 J jnl
Canonization of a random circulant graph by counting walks.
CoRR
Oleg Verbitsky, Maksim Zhukovskii
2023 J jnl
Canonization of a random graph by two matrix-vector multiplications.
CoRR
Oleg Verbitsky, Maksim Zhukovskii
2023 J jnl
Cycle Saturation in Random Graphs.
SIAM J. Discret. Math.
Yury Demidovich, Arkadiy Skorkin, Maksim Zhukovskii
2023 J jnl
Large cycles in generalized Johnson graphs.
J. Graph Theory
Vladislav Kozhevnikov, Maksim Zhukovskii
2023 J jnl
Reconstruction of colours.
CoRR
Yury Demidovich, Yaroslav Panichkin, Maksim Zhukovskii
2023 J jnl
Small But Unwieldy.
CoRR
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023 J jnl
Tight asymptotics of clique-chromatic numbers of dense random graphs.
J. Graph Theory
Yury Demidovich, Maksim Zhukovskii
2023 J jnl
Tight bounds on adjacency labels for monotone graph classes.
CoRR
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
2023 J jnl
Tight concentration of star saturation number in random graphs.
Discret. Math.
S. Demyanov, Maksim Zhukovskii
2023 J jnl
Weak saturation stability.
Eur. J. Comb.
O. Kalinichenko, Maksim Zhukovskii
2022 J jnl
A very sharp threshold for first order logic distinguishability of random graphs.
CoRR
Itai Benjamini, Maksim Zhukovskii
2022 J jnl
Distribution of tree parameters by martingale approach.
Comb. Probab. Comput.
Mikhail Isaev, Angus Southwell, Maksim Zhukovskii
2022 J jnl
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs.
SIAM J. Discret. Math.
Margarita Akhmejanova, Maksim Zhukovskii
2022 J jnl
Large cycles in random generalized Johnson graphs.
Discret. Math.
Vladislav Kozhevnikov, Andrei M. Raigorodskii, Maksim Zhukovskii
2022 B conf
On Anti-stochastic Properties of Unlabeled Graphs.
WG
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
2022 J jnl
On the sizes of large subgraphs of the binomial random graph.
Discret. Math.
József Balogh, Maksim Zhukovskii
2022 J jnl
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth.
ACM Trans. Comput. Log.
Moumanti Podder, Maksim Zhukovskii
2021 J jnl
Maximum induced forests in random graphs.
Discret. Appl. Math.
M. Krivoshapko, Maksim Zhukovskii
2021 J jnl
Maximum sparse induced subgraphs of the binomial random graph with given number of edges.
Discret. Math.
Dmitry Kamaldinov, Arkadiy Skorkin, Maksim Zhukovskii
2021 J jnl
On anti-stochastic properties of unlabeled graphs.
CoRR
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
2020 J jnl
Existential monadic second order convergence law fails on sparse random graphs.
Eur. J. Comb.
Alena Egorova, Maksim Zhukovskii
2020 J jnl
Zero-one laws for k-variable first-order logic of sparse random graphs.
Discret. Appl. Math.
Andriaherimanana Sarobidy Razafimahatratra, Maksim Zhukovskii
2019 J jnl
On the First-Order Complexity of Induced Subgraph Isomorphism.
Log. Methods Comput. Sci.
Oleg Verbitsky, Maksim Zhukovskii
2019 J jnl
The Descriptive Complexity of Subgraph Isomorphism Without Numerics.
Theory Comput. Syst.
Oleg Verbitsky, Maksim Zhukovskii
2019 J jnl
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism.
ACM Trans. Comput. Log.
Oleg Verbitsky, Maksim Zhukovskii
2018 J jnl
Short Monadic Second Order Sentences about Sparse Random Graphs.
SIAM J. Discret. Math.
Andrey Kupavskii, Maksim Zhukovskii
2018 J jnl
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism.
CoRR
Oleg Verbitsky, Maksim Zhukovskii
2017 J jnl
Around power law for PageRank components in Buckley-Osthus model of web graph.
CoRR
Alexander V. Gasnikov, Maksim Zhukovskii, Sergey Kim, Fedor Noskov, Stepan Plaunov, Daniil Smirnov
2017 B conf
On the First-Order Complexity of Induced Subgraph Isomorphism.
CSL
Oleg Verbitsky, Maksim Zhukovskii
2017 J jnl
On the First-Order Complexity of Induced Subgraph Isomorphism.
CoRR
Oleg Verbitsky, Maksim Zhukovskii
2017 Misc conf
The Descriptive Complexity of Subgraph Isomorphism Without Numerics.
CSR
Oleg Verbitsky, Maksim Zhukovskii
2016 — conf
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods.
NIPS
Lev Bogolubsky, Pavel E. Dvurechensky, Alexander V. Gasnikov, Gleb Gusev, Yurii E. Nesterov, Andrei M. Raigorodskii, Aleksey Tikhonov, Maksim Zhukovskii
2016 J jnl
Short monadic second order sentences about sparse random graphs.
CoRR
Andrey Kupavskii, Maksim Zhukovskii
2016 J jnl
The Descriptive Complexity of Subgraph Isomorphism in the Absence of Order.
CoRR
Oleg Verbitsky, Maksim Zhukovskii
2013 A conf
URL Redirection Accounting for Improving Link-Based Ranking Methods.
ECIR
Maksim Zhukovskii, Gleb Gusev, Pavel Serdyukov
2012 J jnl
Zero-one k-law.
Discret. Math.
Maksim Zhukovskii