default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnton Bernshteyn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i10]Anton Bernshteyn, Abhishek Dhawan:
A linear-time algorithm for (1+ε)Δ-edge-coloring. CoRR abs/2407.04887 (2024)- [i9]József Balogh, Anton Bernshteyn, Michelle Delcourt, Asaf Ferber, Huy Tuan Pham:
Sunflowers in set systems with small VC-dimension. CoRR abs/2408.04165 (2024) - 2023
- [j15]James Anderson, Anton Bernshteyn
, Abhishek Dhawan:
Colouring graphs with forbidden bipartite subgraphs. Comb. Probab. Comput. 32(1): 45-67 (2023) - [j14]Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang:
Counting colorings of triangle-free graphs. J. Comb. Theory B 161: 86-108 (2023) - [j13]Anton Bernshteyn, Eugene Lee:
Weak degeneracy of graphs. J. Graph Theory 103(4): 607-634 (2023) - [i8]Anton Bernshteyn, Abhishek Dhawan:
Fast algorithms for Vizing's theorem on bounded degree graphs. CoRR abs/2303.05408 (2023) - [i7]Anton Bernshteyn, Abhishek Dhawan:
Borel Vizing's Theorem for Graphs of Subexponential Growth. CoRR abs/2307.00095 (2023) - [i6]Anton Bernshteyn, Felix Weilacher:
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index. CoRR abs/2308.14941 (2023) - 2022
- [j12]Anton Bernshteyn, Eugene Lee:
Searching for an Intruder on Graphs and Their Subdivisions. Electron. J. Comb. 29(3) (2022) - [j11]Anton Bernshteyn:
A fast distributed algorithm for (Δ + 1)-edge-coloring. J. Comb. Theory B 152: 319-352 (2022) - [i5]Anton Bernshteyn:
Descriptive combinatorics and distributed algorithms. CoRR abs/2208.02903 (2022) - 2021
- [i4]Anton Bernshteyn:
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms. CoRR abs/2102.08797 (2021) - [i3]James Anderson, Anton Bernshteyn, Abhishek Dhawan:
Coloring graphs with forbidden bipartite subgraphs. CoRR abs/2107.05595 (2021) - [i2]Anton Bernshteyn, Tyler Brazelton, Ruijia Cao, Akum Kang:
Counting colorings of triangle-free graphs. CoRR abs/2109.13376 (2021) - 2020
- [j10]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): 795-806 (2020) - [j9]Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
Fractional DP-colorings of sparse graphs. J. Graph Theory 93(2): 203-221 (2020) - [i1]Anton Bernshteyn:
A Fast Distributed Algorithm for (Δ+1)-Edge-Coloring. CoRR abs/2006.15703 (2020)
2010 – 2019
- 2019
- [j8]Anton Bernshteyn, Alexandr V. Kostochka:
DP-colorings of hypergraphs. Eur. J. Comb. 78: 134-146 (2019) - [j7]Anton Bernshteyn:
The Johansson-Molloy theorem for DP-coloring. Random Struct. Algorithms 54(4): 653-664 (2019) - 2018
- [j6]Anton Bernshteyn, Alexandr V. Kostochka:
Sharp Dirac's theorem for DP-critical graphs. J. Graph Theory 88(3): 521-546 (2018) - 2017
- [j5]Anton Bernshteyn:
The Local Cut Lemma. Eur. J. Comb. 63: 95-114 (2017) - [j4]Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65: 122-129 (2017) - 2016
- [j3]Anton Bernshteyn, Alexandr V. Kostochka:
On the number of edges in a graph with no (k+1)-connected subgraphs. Discret. Math. 339(2): 682-688 (2016) - [j2]Anton Bernshteyn:
New bounds for the acyclic chromatic index. Discret. Math. 339(10): 2543-2552 (2016) - [j1]Anton Bernshteyn:
The asymptotic behavior of the correspondence chromatic number. Discret. Math. 339(11): 2680-2692 (2016)
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-10-07 22:19 CEST 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:
