28, 29 May 2015


Université de Montréal


Last update 30 May 2015



The 3rd Graph Searching in Canada (GRASCan) Workshop will was be held at the University of Montreal 28-29 May 2015. The purpose of this ongoing, invitation-only workshop is to bring together graph searchers working in any and all aspects of good versus bad guy games on graphs and their variants, such as Cops and Robbers, edge searching, firefighting, and graph cleaning.


Talks are were each 30 - 60 minutes in length and will take place during the mornings of the workshop, leaving the afternoon free for discussions and collaborations. Schedule is for 45 minute talks (with discussion), but the presentation may be shorter or longer. Please let me know if you need more time (or much less). If you wish to talk and are not on the program, let me know NOW. Titles and abstracts are those received, please provide yours if it is not included. See the latest version of the program, with links to the slides of the talks.




GRASCan 12 was held in May 2012 at Ryerson.


GRASCan 13 was held in April 26-28, 2013 at Ryerson.


REGISTRATION  fee: 0.0$; coffee breaks and lunches will be provided with the support of the Centre de Recherches Mathématiques.


PARTICIPANTS confirmed (a * indicates a talk)


Anthony Bonato*

Nancy Clarke

Danny Dyer*

Stephen Finbow

Léo Frachet

Xavier Perez Gimenez*

Ilya Gromovikov

Geňa Hahn

Bill Kinnersley*

Jano Manuch

Eduardo Martínez*

Margeret-Ellen Messinger

Kerry Ojakian*

Ben Reiniger

Ben Seamone

Laco Stacho





Rooms have been reserved at the Royal Terrace near the university at the rate of 119.00/night plus tax (most have kitchenettes). They MUST be booked by May 14, afterwards they might either disappear or be more expensive. Mention GrasCAN.


Rooms can also be had at the UdeM residences, known as Studio Hotel in the summer. Follow the link below and choose the appropriate event  (GRASCAN) in order to get the preferred rate.  You may also call 514-343-8006.


For information about the Studio hotel:



The rates are here. Again, first come, first served.