default search action
A. J. Radcliffe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j33]Jonathan Cutler, J. D. Nir
, A. J. Radcliffe:
Supersaturation for Subgraph Counts. Graphs Comb. 38(3): 65 (2022) - 2021
- [j32]Andrew John Radcliffe, Gintaras V. Reklaitis:
Bayesian hierarchical modeling for online process monitoring and quality control, with application to real time image data. Comput. Chem. Eng. 154: 107446 (2021) - [j31]Rachel Kirsch, A. J. Radcliffe:
Many Cliques with Few Edges. Electron. J. Comb. 28(1): 1 (2021) - 2020
- [j30]Rachel Kirsch, A. J. Radcliffe:
Maximizing the density of Kt's in graphs of bounded degree and clique number. Discret. Math. 343(6): 111803 (2020)
2010 – 2019
- 2019
- [j29]Rachel Kirsch, A. J. Radcliffe:
Many Triangles with Few Edges. Electron. J. Comb. 26(2): 2 (2019) - 2018
- [j28]Jonathan Cutler, A. J. Radcliffe:
Minimizing the number of independent sets in triangle-free regular graphs. Discret. Math. 341(3): 793-800 (2018) - [j27]Lauren Keough, A. J. Radcliffe:
Extremal Threshold Graphs for Matchings and Independent Sets. Graphs Comb. 34(6): 1519-1537 (2018) - 2017
- [j26]Jonathan Cutler, A. J. Radcliffe:
The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree. J. Graph Theory 84(2): 134-145 (2017) - 2016
- [j25]Lauren Keough, Andrew John Radcliffe:
Graphs with the fewest matchings. Comb. 36(6): 703-723 (2016) - [j24]Jonathan Cutler, A. J. Radcliffe:
Counting dominating sets and related structures in graphs. Discret. Math. 339(5): 1593-1599 (2016) - [j23]James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee
On the independence ratio of distance graphs. Discret. Math. 339(12): 3058-3072 (2016) - [j22]Joshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe:
The Multistep Friendship Paradox. Am. Math. Mon. 123(9): 900-908 (2016) - 2014
- [j21]Jonathan Cutler, A. J. Radcliffe:
The maximum number of complete subgraphs in a graph with given maximum degree. J. Comb. Theory B 104: 60-71 (2014) - [j20]Jonathan Cutler, A. J. Radcliffe:
Extremal Graphs for Homomorphisms II. J. Graph Theory 76(1): 42-59 (2014) - 2013
- [j19]Jonathan Cutler, A. J. Radcliffe:
Hypergraph Independent Sets. Comb. Probab. Comput. 22(1): 9-20 (2013) - 2012
- [j18]Ellen Veomett, Andrew John Radcliffe:
Vertex Isoperimetric Inequalities for a Family of Graphs on ℤk. Electron. J. Comb. 19(2): 45 (2012) - 2011
- [j17]Jonathan Cutler, A. J. Radcliffe:
An Entropy Proof of the Kahn-Lovász Theorem. Electron. J. Comb. 18(1) (2011) - [j16]Jonathan Cutler, A. J. Radcliffe:
Extremal Problems for Independent Set Enumeration. Electron. J. Comb. 18(1) (2011) - [j15]Joshua Brown Kramer, Jonathan Cutler, A. J. Radcliffe:
Negative Dependence and Srinivasan's Sampling Process. Comb. Probab. Comput. 20(3): 347-361 (2011) - [j14]Jonathan Cutler, A. J. Radcliffe:
Extremal graphs for homomorphisms. J. Graph Theory 67(4): 261-284 (2011) - 2010
- [j13]C. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi:
On the interlace polynomials of forests. Discret. Math. 310(1): 31-36 (2010)
2000 – 2009
- 2006
- [j12]A. J. Radcliffe, Alex D. Scott:
Reconstructing under Group Actions. Graphs Comb. 22(3): 399-419 (2006) - 2004
- [j11]Patricia Nelson, A. J. Radcliffe:
Semi-regular graphs of minimum independence number. Discret. Math. 275(1-3): 237-263 (2004) - 2003
- [j10]Luke Pebody, A. J. Radcliffe, Alex D. Scott:
Finite Subsets of the Plane are 18-Reconstructible. SIAM J. Discret. Math. 16(2): 262-275 (2003)
1990 – 1999
- 1999
- [j9]A. J. Radcliffe, Alex D. Scott:
Reconstructing Subsets of Reals. Electron. J. Comb. 6 (1999) - 1998
- [j8]A. J. Radcliffe, Alex D. Scott:
Reconstructing Subsets of Zn. J. Comb. Theory A 83(2): 169-187 (1998) - 1997
- [j7]David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo:
All trees contain a large induced subgraph having all degrees 1 (mod k). Discret. Math. 175(1-3): 35-40 (1997) - 1996
- [j6]A. J. Radcliffe, Zsuzsanna Szaniszló:
Extremal Cases of the Ahlswede-Cai Inequality. J. Comb. Theory A 76(1): 108-120 (1996) - 1995
- [j5]Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. Comb. Probab. Comput. 4: 47-66 (1995) - [j4]A. J. Radcliffe, Alex D. Scott:
Every tree contains a large induced subgraph with all degrees odd. Discret. Math. 140(1-3): 275-279 (1995) - [j3]Béla Bollobás, A. J. Radcliffe:
Defect Sauer Results. J. Comb. Theory A 72(2): 189-208 (1995) - 1994
- [j2]Imre Leader, A. J. Radcliffe:
Littlewood-Offord Inequalities for Random Variables. SIAM J. Discret. Math. 7(1): 90-101 (1994) - 1993
- [c1]Alan M. Frieze, A. J. Radcliffe, Stephen Suen:
Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs. SODA 1993: 341-351 - 1990
- [j1]Béla Bollobás, A. J. Radcliffe:
Isoperimetric Inequalities for Faces of the Cube and the Grid. Eur. J. Comb. 11(4): 323-333 (1990)
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-06-10 20:30 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: