Workshop on Algorithmic Graph Theory

May 17-21, 2010, Nipissing University, North Bay, Ontario

Schedule of Talks
Time\Day Monday, May 17 Tuesday, May 18 Wednesday, May 19 Thursday, May 20 Friday, May 21
1:00-2:00 PM On the densest k-subgraph Problem Longest Paths in Cactus Graphs Gray Code Compression Fast Searching Games on Graphs Total Curvature of a Path
Mark Keil Minko Markov Darko Dimitrov Boting Yang Krystyna Kuperberg
2:30-3:30 PM Gray Codes Avoiding or Containing Matchings Digraph Search Problems Finding Empty Cubes in any Dimension Vertex Separation in Graphs Injective Coloring of Planar Graphs
Darko Dimitrov Boting Yang Mark Keil Minko Markov Darko Dimitrov