default search action
Maksim Zhukovskii
Person information
- affiliation: University of Sheffield, Department of Computer Science, UK
- affiliation (former): Moscow Institute of Physics and Technology, Laboratory of Advanced Combinatorics and Network Applications, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Michael Krivelevich, Maksim Zhukovskii:
Maximum chordal subgraphs of random graphs. Comb. Probab. Comput. 33(5): 611-623 (2024) - [j34]Sahar Diskin, Ilay Hoshen, Michael Krivelevich, Maksim Zhukovskii:
On vertex Ramsey graphs with forbidden subgraphs. Discret. Math. 347(3): 113806 (2024) - [j33]Édouard Bonnet
, Julien Duron, John Sylvester
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SIAM J. Comput. 53(5): 1578-1601 (2024) - [j32]Stepan Vakhrushev, Maksim Zhukovskii:
Maximum Number of Symmetric Extensions in Random Graphs. SIAM J. Discret. Math. 38(3): 2468-2488 (2024) - [j31]Yury Yarovikov
Spectrum of FO Logic with Quantifier Depth 4 is Finite. ACM Trans. Comput. Log. 25(2): 9:1-9:24 (2024) - [c11]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Tight Bounds on Adjacency Labels for Monotone Graph Classes. ICALP 2024: 31:1-31:20 - [c10]Danila Demin
First order complexity of finite random structures. LICS 2024: 31:1-31:14 - [c9]Tal Hershko
First order distinguishability of sparse random graphs. LICS 2024: 44:1-44:14 - [c8]Edouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev
Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes. SODA 2024: 1147-1165 - [c7]Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a Random Circulant Graph by Counting Walks. WALCOM 2024: 319-334 - [i17]Danila Demin, Maksim Zhukovskii:
First order complexity of finite random structures. CoRR abs/2402.02567 (2024) - [i16]Tal Hershko, Maksim Zhukovskii:
First order distinguishability of sparse random graphs. CoRR abs/2405.09146 (2024) - [i15]Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky, Maksim Zhukovskii:
Gathering Information about a Graph by Counting Walks from a Single Vertex. CoRR abs/2409.03690 (2024) - [i14]Oleg Pikhurko, Oleg Verbitsky, Maksim Zhukovskii:
New bounds for the optimal density of covering single-insertion codes via the Turán density. CoRR abs/2409.06425 (2024) - [i13]Oleg Verbitsky, Maksim Zhukovskii:
Canonical labelling of sparse random graphs. CoRR abs/2409.18109 (2024) - 2023
- [j30]S. Demyanov, Maksim Zhukovskii
Tight concentration of star saturation number in random graphs. Discret. Math. 346(10): 113572 (2023) - [j29]I. V. Rodionov, Maksim E. Zhukovskii:
The distribution of the maximum number of common neighbors in the random graph. Eur. J. Comb. 107: 103602 (2023) - [j28]O. Kalinichenko, Maksim Zhukovskii:
Weak saturation stability. Eur. J. Comb. 114: 103777 (2023) - [j27]Yury Demidovich, Maksim Zhukovskii:
Tight asymptotics of clique-chromatic numbers of dense random graphs. J. Graph Theory 103(3): 451-461 (2023) - [j26]Vladislav Kozhevnikov
Large cycles in generalized Johnson graphs. J. Graph Theory 104(4): 904-918 (2023) - [j25]Yury Demidovich, Arkadiy Skorkin, Maksim Zhukovskii:
Cycle Saturation in Random Graphs. SIAM J. Discret. Math. 37(3): 1359-1385 (2023) - [c6]Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a Random Graph by Two Matrix-Vector Multiplications. ESA 2023: 100:1-100:13 - [i12]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Small But Unwieldy. CoRR abs/2307.11225 (2023) - [i11]Yury Demidovich, Yaroslav Panichkin, Maksim Zhukovskii:
Reconstruction of colours. CoRR abs/2308.01671 (2023) - [i10]Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a random circulant graph by counting walks. CoRR abs/2310.05788 (2023) - [i9]Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, Maksim Zhukovskii:
Tight bounds on adjacency labels for monotone graph classes. CoRR abs/2310.20522 (2023) - [i8]Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a random graph by two matrix-vector multiplications. CoRR abs/2312.03686 (2023) - 2022
- [j24]Mikhail Isaev, Angus Southwell, Maksim Zhukovskii:
Distribution of tree parameters by martingale approach. Comb. Probab. Comput. 31(5): 737-764 (2022) - [j23]József Balogh, Maksim Zhukovskii:
On the sizes of large subgraphs of the binomial random graph. Discret. Math. 345(2): 112675 (2022) - [j22]Vladislav Kozhevnikov
Large cycles in random generalized Johnson graphs. Discret. Math. 345(3): 112721 (2022) - [j21]Yury A. Malyshkin
γ-variable first-order logic of uniform attachment random graphs. Discret. Math. 345(5): 112802 (2022) - [j20]Margarita Akhmejanova, Maksim Zhukovskii:
EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs. SIAM J. Discret. Math. 36(3): 1788-1799 (2022) - [j19]Moumanti Podder
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth. ACM Trans. Comput. Log. 23(2): 12:1-12:27 (2022) - [c5]Sergei Kiselev
On Anti-stochastic Properties of Unlabeled Graphs. WG 2022: 300-312 - [i7]Itai Benjamini, Maksim Zhukovskii:
A very sharp threshold for first order logic distinguishability of random graphs. CoRR abs/2207.11593 (2022) - 2021
- [j18]M. Krivoshapko, Maksim Zhukovskii:
Maximum induced forests in random graphs. Discret. Appl. Math. 305: 211-213 (2021) - [j17]Dmitry Kamaldinov
Maximum sparse induced subgraphs of the binomial random graph with given number of edges. Discret. Math. 344(2): 112205 (2021) - [i6]Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
On anti-stochastic properties of unlabeled graphs. CoRR abs/2112.04395 (2021) - 2020
- [j16]Andriaherimanana Sarobidy Razafimahatratra
Zero-one laws for k-variable first-order logic of sparse random graphs. Discret. Appl. Math. 276: 121-128 (2020) - [j15]Alena Egorova, Maksim Zhukovskii:
Existential monadic second order convergence law fails on sparse random graphs. Eur. J. Comb. 83 (2020) - [j14]Maksim E. Zhukovskii:
Logical laws for short existential monadic second-order sentences about graphs. J. Math. Log. 20(2): 2050007:1-2050007:23 (2020)
2010 – 2019
- 2019
- [j13]S. N. Popova, Maksim E. Zhukovskii:
Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false. Ann. Pure Appl. Log. 170(4): 505-514 (2019) - [j12]Oleg Verbitsky, Maksim Zhukovskii:
On the First-Order Complexity of Induced Subgraph Isomorphism. Log. Methods Comput. Sci. 15(1) (2019) - [j11]Oleg Verbitsky
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. Theory Comput. Syst. 63(4): 902-921 (2019) - [j10]Oleg Verbitsky, Maksim Zhukovskii:
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. ACM Trans. Comput. Log. 20(2): 9:1-9:18 (2019) - 2018
- [j9]A. D. Matushkin
First order sentences about random graphs: Small number of alternations. Discret. Appl. Math. 236: 329-346 (2018) - [j8]Andrey Kupavskii, Maksim Zhukovskii:
Short Monadic Second Order Sentences about Sparse Random Graphs. SIAM J. Discret. Math. 32(4): 2916-2940 (2018) - [i5]Oleg Verbitsky, Maksim Zhukovskii:
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. CoRR abs/1802.02143 (2018) - 2017
- [j7]L. B. Ostrovsky, Maksim E. Zhukovskii:
Monadic second-order properties of very sparse random graphs. Ann. Pure Appl. Log. 168(11): 2087-2101 (2017) - [j6]Maksim E. Zhukovskii:
On the zero-one k-law extensions. Eur. J. Comb. 60: 66-81 (2017) - [j5]Maksim E. Zhukovskii:
Quantifier Alternation in First-Order Formulas with Infinite Spectra. Probl. Inf. Transm. 53(4): 391-403 (2017) - [c4]Oleg Verbitsky, Maksim Zhukovskii:
On the First-Order Complexity of Induced Subgraph Isomorphism. CSL 2017: 40:1-40:16 - [c3]Oleg Verbitsky, Maksim Zhukovskii:
The Descriptive Complexity of Subgraph Isomorphism Without Numerics. CSR 2017: 308-322 - [i4]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 abs/1701.02595 (2017) - [i3]Oleg Verbitsky, Maksim Zhukovskii:
On the First-Order Complexity of Induced Subgraph Isomorphism. CoRR abs/1704.02237 (2017) - 2016
- [j4]Joel H. Spencer, Maksim E. Zhukovskii:
Bounded quantifier depth spectra for random graphs. Discret. Math. 339(6): 1651-1664 (2016) - [c2]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: 4907-4915 - [i2]Oleg Verbitsky, Maksim Zhukovskii:
The Descriptive Complexity of Subgraph Isomorphism in the Absence of Order. CoRR abs/1607.08067 (2016) - [i1]Andrey Kupavskii, Maksim Zhukovskii:
Short monadic second order sentences about sparse random graphs. CoRR abs/1611.07260 (2016) - 2013
- [j3]Maksim E. Zhukovskii:
Extension of the Zero-one k-law. Electron. Notes Discret. Math. 43: 263-269 (2013) - [c1]Maksim Zhukovskii, Gleb Gusev, Pavel Serdyukov:
URL Redirection Accounting for Improving Link-Based Ranking Methods. ECIR 2013: 656-667 - 2012
- [j2]Maksim Zhukovskii:
Zero-one k-law. Discret. Math. 312(10): 1670-1688 (2012) - 2011
- [j1]Maksim E. Zhukovskii:
On a sequence of random distance graphs subject to the zero-one law. Probl. Inf. Transm. 47(3): 251 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 21:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: