Arc Searching Digraphs Without Jumping. - Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang (COCOA, 2007)

Lower Bounds on Edge Searching. - Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang (ESCAPE, 2007)

On the Fast Searching Problem. - Danny Dyer; Boting Yang; Öznur Yasar (AAIM, 2008)

Time constrained graph searching. - Brian Alspach; Danny Dyer; Denis Hanson; Boting Yang (Theor. Comput. Sci., 2008)

Edge searching weighted graphs. - Öznur Yasar; Danny Dyer; David A. Pike; Margo Kondratieva (Discret. Appl. Math., 2009)

Sweeping graphs with large clique number. - Boting Yang; Danny Dyer; Brian Alspach (Discret. Math., 2009)

Searching Circulant Graphs. - Öznur Yasar Diner; Danny Dyer (CTW, 2011)

A time-constrained variation of the Watchman's Walk problem. - Danny Dyer; Rebecca Milley (Australas. J Comb., 2012)

On the graceful labelling of triangular cacti conjecture. - Danny Dyer; Ian Payne; Nabil Shalaby; Brenda Wicks (Australas. J Comb., 2012)

Small 2-coloured path decompositions. - Brian Alspach; Danny Dyer; Kathy Heinrich (Ars Comb., 2012)

Paley graphs have Hamilton decompositions. - Brian Alspach; Darryn E. Bryant; Danny Dyer (Discret. Math., 2012)

Zero-Visibility Cops and Robber Game on a Graph. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (FAW-AAIM, 2013)

Three-fast-searchable graphs. - Dariusz Dereniowski; Öznur Yasar Diner; Danny Dyer (Discret. Appl. Math., 2013)

On minimum cost edge searching. - Dariusz Dereniowski; Danny Dyer (Theor. Comput. Sci., 2013)

Zero-visibility cops and robber and the pathwidth of a graph. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (J. Comb. Optim., 2015)

The complexity of zero-visibility cops and robber. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (Theor. Comput. Sci., 2015)

Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges. - Danny Dyer; Sadegheh Haghshenas; Nabil Shalaby (Graphs Comb., 2016)

The watchman's walk of Steiner triple system block intersection graphs. - Danny Dyer; Jared Howell (Australas. J Comb., 2017)

Limited Visibility Cops and Robbers. - Nancy E. Clarke; Danielle Cox; Christopher Duffy 001; Danny Dyer; Shannon L. Fitzpatrick; Margaret-Ellen Messinger (CoRR, 2017)

The coarse geometry of Hartnell's firefighter problem on infinite graphs. - Danny Dyer; Eduardo Martínez-Pedroza; Brandon Thorne (Discret. Math., 2017)

The spectrum of optimal excess graphs for trees with up to four edges. - Danny Dyer; Sadegheh Haghshenas; Nabil Shalaby (AKCE Int. J. Graphs Comb., 2019)

Limited visibility Cops and Robber. - Nancy E. Clarke; Danielle Cox; Christopher Duffy 001; Danny Dyer; Shannon L. Fitzpatrick; Margaret-Ellen Messinger (Discret. Appl. Math., 2020)

Four-searchable biconnected outerplanar graphs. - Öznur Yasar Diner; Danny Dyer; Boting Yang (Discret. Appl. Math., 2022)

Bounds on watching and watching graph products. - Danny Dyer; Jared Howell (Discuss. Math. Graph Theory, 2022)

Graceful Labellings of Variable Windmills Using Skolem-type Sequences. - Ahmad H. Alkasasbeh; Danny Dyer; Jared Howell (Ars Comb., 2024)

Cops against a cheating robber. - Nancy E. Clarke; Danny Dyer; William Kellough (CoRR, 2024)

Deduction, Constrained Zero Forcing, and Constrained Searching. - Andrea Burgess; Danny Dyer; Kerry Ojakian; Lusheng Wang 001; Mingyu Xiao 001; Boting Yang (CoRR, 2024)

An introduction to the deduction number. - Andrea Burgess; Danny Dyer; Mozhgan Farahani (Discret. Appl. Math., 2025)

Cuts, cats, and complete graphs. - Rylo Ashmore; Danny Dyer; Trent Marbach; Rebecca Milley (Theor. Comput. Sci., 2025)

Applying Skolem sequences to gracefully label new families of triangular windmills. - Ahmad H. Alkasasbeh; Danny Dyer; Nabil Shalaby (Australas. J Comb., 2025)