It is widely believed that for thousands of fundamental graph problems, efficient
algorithms that handle all graphs can never be constructed. Therefore, algorithms
to solve those problems rely on the special structure of the graphs to be
handled, or approximation or other techniques, all of which involve the analysis
of graph properties.
This 2-day workshop will focus on graphs and their algorithms.
The workshop will include both invited and contributed talks, and there will
be a banquet on the evening of Monday, May 5. Partial funding for travel expenses
of graduate students and PDFs will be available.
Call for Contributed Talks
**Due to popular interest, the program is now full and we are no longer accepting
contributed talks, although attendees are of course still encouraged to register
and join the workshop**
Attendees are welcome to contribute a talk. We welcome contributions in all
areas of graphs and their algorithms. If you would like to give a talk, please
e-mail a preliminary title to Lorna Stewart <lorna.stewart<at>ualberta.ca>
. You will then be asked to provide a final title and abstract in March.
Feodor Dragan, Kent State University, USA
Ekki Koehler, Brandenburg Technical University, Germany
Michel Habib, University Paris Diderot, France
Mike Molloy, University of Toronto, Canada