Anton Bernshteyn

30 papers Journal 30
YearRankTypeTitle / Venue / Authors
2025 J jnl
Coloring Graphs With Forbidden Almost Bipartite Subgraphs.
Random Struct. Algorithms
James Anderson, Anton Bernshteyn, Abhishek Dhawan
2025 J jnl
DP-Coloring of Graphs From Random Covers.
Random Struct. Algorithms
Anton Bernshteyn, Daniel Dominik, Hemanshu Kaul, Jeffrey A. Mudrock
2025 J jnl
Fast algorithms for Vizing's theorem on bounded degree graphs.
J. Comb. Theory B
Anton Bernshteyn, Abhishek Dhawan
2025 J jnl
Separating complexity classes of LCL problems on grids.
CoRR
Katalin Berlow, Anton Bernshteyn, Clark Lyons, Felix Weilacher
2025 J jnl
Sunflowers in Set Systems with Small VC-Dimension.
Comb.
József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham
2024 J jnl
A linear-time algorithm for (1+ε)Δ-edge-coloring.
CoRR
Anton Bernshteyn, Abhishek Dhawan
2024 J jnl
Sunflowers in set systems with small VC-dimension.
CoRR
József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham
2023 J jnl
Borel Vizing's Theorem for Graphs of Subexponential Growth.
CoRR
Anton Bernshteyn, Abhishek Dhawan
2023 J jnl
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index.
CoRR
Anton Bernshteyn, Felix Weilacher
2023 J jnl
Colouring graphs with forbidden bipartite subgraphs.
Comb. Probab. Comput.
James Anderson, Anton Bernshteyn, Abhishek Dhawan
2023 J jnl
Counting colorings of triangle-free graphs.
J. Comb. Theory B
Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang
2023 J jnl
Fast algorithms for Vizing's theorem on bounded degree graphs.
CoRR
Anton Bernshteyn, Abhishek Dhawan
2023 J jnl
Weak degeneracy of graphs.
J. Graph Theory
Anton Bernshteyn, Eugene Lee
2022 J jnl
A fast distributed algorithm for (Δ + 1)-edge-coloring.
J. Comb. Theory B
Anton Bernshteyn
2022 J jnl
Descriptive combinatorics and distributed algorithms.
CoRR
Anton Bernshteyn
2022 J jnl
Searching for an Intruder on Graphs and Their Subdivisions.
Electron. J. Comb.
Anton Bernshteyn, Eugene Lee
2021 J jnl
Coloring graphs with forbidden bipartite subgraphs.
CoRR
James Anderson, Anton Bernshteyn, Abhishek Dhawan
2021 J jnl
Counting colorings of triangle-free graphs.
CoRR
Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang
2021 J jnl
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms.
CoRR
Anton Bernshteyn
2020 J jnl
A Fast Distributed Algorithm for (Δ+1)-Edge-Coloring.
CoRR
Anton Bernshteyn
2020 J jnl
Fractional DP-colorings of sparse graphs.
J. Graph Theory
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
2020 J jnl
Regular colorings in regular graphs.
Discuss. Math. Graph Theory
Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell
2019 J jnl
DP-colorings of hypergraphs.
Eur. J. Comb.
Anton Bernshteyn, Alexandr V. Kostochka
2019 J jnl
The Johansson-Molloy theorem for DP-coloring.
Random Struct. Algorithms
Anton Bernshteyn
2018 J jnl
Sharp Dirac's theorem for DP-critical graphs.
J. Graph Theory
Anton Bernshteyn, Alexandr V. Kostochka
2017 J jnl
DP-colorings of graphs with high chromatic number.
Eur. J. Comb.
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
2017 J jnl
The Local Cut Lemma.
Eur. J. Comb.
Anton Bernshteyn
2016 J jnl
New bounds for the acyclic chromatic index.
Discret. Math.
Anton Bernshteyn
2016 J jnl
On the number of edges in a graph with no (k+1)-connected subgraphs.
Discret. Math.
Anton Bernshteyn, Alexandr V. Kostochka
2016 J jnl
The asymptotic behavior of the correspondence chromatic number.
Discret. Math.
Anton Bernshteyn