| Sweeping graphs with large clique number B Yang, D Dyer, B Alspach Discrete Mathematics 309 (18), 5770-5780, 2009 | 59 | 2009 |
| Sweeping graphs with large clique number B Yang, D Dyer, B Alspach Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong …, 2005 | 50 | 2005 |
| On the fast searching problem D Dyer, B Yang, Ö Yaşar Algorithmic Aspects in Information and Management: 4th International …, 2008 | 37 | 2008 |
| The complexity of zero-visibility cops and robber D Dereniowski, D Dyer, RM Tifenbach, B Yang Theoretical Computer Science 607, 135-148, 2015 | 24 | 2015 |
| Zero-visibility cops and robber and the pathwidth of a graph D Dereniowski, D Dyer, RM Tifenbach, B Yang Journal of Combinatorial Optimization 29, 541-564, 2015 | 23 | 2015 |
| Limited visibility cops and robber NE Clarke, D Cox, C Duffy, D Dyer, SL Fitzpatrick, ME Messinger Discrete Applied Mathematics 282, 53-64, 2020 | 22 | 2020 |
| Sweeping graphs and digraphs D Dyer Simon Fraser University, 2004 | 20 | 2004 |
| Lower bounds on edge searching B Alspach, D Dyer, D Hanson, B Yang Combinatorics, Algorithms, Probabilistic and Experimental Methodologies …, 2007 | 17 | 2007 |
| 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 | 15 | 2017 |
| 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 | 13 | 2013 |
| Paley graphs have Hamilton decompositions B Alspach, D Bryant, D Dyer Discrete Mathematics 312 (1), 113-118, 2012 | 13 | 2012 |
| On isomorphic factorizations of circulant graphs B Alspach, D Dyer, DL Kreher Journal of Combinatorial Designs 14 (5), 406-414, 2006 | 13 | 2006 |
| Three-fast-searchable graphs D Dereniowski, ÖY Diner, D Dyer Discrete Applied Mathematics 161 (13-14), 1950-1958, 2013 | 11 | 2013 |
| Time constrained graph searching B Alspach, D Dyer, D Hanson, B Yang Theoretical Computer Science 399 (3), 158-168, 2008 | 11 | 2008 |
| Arc searching digraphs without jumping B Alspach, D Dyer, D Hanson, B Yang Combinatorial Optimization and Applications: First International Conference …, 2007 | 9 | 2007 |
| A time-constrained variation of the Watchman's Walk problem. D Dyer, R Milley Australas. J Comb. 53, 97-108, 2012 | 5 | 2012 |
| The watchman's walk of Steiner triple system block intersection graphs. D Dyer, J Howell Australas. J Comb. 68, 23-34, 2017 | 4 | 2017 |
| 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, 943-961, 2016 | 4 | 2016 |
| On minimum cost edge searching D Dereniowski, D Dyer Theoretical Computer Science 495, 37-49, 2013 | 4 | 2013 |
| On the graceful conjecture for triangular cacti D Dyer, I Payne, N Shalaby, B Wicks Australas. J. Combin 53, 151-170, 2012 | 4 | 2012 |
Dariusz DereniowskiGdańsk University of TechnologyVerified email at eti.pg.edu.pl
