Volgen
Danny Dyer
Danny Dyer
Geverifieerd e-mailadres voor mun.ca
Titel
Geciteerd door
Geciteerd door
Jaar
Sweeping graphs with large clique number
B Yang, D Dyer, B Alspach
Discrete Mathematics 309 (18), 5770-5780, 2009
562009
Sweeping graphs with large clique number
B Yang, D Dyer, B Alspach
International symposium on algorithms and computation, 908-920, 2004
512004
On the fast searching problem
D Dyer, B Yang, Ö Yaşar
International Conference on Algorithmic Applications in Management, 143-154, 2008
342008
The complexity of zero-visibility cops and robber
D Dereniowski, D Dyer, RM Tifenbach, B Yang
Theoretical Computer Science 607, 135-148, 2015
212015
Sweeping graphs and digraphs
D Dyer
Department of Mathematics-Simon Fraser University, 2004
202004
Zero-visibility cops and robber and the pathwidth of a graph
D Dereniowski, D Dyer, RM Tifenbach, B Yang
Journal of Combinatorial Optimization 29 (3), 541-564, 2015
192015
Lower bounds on edge searching
B Alspach, D Dyer, D Hanson, B Yang
International Symposium on Combinatorics, Algorithms, Probabilistic and …, 2007
182007
Limited visibility cops and robber
NE Clarke, D Cox, C Duffy, D Dyer, SL Fitzpatrick, ME Messinger
Discrete Applied Mathematics 282, 53-64, 2020
172020
On isomorphic factorizations of circulant graphs
B Alspach, D Dyer, DL Kreher
Journal of Combinatorial Designs 14 (5), 406-414, 2006
132006
Zero-visibility cops and robber game on a graph
D Dereniowski, D Dyer, RM Tifenbach, B Yang
Frontiers in Algorithmics and Algorithmic Aspects in Information and …, 2013
122013
Paley graphs have Hamilton decompositions
B Alspach, D Bryant, D Dyer
Discrete Mathematics 312 (1), 113-118, 2012
122012
Time constrained graph searching
B Alspach, D Dyer, D Hanson, B Yang
Theoretical Computer Science 399 (3), 158-168, 2008
122008
The coarse geometry of Hartnell’s firefighter problem on infinite graphs
D Dyer, E Martínez-Pedroza, B Thorne
Discrete Mathematics 340 (5), 935-950, 2017
102017
Arc searching digraphs without jumping
B Alspach, D Dyer, D Hanson, B Yang
International Conference on Combinatorial Optimization and Applications, 354-365, 2007
92007
Three-fast-searchable graphs
D Dereniowski, ÖY Diner, D Dyer
Discrete Applied Mathematics 161 (13-14), 1950-1958, 2013
82013
A time-constrained variation of the Watchman's Walk problem.
D Dyer, R Milley
Australas. J Comb. 53, 97-108, 2012
52012
Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges
D Dyer, S Haghshenas, N Shalaby
Graphs and Combinatorics 32 (3), 943-961, 2016
42016
On minimum cost edge searching
D Dereniowski, D Dyer
Theoretical Computer Science 495, 37-49, 2013
42013
On the graceful conjecture for triangular cacti
D Dyer, I Payne, N Shalaby, B Wicks
Australas. J. Combin 53, 151-170, 2012
42012
The watchman's walk of Steiner triple system block intersection graphs.
D Dyer, J Howell
Australas. J Comb. 68, 23-34, 2017
32017
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20