Maksim Zhukovskii

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 34

Top Topics

Optimization Methods

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

Publications

Oleg Verbitsky, Maksim Zhukovskii
Canonization of a Random Circulant Graph by Counting Walks. WALCOM (2024)
Danila Demin, Maksim Zhukovskii
First order complexity of finite random structures. CoRR (2024)
S. Demyanov, Maksim Zhukovskii
Tight concentration of star saturation number in random graphs. Discret. Math. 346 (10) (2023)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Tight bounds on adjacency labels for monotone graph classes. CoRR (2023)
Yury Demidovich, Yaroslav Panichkin, Maksim Zhukovskii
Reconstruction of colours. CoRR (2023)
Vladislav Kozhevnikov, Maksim Zhukovskii
Large cycles in generalized Johnson graphs. J. Graph Theory 104 (4) (2023)
Yury Demidovich, Maksim Zhukovskii
Tight asymptotics of clique-chromatic numbers of dense random graphs. J. Graph Theory 103 (3) (2023)
Oleg Verbitsky, Maksim Zhukovskii
Canonization of a Random Graph by Two Matrix-Vector Multiplications. ESA (2023)
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii
Small But Unwieldy. CoRR (2023)
Yury Demidovich, Arkadiy Skorkin, Maksim Zhukovskii
Cycle Saturation in Random Graphs. SIAM J. Discret. Math. 37 (3) (2023)
Margarita Akhmejanova, Maksim Zhukovskii
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs. SIAM J. Discret. Math. 36 (3) (2022)
V. S. Kozhevnikov, Andrei M. Raigorodskii, Maksim Zhukovskii
Large cycles in random generalized Johnson graphs. Discret. Math. 345 (3) (2022)
Mikhail Isaev, Angus Southwell, Maksim Zhukovskii
Distribution of tree parameters by martingale approach. Comb. Probab. Comput. 31 (5) (2022)
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
On Anti-stochastic Properties of Unlabeled Graphs. WG (2022)
Moumanti Podder, Maksim Zhukovskii
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth. ACM Trans. Comput. Log. 23 (2) (2022)
József Balogh, Maksim Zhukovskii
On the sizes of large subgraphs of the binomial random graph. Discret. Math. 345 (2) (2022)
Itai Benjamini, Maksim Zhukovskii
A very sharp threshold for first order logic distinguishability of random graphs. CoRR (2022)
M. Krivoshapko, Maksim Zhukovskii
Maximum induced forests in random graphs. Discret. Appl. Math. 305 (2021)
Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii
On anti-stochastic properties of unlabeled graphs. CoRR (2021)
Dmitry Kamaldinov, Arkadiy Skorkin, Maksim Zhukovskii
Maximum sparse induced subgraphs of the binomial random graph with given number of edges. Discret. Math. 344 (2) (2021)
Alena Egorova, Maksim Zhukovskii
Existential monadic second order convergence law fails on sparse random graphs. Eur. J. Comb. 83 (2020)
Andriaherimanana Sarobidy Razafimahatratra, Maksim Zhukovskii
Zero-one laws for k-variable first-order logic of sparse random graphs. Discret. Appl. Math. 276 (2020)
Oleg Verbitsky, Maksim Zhukovskii
On the First-Order Complexity of Induced Subgraph Isomorphism. Log. Methods Comput. Sci. 15 (1) (2019)
Oleg Verbitsky, Maksim Zhukovskii
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. ACM Trans. Comput. Log. 20 (2) (2019)
Oleg Verbitsky, Maksim Zhukovskii
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. Theory Comput. Syst. 63 (4) (2019)
Oleg Verbitsky, Maksim Zhukovskii
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. CoRR (2018)
Andrey Kupavskii, Maksim Zhukovskii
Short Monadic Second Order Sentences about Sparse Random Graphs. SIAM J. Discret. Math. 32 (4) (2018)
Alexander V. Gasnikov, Maksim Zhukovskii, Sergey Kim, Fedor Noskov, Stepan Plaunov, Daniil Smirnov
Around power law for PageRank components in Buckley-Osthus model of web graph. CoRR (2017)
Oleg Verbitsky, Maksim Zhukovskii
On the First-Order Complexity of Induced Subgraph Isomorphism. CoRR (2017)
Oleg Verbitsky, Maksim Zhukovskii
On the First-Order Complexity of Induced Subgraph Isomorphism. CSL (2017)
Oleg Verbitsky, Maksim Zhukovskii
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. CSR (2017)
Lev Bogolubsky, Pavel E. Dvurechensky, Alexander V. Gasnikov, Gleb Gusev, Yurii E. Nesterov, Andrei M. Raigorodskii, Aleksey Tikhonov, Maksim Zhukovskii
Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. NIPS (2016)
Oleg Verbitsky, Maksim Zhukovskii
The Descriptive Complexity of Subgraph Isomorphism in the Absence of Order. CoRR (2016)
Andrey Kupavskii, Maksim Zhukovskii
Short monadic second order sentences about sparse random graphs. CoRR (2016)
Maksim Zhukovskii, Gleb Gusev, Pavel Serdyukov
URL Redirection Accounting for Improving Link-Based Ranking Methods. ECIR (2013)
Maksim Zhukovskii
Zero-one k-law. Discret. Math. 312 (10) (2012)