# Danny Dyer

According to our database

Collaborative distances:

^{1}, Danny Dyer authored at least 21 papers between 2004 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

The coarse geometry of Hartnell's firefighter problem on infinite graphs.

Discrete Mathematics, 2017

The watchman's walk of Steiner triple system block intersection graphs.

Australasian J. Combinatorics, 2017

2016

Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges.

Graphs and Combinatorics, 2016

2015

The complexity of zero-visibility cops and robber.

Theor. Comput. Sci., 2015

Zero-visibility cops and robber and the pathwidth of a graph.

J. Comb. Optim., 2015

2014

The Complexity of Zero-Visibility Cops and Robber.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013

On minimum cost edge searching.

Theor. Comput. Sci., 2013

Three-fast-searchable graphs.

Discrete Applied Mathematics, 2013

Zero-Visibility Cops and Robber Game on a Graph.

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012

Paley graphs have Hamilton decompositions.

Discrete Mathematics, 2012

Small 2-coloured path decompositions.

Ars Comb., 2012

On the graceful labelling of triangular cacti conjecture.

Australasian J. Combinatorics, 2012

A time-constrained variation of the Watchman's Walk problem.

Australasian J. Combinatorics, 2012

2011

Searching Circulant Graphs.

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009

Sweeping graphs with large clique number.

Discrete Mathematics, 2009

Edge searching weighted graphs.

Discrete Applied Mathematics, 2009

2008

Time constrained graph searching.

Theor. Comput. Sci., 2008

On the Fast Searching Problem.

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Lower Bounds on Edge Searching.

Proceedings of the Combinatorics, 2007

Arc Searching Digraphs Without Jumping.

Proceedings of the Combinatorial Optimization and Applications, 2007

2004

Sweeping Graphs with Large Clique Number.

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004