2026-07-21T19:24:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3202 2024-03-06T10:25:42Z ddc:004 open_access

Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182) Brandstädt, Andreas Golumbic, Martin Charles Heggernes, Pinar McConnell, Ross Graph Classes Graph Algorithms NP-completeness Width Parameters Approximation Algorithms Parameterized Complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Andreas Brandstädt and Martin Charles Golumbic and Pinar Heggernes and Ross McConnell 2011 Is Part Of Dagstuhl Reports, Volume 1, Issue 5 (2011) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.1.5.29 urn:nbn:de:0030-drops-32027 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.29 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode