Contraction Bidimensionality: the Accurate Picture

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

Thumbnail PDF


  • Filesize: 196 kB
  • 12 pages

Document Identifiers

Author Details

Fedor V. Fomin
Petr Golovach
Dimitrios M. Thilikos

Cite AsGet BibTex

Fedor V. Fomin, Petr Golovach, and Dimitrios M. Thilikos. Contraction Bidimensionality: the Accurate Picture. In Parameterized complexity and approximation algorithms. Dagstuhl Seminar Proceedings, Volume 9511, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


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.
  • Paramerterized Algorithms
  • Bidimensionality
  • Graph Minors


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads