2nd Annual Workshop on Algorithmic Graph Theory

May 16-20, 2011, Nipissing University, North Bay, Ontario

Schedule of Talks, Room A122
Time\Day Monday, May 16 Tuesday, May 17 Wednesday, May 18 Thursday, May 19 Friday, May 20
9:30-10:30 AM Tatami Tilings: Structure, Enumeration and Puzzles Towards the Construction of a Fast Algorithm for the Vertex Separation Problem on Cactus Graphs Cool-lex order, Bubble Languages, and a De Bruijn Cycle for Fixed-Density Binary Strings On Wiener Index of Line Graphs and Bounds on Gutman Index Meshing Isosurfaces of 3d Fields for Volume Calculation for Estimation of Fragment Size Distribution in Underground Mining
Frank Ruskey Minko Markov Frank Ruskey Darko Dimitrov Rob Alkins
10:45-11:45 AM Finding the Most Vital Nodes in Interval Graphs On Zagreb Indices (In)equality Efficient Generation of Hamilton Cycles in Restricted and Generalized Rotator Graphs A Linear Time Algorithm for the Longest Path Problem on 2-trees Open Problem Session
J. Mark Keil Darko Dimitrov Aaron Williams Minko Markov TBA
11:45AM-1:00PM Lunch Break
1:00-1:30PM NSERC Presentation
John Jackson
1:30-2:30PM Ontario Northland Presentation, Case Study Open Problem Session Open Problem Session Open Problem Session Presentation on the Industrial Problems
Marc Dubeau Tzvetalin Vassilev