| On DP-coloring of graphs and multigraphs AY Bernshteyn, AV Kostochka, SP Pron Siberian Mathematical Journal 58 (1), 28-36, 2017 | 74 | 2017 |
| The Johansson‐Molloy theorem for DP‐coloring A Bernshteyn Random Structures & Algorithms 54 (4), 653-664, 2019 | 70 | 2019 |
| The asymptotic behavior of the correspondence chromatic number A Bernshteyn Discrete Mathematics 339 (11), 2680-2692, 2016 | 69 | 2016 |
| On differences between DP-coloring and list coloring AY Bernshteyn, AV Kostochka Siberian Advances in Mathematics 29, 183-189, 2019 | 53 | 2019 |
| DP-colorings of graphs with high chromatic number A Bernshteyn, A Kostochka, X Zhu European Journal of Combinatorics 65, 122-129, 2017 | 40 | 2017 |
| Sharp Dirac's theorem for DP‐critical graphs A Bernshteyn, A Kostochka Journal of Graph Theory 88 (3), 521-546, 2018 | 36 | 2018 |
| Measurable versions of the Lovász Local Lemma and measurable graph colorings A Bernshteyn Advances in Mathematics 353, 153-223, 2019 | 31 | 2019 |
| Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics A Bernshteyn Inventiones mathematicae 233 (2), 495-542, 2023 | 27 | 2023 |
| The local cut lemma A Bernshteyn European Journal of Combinatorics 63, 95-114, 2017 | 27 | 2017 |
| A fast distributed algorithm for (Δ+ 1)-edge-coloring A Bernshteyn Journal of Combinatorial Theory, Series B 152, 319-352, 2022 | 20 | 2022 |
| DP-colorings of hypergraphs A Bernshteyn, A Kostochka European Journal of Combinatorics 78, 134-146, 2019 | 15 | 2019 |
| Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms A Bernshteyn Advances in Mathematics 415, 108895, 2023 | 14 | 2023 |
| Fractional DP‐colorings of sparse graphs A Bernshteyn, A Kostochka, X Zhu Journal of Graph Theory 93 (2), 203-221, 2020 | 13 | 2020 |
| Weak degeneracy of graphs A Bernshteyn, E Lee Journal of Graph Theory 103 (4), 607-634, 2023 | 12 | 2023 |
| Colouring graphs with forbidden bipartite subgraphs J Anderson, A Bernshteyn, A Dhawan Combinatorics, Probability and Computing 32 (1), 45-67, 2023 | 11 | 2023 |
| New bounds for the acyclic chromatic index A Bernshteyn Discrete Mathematics 339 (10), 2543-2552, 2016 | 10 | 2016 |
| On the number of edges in a graph with no (k+ 1)-connected subgraphs A Bernshteyn, A Kostochka Discrete Mathematics 339 (2), 682-688, 2016 | 10 | 2016 |
| Counting colorings of triangle-free graphs A Bernshteyn, T Brazelton, R Cao, A Kang Journal of Combinatorial Theory, Series B 161, 86-108, 2023 | 9 | 2023 |
| Fast algorithms for Vizing's theorem on bounded degree graphs A Bernshteyn, A Dhawan arXiv preprint arXiv:2303.05408, 2023 | 9 | 2023 |
| Building large free subshifts using the Local Lemma A Bernshteyn Groups, Geometry, and Dynamics 13 (4), 1417-1436, 2019 | 6 | 2019 |
