10.4230/DAGREP.1.5.29
Brandstädt, Andreas
Andreas
Brandstädt
Golumbic, Martin Charles
Martin Charles
Golumbic
Heggernes, Pinar
Pinar
Heggernes
McConnell, Ross
Ross
McConnell
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Seminar Report
Graph Classes
Graph Algorithms
NP-completeness
Width Parameters
Approximation Algorithms
Parameterized Complexity
2011
2011-08-31
2011-08-31
2011-08-31
en
urn:nbn:de:0030-drops-32027
10.4230/DagRep.1.5.0
2192-5283
2192-5283
Dagstuhl Reports (DagRep)
2011
1
5
2
29
46
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
18 pages
948275 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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 each seminar's day new problems have been posed and discussed.
Dagstuhl Reports, Volume 1, Issue 5, pages 29-46