This page is a stub. Please visit the full workshop page here. 

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.