New bounds for the acyclic chromatic index. - Anton Bernshteyn (Discret. Math., 2016)

The asymptotic behavior of the correspondence chromatic number. - Anton Bernshteyn (Discret. Math., 2016)

On the number of edges in a graph with no (k+1)-connected subgraphs. - Anton Bernshteyn; Alexandr V. Kostochka (Discret. Math., 2016)

The Local Cut Lemma. - Anton Bernshteyn (Eur. J. Comb., 2017)

DP-colorings of graphs with high chromatic number. - Anton Bernshteyn; Alexandr V. Kostochka; Xuding Zhu (Eur. J. Comb., 2017)

Sharp Dirac's theorem for DP-critical graphs. - Anton Bernshteyn; Alexandr V. Kostochka (J. Graph Theory, 2018)

DP-colorings of hypergraphs. - Anton Bernshteyn; Alexandr V. Kostochka (Eur. J. Comb., 2019)

The Johansson-Molloy theorem for DP-coloring. - Anton Bernshteyn (Random Struct. Algorithms, 2019)

A Fast Distributed Algorithm for (Δ+1)-Edge-Coloring. - Anton Bernshteyn (CoRR, 2020)

Regular colorings in regular graphs. - Anton Bernshteyn; Omid Khormali; Ryan R. Martin; Jonathan Rollin; Danny Rorabaugh; Songling Shan; Andrew J. Uzzell (Discuss. Math. Graph Theory, 2020)

Fractional DP-colorings of sparse graphs. - Anton Bernshteyn; Alexandr V. Kostochka; Xuding Zhu (J. Graph Theory, 2020)

Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms. - Anton Bernshteyn (CoRR, 2021)

Coloring graphs with forbidden bipartite subgraphs. - James Anderson; Anton Bernshteyn; Abhishek Dhawan (CoRR, 2021)

Searching for an Intruder on Graphs and Their Subdivisions. - Anton Bernshteyn; Eugene Lee (Electron. J. Comb., 2022)

Descriptive combinatorics and distributed algorithms. - Anton Bernshteyn (CoRR, 2022)

A fast distributed algorithm for (Δ + 1)-edge-coloring. - Anton Bernshteyn (J. Comb. Theory B, 2022)

Borel Vizing's Theorem for Graphs of Subexponential Growth. - Anton Bernshteyn; Abhishek Dhawan (CoRR, 2023)

Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index. - Anton Bernshteyn; Felix Weilacher (CoRR, 2023)

Colouring graphs with forbidden bipartite subgraphs. - James Anderson; Anton Bernshteyn; Abhishek Dhawan (Comb. Probab. Comput., 2023)

Counting colorings of triangle-free graphs. - Anton Bernshteyn; Tyler Brazelton; Ruijia Cao; Akum Kang (J. Comb. Theory B, 2023)

Weak degeneracy of graphs. - Anton Bernshteyn; Eugene Lee (J. Graph Theory, 2023)

A linear-time algorithm for (1+ε)Δ-edge-coloring. - Anton Bernshteyn; Abhishek Dhawan (CoRR, 2024)

Sunflowers in set systems with small VC-dimension. - József Balogh; Anton Bernshteyn; Michelle Delcourt; Asaf Ferber; Huy Tuan Pham (CoRR, 2024)

Fast algorithms for Vizing's theorem on bounded degree graphs. - Anton Bernshteyn; Abhishek Dhawan (J. Comb. Theory B, 2025)

Coloring Graphs With Forbidden Almost Bipartite Subgraphs. - James Anderson; Anton Bernshteyn; Abhishek Dhawan (Random Struct. Algorithms, 2025)

Separating complexity classes of LCL problems on grids. - Katalin Berlow; Anton Bernshteyn; Clark Lyons; Felix Weilacher (CoRR, 2025)

DP-Coloring of Graphs From Random Covers. - Anton Bernshteyn; Daniel Dominik; Hemanshu Kaul; Jeffrey A. Mudrock (Random Struct. Algorithms, 2025)