Anton Bernshteyn

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 24

Top Topics

Maximum Common Subgraph

Connected Subgraphs

Top Venues

J. Graph Theory

Publications

Anton Bernshteyn, Abhishek Dhawan
A linear-time algorithm for (1+ε)Δ-edge-coloring. CoRR (2024)
Anton Bernshteyn, Felix Weilacher
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index. CoRR (2023)
Anton Bernshteyn, Abhishek Dhawan
Borel Vizing's Theorem for Graphs of Subexponential Growth. CoRR (2023)
Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang
Counting colorings of triangle-free graphs. J. Comb. Theory, Ser. B 161 (2023)
Anton Bernshteyn, Abhishek Dhawan
Fast algorithms for Vizing's theorem on bounded degree graphs. CoRR (2023)
Anton Bernshteyn, Eugene Lee
Weak degeneracy of graphs. J. Graph Theory 103 (4) (2023)
James Anderson, Anton Bernshteyn, Abhishek Dhawan
Colouring graphs with forbidden bipartite subgraphs. Comb. Probab. Comput. 32 (1) (2023)
Anton Bernshteyn, Eugene Lee
Searching for an Intruder on Graphs and Their Subdivisions. Electron. J. Comb. 29 (3) (2022)
Anton Bernshteyn
Descriptive combinatorics and distributed algorithms. CoRR (2022)
Anton Bernshteyn
A fast distributed algorithm for (Δ + 1)-edge-coloring. J. Comb. Theory, Ser. B 152 (2022)
Anton Bernshteyn
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms. CoRR (2021)
Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang
Counting colorings of triangle-free graphs. CoRR (2021)
James Anderson, Anton Bernshteyn, Abhishek Dhawan
Coloring graphs with forbidden bipartite subgraphs. CoRR (2021)
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
Fractional DP-colorings of sparse graphs. J. Graph Theory 93 (2) (2020)
Anton Bernshteyn
A Fast Distributed Algorithm for (Δ+1)-Edge-Coloring. CoRR (2020)
Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell
Regular colorings in regular graphs. Discuss. Math. Graph Theory 40 (3) (2020)
Anton Bernshteyn
The Johansson-Molloy theorem for DP-coloring. Random Struct. Algorithms 54 (4) (2019)
Anton Bernshteyn, Alexandr V. Kostochka
DP-colorings of hypergraphs. Eur. J. Comb. 78 (2019)
Anton Bernshteyn, Alexandr V. Kostochka
Sharp Dirac's theorem for DP-critical graphs. J. Graph Theory 88 (3) (2018)
Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu
DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65 (2017)
Anton Bernshteyn
The Local Cut Lemma. Eur. J. Comb. 63 (2017)
Anton Bernshteyn
The asymptotic behavior of the correspondence chromatic number. Discret. Math. 339 (11) (2016)
Anton Bernshteyn, Alexandr V. Kostochka
On the number of edges in a graph with no (k+1)-connected subgraphs. Discret. Math. 339 (2) (2016)
Anton Bernshteyn
New bounds for the acyclic chromatic index. Discret. Math. 339 (10) (2016)