Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)

Andreas BrandstäDt, Martin Charles Golumbic, Pinar Heggernes & Ross McConnell
This report documents the program and the outcomes of Dagstuhl Seminar 11182 ``Exploiting graph structure to cope with hard problems'' which has been held in Schloss Dagstuhl -- Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011. During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph. Moreover, in the afternoon of...