When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09511.5
URN: urn:nbn:de:0030-drops-25009
Go to the corresponding Portal

Fomin, Fedor V. ; Golovach, Petr ; Thilikos, Dimitrios M.

Contraction Bidimensionality: the Accurate Picture

09511.ThilikosDimitrios.ExtAbstract.2500.pdf (0.2 MB)


We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we unify and significantly simplify contraction bidimensionality theory -- the meta algorithmic framework to design efficient parameterized and approximation algorithms for contraction closed parameters.

BibTeX - Entry

  author =	{Fomin, Fedor V. and Golovach, Petr and Thilikos, Dimitrios M.},
  title =	{{Contraction Bidimensionality: the Accurate Picture}},
  booktitle =	{Parameterized complexity and approximation algorithms},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9511},
  editor =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D\'{a}niel Marx},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-25009},
  doi =		{10.4230/DagSemProc.09511.5},
  annote =	{Keywords: Paramerterized Algorithms, Bidimensionality, Graph Minors}

Keywords: Paramerterized Algorithms, Bidimensionality, Graph Minors
Collection: 09511 - Parameterized complexity and approximation algorithms
Issue Date: 2010
Date of publication: 02.03.2010

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