default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDanielle Cox
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Todd Mullen, Richard J. Nowakowski, Danielle Cox:
Diffusion: quiescence and perturbation. Australas. J Comb. 90: 1-14 (2024)- 2023
- [j13]Iain Beaton, Danielle Cox, Christopher Duffy
, Nicole Zolkavich:
Chromatic Polynomials of 2-Edge-Coloured Graphs. Electron. J. Comb. 30(4) (2023) - [j12]Kyle MacKeigan, Danielle Cox, Emily Wright:
Existence of optimally-greatest digraphs for strongly connected node reliability. Networks 82(2): 111-128 (2023) - 2021
- [j11]Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol:
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - [i4]Danielle Cox, Erin Meger, Margaret-Ellen Messinger:
Eternal k-domination on graphs. CoRR abs/2104.03835 (2021) - 2020
- [j10]Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger:
Limited visibility Cops and Robber. Discret. Appl. Math. 282: 53-64 (2020) - [j9]Iain Beaton, Jason I. Brown, Danielle Cox:
Optimal Domination Polynomials. Graphs Comb. 36(5): 1477-1487 (2020)
2010 – 2019
- 2019
- [j8]Danielle Cox, Asiyeh Sanaei:
The damage number of a graph. Australas. J Comb. 75: 1-16 (2019) - [j7]Danielle Cox, Christopher Duffy:
Chromatic Polynomials of Oriented Graphs. Electron. J. Comb. 26(3): 3 (2019) - [j6]Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. Theor. Comput. Sci. 794: 59-68 (2019) - 2018
- [j5]Jason I. Brown, Danielle Cox:
Optimal Graphs for Independence and k-Independence Polynomials. Graphs Comb. 34(6): 1445-1457 (2018) - [i3]Danielle Cox, Christopher Duffy:
Chromatic Polynomials of Oriented Graphs. CoRR abs/1810.05590 (2018) - 2017
- [i2]Nancy E. Clarke, Danielle Cox, Christopher Duffy, Danny Dyer, Shannon L. Fitzpatrick, Margaret-Ellen Messinger:
Limited Visibility Cops and Robbers. CoRR abs/1708.07179 (2017) - [i1]Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. CoRR abs/1710.10112 (2017) - 2016
- [j4]Jason I. Brown, Danielle Cox:
Inflection points of reliability polynomials are dense in [0, 1]. Networks 67(4): 266-269 (2016) - 2014
- [j3]Jason I. Brown, Danielle Cox, Richard Ehrenborg:
The average reliability of a graph. Discret. Appl. Math. 177: 19-33 (2014) - [j2]Jason I. Brown, Danielle Cox:
Nonexistence of optimal graphs for all terminal reliability. Networks 63(2): 146-153 (2014)
2000 – 2009
- 2009
- [j1]Jason I. Brown, Danielle Cox:
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane. Discret. Math. 309(16): 5043-5047 (2009)
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-09-30 01: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:
