1st Graph Searching in Canada (GRASCan) Workshop

May 25-27, 2012 at Ryerson University

The conference program is now available.

All talks will be held in ENGLG14 in the basement of the George Vari Engineering Building Map

Slides from selected talks

What is left to do on Cops and Robbers?, Anthony Bonato

Cops and Robber on Circulant Graphs, Shannon Fitzpatrick

Protecting a Graph with Mobile Guards, Kieka Mynhardt

The Petersen graph is the smallest 3-cop win graph, Andrew Beveridge

Cops and invisible robbers: The cost of drunkenness, Dieter Mitsche (paper on Dieter's web page)

Cops and Robber Game with a Fast Robber on Interval Graphs and Chordal Graphs, Abbas Mehrabian; video

Revolutionaries and spies on random graphs, Pawel Pralat (paper on Pawel's web page)

Cops and robbers on graphs associated with combinatorial designs, Andrea Burgess

Slow Firefighting, Margaret-Ellen Messinger

Discharging Fire-Works!, Stephen Finbow

Fast-Mixed Searching and Related Problems on Graphs, Boting Yang