License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.1.5.29
URN: urn:nbn:de:0030-drops-32027
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3202/
Go back to Dagstuhl Reports

Brandstädt, Andreas ; Golumbic, Martin Charles ; Heggernes, Pinar ; McConnell, Ross
Weitere Beteiligte (Hrsg. etc.): Andreas Brandstädt and Martin Charles Golumbic and Pinar Heggernes and Ross McConnell

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

pdf-format:
dagrep_v001_i005_p029_s11182.pdf (0.9 MB)

Abstract

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.

BibTeX - Entry

@Article{brandstdt_et_al:DR:2011:3202,
  author =	{Andreas Brandst{\"a}dt and Martin Charles Golumbic and Pinar Heggernes and Ross McConnell},
  title =	{{Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)}},
  pages =	{29--46},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{5},
  editor =	{Andreas Brandst{\"a}dt and Martin Charles Golumbic and Pinar Heggernes and Ross McConnell},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3202},
  URN =		{urn:nbn:de:0030-drops-32027},
  doi =		{10.4230/DagRep.1.5.29},
  annote =	{Keywords: Graph Classes, Graph Algorithms, NP-completeness, Width Parameters, Approximation Algorithms, Parameterized Complexity}
}

Keywords: Graph Classes, Graph Algorithms, NP-completeness, Width Parameters, Approximation Algorithms, Parameterized Complexity
Collection: Dagstuhl Reports, Volume 1, Issue 5
Issue Date: 2011
Date of publication: 31.08.2011

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI