default search action
Danny Dyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i3]Nancy E. Clarke, Danny Dyer, William Kellough:
Cops against a cheating robber. CoRR abs/2409.11581 (2024) - [i2]Andrea Burgess, Danny Dyer, Kerry Ojakian, Lusheng Wang, Mingyu Xiao, Boting Yang:
Deduction, Constrained Zero Forcing, and Constrained Searching. CoRR abs/2410.22962 (2024) - 2022
- [j18]Öznur Yasar Diner
, Danny Dyer
Four-searchable biconnected outerplanar graphs. Discret. Appl. Math. 306: 70-82 (2022) - [j17]Danny Dyer
Bounds on watching and watching graph products. Discuss. Math. Graph Theory 42(1): 63-79 (2022) - 2020
- [j16]Nancy E. Clarke, Danielle Cox, Christopher Duffy
Limited visibility Cops and Robber. Discret. Appl. Math. 282: 53-64 (2020)
2010 – 2019
- 2019
- [j15]Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby:
The spectrum of optimal excess graphs for trees with up to four edges. AKCE Int. J. Graphs Comb. 16(3): 272-279 (2019) - 2017
- [j14]Danny Dyer, Jared Howell:
The watchman's walk of Steiner triple system block intersection graphs. Australas. J Comb. 68: 23-34 (2017) - [j13]Danny Dyer, Eduardo Martínez-Pedroza
The coarse geometry of Hartnell's firefighter problem on infinite graphs. Discret. Math. 340(5): 935-950 (2017) - [i1]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) - 2016
- [j12]Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby:
Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges. Graphs Comb. 32(3): 943-961 (2016) - 2015
- [j11]Dariusz Dereniowski
Zero-visibility cops and robber and the pathwidth of a graph. J. Comb. Optim. 29(3): 541-564 (2015) - [j10]Dariusz Dereniowski
The complexity of zero-visibility cops and robber. Theor. Comput. Sci. 607: 135-148 (2015) - 2014
- [c7]Dariusz Dereniowski
The Complexity of Zero-Visibility Cops and Robber. FAW 2014: 60-70 - 2013
- [j9]Dariusz Dereniowski
Three-fast-searchable graphs. Discret. Appl. Math. 161(13-14): 1950-1958 (2013) - [j8]Dariusz Dereniowski
On minimum cost edge searching. Theor. Comput. Sci. 495: 37-49 (2013) - [c6]Dariusz Dereniowski
Zero-Visibility Cops and Robber Game on a Graph. FAW-AAIM 2013: 175-186 - 2012
- [j7]Danny Dyer, Rebecca Milley:
A time-constrained variation of the Watchman's Walk problem. Australas. J Comb. 53: 97-108 (2012) - [j6]Danny Dyer, Ian Payne, Nabil Shalaby, Brenda Wicks:
On the graceful labelling of triangular cacti conjecture. Australas. J Comb. 53: 151-170 (2012) - [j5]Brian Alspach, Danny Dyer, Kathy Heinrich:
Small 2-coloured path decompositions. Ars Comb. 103: 279-288 (2012) - [j4]Brian Alspach, Darryn E. Bryant
Paley graphs have Hamilton decompositions. Discret. Math. 312(1): 113-118 (2012) - 2011
- [c5]Öznur Yasar Diner, Danny Dyer:
Searching Circulant Graphs. CTW 2011: 275-278
2000 – 2009
- 2009
- [j3]Öznur Yasar
Edge searching weighted graphs. Discret. Appl. Math. 157(8): 1913-1923 (2009) - [j2]Boting Yang, Danny Dyer, Brian Alspach:
Sweeping graphs with large clique number. Discret. Math. 309(18): 5770-5780 (2009) - 2008
- [j1]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Time constrained graph searching. Theor. Comput. Sci. 399(3): 158-168 (2008) - [c4]Danny Dyer, Boting Yang, Öznur Yasar
On the Fast Searching Problem. AAIM 2008: 143-154 - 2007
- [c3]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Arc Searching Digraphs Without Jumping. COCOA 2007: 354-365 - [c2]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Lower Bounds on Edge Searching. ESCAPE 2007: 516-527 - 2004
- [c1]Boting Yang, Danny Dyer, Brian Alspach:
Sweeping Graphs with Large Clique Number. ISAAC 2004: 908-920
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-12-03 20:32 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: