default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew J. Uzzell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j14]Victor Falgas-Ravry
, Robert Hancock, Johanna Strömberg, Andrew J. Uzzell:
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. J. Graph Theory 104(1): 104-132 (2023)- 2020
- [j13]Ryan R. Martin, Abhishek Methuku, Andrew J. Uzzell, Shanise Walker:
A Simple Proof for a Forbidden Subposet Problem. Electron. J. Comb. 27(1): 1 (2020) - [j12]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) - [j11]Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang:
On difference graphs and the local dimension of posets. Eur. J. Comb. 86: 103074 (2020) - [j10]Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell:
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. J. Graph Theory 94(2): 252-266 (2020) - 2019
- [j9]Andrew J. Uzzell:
An Improved Upper Bound for Bootstrap Percolation in All Dimensions. Comb. Probab. Comput. 28(6): 936-960 (2019) - [j8]Victor Falgas-Ravry, Kelly O'Connell, Andrew J. Uzzell:
Multicolor containers, extremal entropy, and counting. Random Struct. Algorithms 54(4): 676-720 (2019) - 2017
- [j7]Svante Janson, Andrew J. Uzzell:
On String Graph Limits and the Structure of a Typical String Graph. J. Graph Theory 84(4): 386-407 (2017) - 2015
- [j6]Mykhaylo Tyomkyn, Andrew J. Uzzell:
Strong Turán Stability. Electron. J. Comb. 22(3): 3 (2015) - [j5]Béla Bollobás, Paul Smith, Andrew J. Uzzell:
Monotone Cellular Automata in a Random Environment. Comb. Probab. Comput. 24(4): 687-722 (2015) - [j4]Mykhaylo Tyomkyn, Andrew J. Uzzell:
Strong Turán stability. Electron. Notes Discret. Math. 49: 433-440 (2015) - [j3]Béla Bollobás, Paul Smith, Andrew J. Uzzell:
The time of bootstrap percolation with dense initial sets for all thresholds. Random Struct. Algorithms 47(1): 1-29 (2015) - 2014
- [j2]Svante Janson, Andrew J. Uzzell:
On the Typical Structure of Graphs in a Monotone Property. Electron. J. Comb. 21(3): 3 (2014) - 2013
- [j1]Mykhaylo Tyomkyn, Andrew J. Uzzell:
A Turán-Type Problem on Distances in Graphs. Graphs Comb. 29(6): 1927-1942 (2013)
Informal and Other Publications
- 2018
- [i1]Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang:
On difference graphs and the local dimension of posets. CoRR abs/1803.08641 (2018)
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 2025-01-21 00:18 CET 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:
