@Article{brandstadt_et_al:DagRep.1.5.29,
author = {Brandst\"{a}dt, Andreas and Golumbic, Martin Charles and Heggernes, Pinar and McConnell, Ross},
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 = {Brandst\"{a}dt, Andreas and Golumbic, Martin Charles and Heggernes, Pinar and McConnell, Ross},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.5.29},
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}
}