Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Danielle Cox
@article{DBLP:journals/combinatorics/BeatonCDZ23,
author = {Iain Beaton and
Danielle Cox and
Christopher Duffy and
Nicole Zolkavich},
title = {Chromatic Polynomials of 2-Edge-Coloured Graphs},
journal = {Electron. J. Comb.},
volume = {30},
number = {4},
year = {2023},
url = {https://doi.org/10.37236/9785},
doi = {10.37236/9785},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/BeatonCDZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/MacKeiganCW23,
author = {Kyle MacKeigan and
Danielle Cox and
Emily Wright},
title = {Existence of optimally-greatest digraphs for strongly connected node
reliability},
journal = {Networks},
volume = {82},
number = {2},
pages = {111--128},
year = {2023},
url = {https://doi.org/10.1002/net.22150},
doi = {10.1002/NET.22150},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/MacKeiganCW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownCCGM21,
author = {Jason I. Brown and
Charles J. Colbourn and
Danielle Cox and
Christina Graves and
Lucas Mol},
title = {Network reliability: Heading out on the highway},
journal = {Networks},
volume = {77},
number = {1},
pages = {146--160},
year = {2021},
url = {https://doi.org/10.1002/net.21977},
doi = {10.1002/NET.21977},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BrownCCGM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-03835,
author = {Danielle Cox and
Erin Meger and
Margaret{-}Ellen Messinger},
title = {Eternal k-domination on graphs},
journal = {CoRR},
volume = {abs/2104.03835},
year = {2021},
url = {https://arxiv.org/abs/2104.03835},
eprinttype = {arXiv},
eprint = {2104.03835},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-03835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ClarkeCDDFM20,
author = {Nancy E. Clarke and
Danielle Cox and
Christopher Duffy and
Danny Dyer and
Shannon L. Fitzpatrick and
Margaret{-}Ellen Messinger},
title = {Limited visibility Cops and Robber},
journal = {Discret. Appl. Math.},
volume = {282},
pages = {53--64},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.12.007},
doi = {10.1016/J.DAM.2019.12.007},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ClarkeCDDFM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BeatonBC20,
author = {Iain Beaton and
Jason I. Brown and
Danielle Cox},
title = {Optimal Domination Polynomials},
journal = {Graphs Comb.},
volume = {36},
number = {5},
pages = {1477--1487},
year = {2020},
url = {https://doi.org/10.1007/s00373-020-02202-8},
doi = {10.1007/S00373-020-02202-8},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BeatonBC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/CoxS19,
author = {Danielle Cox and
Asiyeh Sanaei},
title = {The damage number of a graph},
journal = {Australas. {J} Comb.},
volume = {75},
pages = {1--16},
year = {2019},
url = {http://ajc.maths.uq.edu.au/pdf/75/ajc\_v75\_p001.pdf},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/CoxS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CoxD19,
author = {Danielle Cox and
Christopher Duffy},
title = {Chromatic Polynomials of Oriented Graphs},
journal = {Electron. J. Comb.},
volume = {26},
number = {3},
pages = {3},
year = {2019},
url = {https://doi.org/10.37236/8240},
doi = {10.37236/8240},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CoxD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BonatoCCFIM19,
author = {Anthony Bonato and
Nancy E. Clarke and
Danielle Cox and
Stephen Finbow and
Fionn Mc Inerney and
Margaret{-}Ellen Messinger},
title = {Hyperopic Cops and Robbers},
journal = {Theor. Comput. Sci.},
volume = {794},
pages = {59--68},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.10.004},
doi = {10.1016/J.TCS.2018.10.004},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BonatoCCFIM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrownC18,
author = {Jason I. Brown and
Danielle Cox},
title = {Optimal Graphs for Independence and \emph{k}-Independence Polynomials},
journal = {Graphs Comb.},
volume = {34},
number = {6},
pages = {1445--1457},
year = {2018},
url = {https://doi.org/10.1007/s00373-018-1946-0},
doi = {10.1007/S00373-018-1946-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrownC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-05590,
author = {Danielle Cox and
Christopher Duffy},
title = {Chromatic Polynomials of Oriented Graphs},
journal = {CoRR},
volume = {abs/1810.05590},
year = {2018},
url = {http://arxiv.org/abs/1810.05590},
eprinttype = {arXiv},
eprint = {1810.05590},
timestamp = {Fri, 13 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-05590.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-07179,
author = {Nancy E. Clarke and
Danielle Cox and
Christopher Duffy and
Danny Dyer and
Shannon L. Fitzpatrick and
Margaret{-}Ellen Messinger},
title = {Limited Visibility Cops and Robbers},
journal = {CoRR},
volume = {abs/1708.07179},
year = {2017},
url = {http://arxiv.org/abs/1708.07179},
eprinttype = {arXiv},
eprint = {1708.07179},
timestamp = {Fri, 26 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-07179.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-10112,
author = {Anthony Bonato and
Nancy E. Clarke and
Danielle Cox and
Stephen Finbow and
Fionn Mc Inerney and
Margaret{-}Ellen Messinger},
title = {Hyperopic Cops and Robbers},
journal = {CoRR},
volume = {abs/1710.10112},
year = {2017},
url = {http://arxiv.org/abs/1710.10112},
eprinttype = {arXiv},
eprint = {1710.10112},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-10112.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownC16,
author = {Jason I. Brown and
Danielle Cox},
title = {Inflection points of reliability polynomials are dense in [0, 1]},
journal = {Networks},
volume = {67},
number = {4},
pages = {266--269},
year = {2016},
url = {https://doi.org/10.1002/net.21669},
doi = {10.1002/NET.21669},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrownCE14,
author = {Jason I. Brown and
Danielle Cox and
Richard Ehrenborg},
title = {The average reliability of a graph},
journal = {Discret. Appl. Math.},
volume = {177},
pages = {19--33},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.05.048},
doi = {10.1016/J.DAM.2014.05.048},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrownCE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownC14,
author = {Jason I. Brown and
Danielle Cox},
title = {Nonexistence of optimal graphs for all terminal reliability},
journal = {Networks},
volume = {63},
number = {2},
pages = {146--153},
year = {2014},
url = {https://doi.org/10.1002/net.21530},
doi = {10.1002/NET.21530},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownC09,
author = {Jason I. Brown and
Danielle Cox},
title = {The closure of the set of roots of strongly connected reliability
polynomials is the entire complex plane},
journal = {Discret. Math.},
volume = {309},
number = {16},
pages = {5043--5047},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2009.03.012},
doi = {10.1016/J.DISC.2009.03.012},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 18:00 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:
