default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: A. J. Radcliffe

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > A. J. Radcliffe

download as .bib file

@article{DBLP:journals/gc/CutlerNR22,
  author       = {Jonathan Cutler and
                  J. D. Nir and
                  A. J. Radcliffe},
  title        = {Supersaturation for Subgraph Counts},
  journal      = {Graphs Comb.},
  volume       = {38},
  number       = {3},
  pages        = {65},
  year         = {2022},
  url          = {https://doi.org/10.1007/s00373-021-02454-y},
  doi          = {10.1007/S00373-021-02454-Y},
  timestamp    = {Fri, 01 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/CutlerNR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cce/RadcliffeR21,
  author       = {Andrew John Radcliffe and
                  Gintaras V. Reklaitis},
  title        = {Bayesian hierarchical modeling for online process monitoring and quality
                  control, with application to real time image data},
  journal      = {Comput. Chem. Eng.},
  volume       = {154},
  pages        = {107446},
  year         = {2021},
  url          = {https://doi.org/10.1016/j.compchemeng.2021.107446},
  doi          = {10.1016/J.COMPCHEMENG.2021.107446},
  timestamp    = {Wed, 16 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cce/RadcliffeR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/KirschR21,
  author       = {Rachel Kirsch and
                  A. J. Radcliffe},
  title        = {Many Cliques with Few Edges},
  journal      = {Electron. J. Comb.},
  volume       = {28},
  number       = {1},
  pages        = {1},
  year         = {2021},
  url          = {https://doi.org/10.37236/9550},
  doi          = {10.37236/9550},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/KirschR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KirschR20,
  author       = {Rachel Kirsch and
                  A. J. Radcliffe},
  title        = {Maximizing the density of Kt's in graphs of bounded degree and clique
                  number},
  journal      = {Discret. Math.},
  volume       = {343},
  number       = {6},
  pages        = {111803},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.disc.2019.111803},
  doi          = {10.1016/J.DISC.2019.111803},
  timestamp    = {Mon, 20 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/KirschR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/KirschR19,
  author       = {Rachel Kirsch and
                  A. J. Radcliffe},
  title        = {Many Triangles with Few Edges},
  journal      = {Electron. J. Comb.},
  volume       = {26},
  number       = {2},
  pages        = {2},
  year         = {2019},
  url          = {https://doi.org/10.37236/7343},
  doi          = {10.37236/7343},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/KirschR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CutlerR18,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Minimizing the number of independent sets in triangle-free regular
                  graphs},
  journal      = {Discret. Math.},
  volume       = {341},
  number       = {3},
  pages        = {793--800},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.disc.2017.11.016},
  doi          = {10.1016/J.DISC.2017.11.016},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CutlerR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/KeoughR18,
  author       = {Lauren Keough and
                  A. J. Radcliffe},
  title        = {Extremal Threshold Graphs for Matchings and Independent Sets},
  journal      = {Graphs Comb.},
  volume       = {34},
  number       = {6},
  pages        = {1519--1537},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00373-018-1941-5},
  doi          = {10.1007/S00373-018-1941-5},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/KeoughR18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CutlerR17,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {The Maximum Number of Complete Subgraphs of Fixed Size in a Graph
                  with Given Maximum Degree},
  journal      = {J. Graph Theory},
  volume       = {84},
  number       = {2},
  pages        = {134--145},
  year         = {2017},
  url          = {https://doi.org/10.1002/jgt.22016},
  doi          = {10.1002/JGT.22016},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CutlerR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorica/KeoughR16,
  author       = {Lauren Keough and
                  Andrew John Radcliffe},
  title        = {Graphs with the fewest matchings},
  journal      = {Comb.},
  volume       = {36},
  number       = {6},
  pages        = {703--723},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00493-014-3188-y},
  doi          = {10.1007/S00493-014-3188-Y},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/KeoughR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CutlerR16,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Counting dominating sets and related structures in graphs},
  journal      = {Discret. Math.},
  volume       = {339},
  number       = {5},
  pages        = {1593--1599},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.disc.2015.12.011},
  doi          = {10.1016/J.DISC.2015.12.011},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CutlerR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CarraherGHRS16,
  author       = {James M. Carraher and
                  David J. Galvin and
                  Stephen G. Hartke and
                  A. J. Radcliffe and
                  Derrick Stolee},
  title        = {On the independence ratio of distance graphs},
  journal      = {Discret. Math.},
  volume       = {339},
  number       = {12},
  pages        = {3058--3072},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.disc.2016.05.018},
  doi          = {10.1016/J.DISC.2016.05.018},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CarraherGHRS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tamm/KramerCR16,
  author       = {Joshua Brown Kramer and
                  Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {The Multistep Friendship Paradox},
  journal      = {Am. Math. Mon.},
  volume       = {123},
  number       = {9},
  pages        = {900--908},
  year         = {2016},
  url          = {https://www.tandfonline.com/doi/abs/10.4169/amer.math.monthly.123.9.900},
  doi          = {10.4169/AMER.MATH.MONTHLY.123.9.900},
  timestamp    = {Thu, 09 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tamm/KramerCR16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/CutlerR14,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {The maximum number of complete subgraphs in a graph with given maximum
                  degree},
  journal      = {J. Comb. Theory {B}},
  volume       = {104},
  pages        = {60--71},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jctb.2013.10.003},
  doi          = {10.1016/J.JCTB.2013.10.003},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/CutlerR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CutlerR14,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Extremal Graphs for Homomorphisms {II}},
  journal      = {J. Graph Theory},
  volume       = {76},
  number       = {1},
  pages        = {42--59},
  year         = {2014},
  url          = {https://doi.org/10.1002/jgt.21749},
  doi          = {10.1002/JGT.21749},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CutlerR14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/CutlerR13,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Hypergraph Independent Sets},
  journal      = {Comb. Probab. Comput.},
  volume       = {22},
  number       = {1},
  pages        = {9--20},
  year         = {2013},
  url          = {https://doi.org/10.1017/S0963548312000454},
  doi          = {10.1017/S0963548312000454},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/CutlerR13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/VeomettR12,
  author       = {Ellen Veomett and
                  Andrew John Radcliffe},
  title        = {Vertex Isoperimetric Inequalities for a Family of Graphs on {\(\mathbb{Z}\)}\({}^{\mbox{k}}\)},
  journal      = {Electron. J. Comb.},
  volume       = {19},
  number       = {2},
  pages        = {45},
  year         = {2012},
  url          = {https://doi.org/10.37236/2426},
  doi          = {10.37236/2426},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/VeomettR12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/CutlerR11,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {An Entropy Proof of the Kahn-Lov{\'{a}}sz Theorem},
  journal      = {Electron. J. Comb.},
  volume       = {18},
  number       = {1},
  year         = {2011},
  url          = {https://doi.org/10.37236/497},
  doi          = {10.37236/497},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/CutlerR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/CutlerR11a,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Extremal Problems for Independent Set Enumeration},
  journal      = {Electron. J. Comb.},
  volume       = {18},
  number       = {1},
  year         = {2011},
  url          = {https://doi.org/10.37236/656},
  doi          = {10.37236/656},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/CutlerR11a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/KramerCR11,
  author       = {Joshua Brown Kramer and
                  Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Negative Dependence and Srinivasan's Sampling Process},
  journal      = {Comb. Probab. Comput.},
  volume       = {20},
  number       = {3},
  pages        = {347--361},
  year         = {2011},
  url          = {https://doi.org/10.1017/S0963548311000095},
  doi          = {10.1017/S0963548311000095},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/KramerCR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgt/CutlerR11,
  author       = {Jonathan Cutler and
                  A. J. Radcliffe},
  title        = {Extremal graphs for homomorphisms},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {4},
  pages        = {261--284},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20530},
  doi          = {10.1002/JGT.20530},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CutlerR11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/AndersonCRT10,
  author       = {C. Anderson and
                  Jonathan Cutler and
                  A. J. Radcliffe and
                  Lorenzo Traldi},
  title        = {On the interlace polynomials of forests},
  journal      = {Discret. Math.},
  volume       = {310},
  number       = {1},
  pages        = {31--36},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.disc.2009.07.027},
  doi          = {10.1016/J.DISC.2009.07.027},
  timestamp    = {Thu, 09 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/AndersonCRT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/gc/RadcliffeS06,
  author       = {A. J. Radcliffe and
                  Alex D. Scott},
  title        = {Reconstructing under Group Actions},
  journal      = {Graphs Comb.},
  volume       = {22},
  number       = {3},
  pages        = {399--419},
  year         = {2006},
  url          = {https://doi.org/10.1007/s00373-006-0675-y},
  doi          = {10.1007/S00373-006-0675-Y},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/gc/RadcliffeS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/NelsonR04,
  author       = {Patricia Nelson and
                  A. J. Radcliffe},
  title        = {Semi-regular graphs of minimum independence number},
  journal      = {Discret. Math.},
  volume       = {275},
  number       = {1-3},
  pages        = {237--263},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00109-2},
  doi          = {10.1016/S0012-365X(03)00109-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/NelsonR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/PebodyRS03,
  author       = {Luke Pebody and
                  A. J. Radcliffe and
                  Alex D. Scott},
  title        = {Finite Subsets of the Plane are 18-Reconstructible},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {16},
  number       = {2},
  pages        = {262--275},
  year         = {2003},
  url          = {https://doi.org/10.1137/S0895480101391648},
  doi          = {10.1137/S0895480101391648},
  timestamp    = {Fri, 23 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/PebodyRS03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/combinatorics/RadcliffeS99,
  author       = {A. J. Radcliffe and
                  Alex D. Scott},
  title        = {Reconstructing Subsets of Reals},
  journal      = {Electron. J. Comb.},
  volume       = {6},
  year         = {1999},
  url          = {https://doi.org/10.37236/1452},
  doi          = {10.37236/1452},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/RadcliffeS99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/RadcliffeS98,
  author       = {A. J. Radcliffe and
                  Alex D. Scott},
  title        = {Reconstructing Subsets of Z\({}_{\mbox{n}}\)},
  journal      = {J. Comb. Theory {A}},
  volume       = {83},
  number       = {2},
  pages        = {169--187},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2870},
  doi          = {10.1006/JCTA.1998.2870},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/RadcliffeS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BermanRSWW97,
  author       = {David M. Berman and
                  A. J. Radcliffe and
                  Alex D. Scott and
                  Hong Wang and
                  Larry Wargo},
  title        = {All trees contain a large induced subgraph having all degrees 1 (mod
                  k)},
  journal      = {Discret. Math.},
  volume       = {175},
  number       = {1-3},
  pages        = {35--40},
  year         = {1997},
  url          = {https://doi.org/10.1016/S0012-365X(96)00283-X},
  doi          = {10.1016/S0012-365X(96)00283-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BermanRSWW97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/RadcliffeS96,
  author       = {A. J. Radcliffe and
                  Zsuzsanna Szaniszl{\'{o}}},
  title        = {Extremal Cases of the Ahlswede-Cai Inequality},
  journal      = {J. Comb. Theory {A}},
  volume       = {76},
  number       = {1},
  pages        = {108--120},
  year         = {1996},
  url          = {https://doi.org/10.1006/jcta.1996.0091},
  doi          = {10.1006/JCTA.1996.0091},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/RadcliffeS96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cpc/FriezeRS95,
  author       = {Alan M. Frieze and
                  A. J. Radcliffe and
                  Stephen Suen},
  title        = {Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {4},
  pages        = {47--66},
  year         = {1995},
  url          = {https://doi.org/10.1017/S0963548300001474},
  doi          = {10.1017/S0963548300001474},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/FriezeRS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/RadcliffeS95,
  author       = {A. J. Radcliffe and
                  Alex D. Scott},
  title        = {Every tree contains a large induced subgraph with all degrees odd},
  journal      = {Discret. Math.},
  volume       = {140},
  number       = {1-3},
  pages        = {275--279},
  year         = {1995},
  url          = {https://doi.org/10.1016/0012-365X(93)E0186-8},
  doi          = {10.1016/0012-365X(93)E0186-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/RadcliffeS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/BollobasR95,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  A. J. Radcliffe},
  title        = {Defect Sauer Results},
  journal      = {J. Comb. Theory {A}},
  volume       = {72},
  number       = {2},
  pages        = {189--208},
  year         = {1995},
  timestamp    = {Fri, 07 Jun 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/BollobasR95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamdm/LeaderR94,
  author       = {Imre Leader and
                  A. J. Radcliffe},
  title        = {Littlewood-Offord Inequalities for Random Variables},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {7},
  number       = {1},
  pages        = {90--101},
  year         = {1994},
  url          = {https://doi.org/10.1137/S0895480191221866},
  doi          = {10.1137/S0895480191221866},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/LeaderR94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/FriezeRS93,
  author       = {Alan M. Frieze and
                  A. J. Radcliffe and
                  Stephen Suen},
  editor       = {Vijaya Ramachandran},
  title        = {Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs},
  booktitle    = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
                  Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
  pages        = {341--351},
  publisher    = {{ACM/SIAM}},
  year         = {1993},
  url          = {http://dl.acm.org/citation.cfm?id=313559.313800},
  timestamp    = {Thu, 05 Jul 2018 07:29:11 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/FriezeRS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/BollobasR90,
  author       = {B{\'{e}}la Bollob{\'{a}}s and
                  A. J. Radcliffe},
  title        = {Isoperimetric Inequalities for Faces of the Cube and the Grid},
  journal      = {Eur. J. Comb.},
  volume       = {11},
  number       = {4},
  pages        = {323--333},
  year         = {1990},
  url          = {https://doi.org/10.1016/S0195-6698(13)80134-5},
  doi          = {10.1016/S0195-6698(13)80134-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/BollobasR90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.