Bidimensionality and Parameterized Algorithms (Invited Talk)

Author Dimitrios M. Thilikos

Thumbnail PDF


  • Filesize: 0.62 MB
  • 16 pages

Document Identifiers

Author Details

Dimitrios M. Thilikos

Cite AsGet BibTex

Dimitrios M. Thilikos. Bidimensionality and Parameterized Algorithms (Invited Talk). In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)


We provide an exposition of the main results of the theory of bidimensionality in parameterized algorithm design. This theory applies to graph problems that are bidimensional in the sense that i) their solution value is not increasing when we take minors or contractions of the input graph and ii) their solution value for the (triangulated) (k x k)-grid graph grows as a quadratic function of k. Under certain additional conditions, mainly of logical and combinatorial nature, such problems admit subexponential parameterized algorithms and linear kernels when their inputs are restricted to certain topologically defined graph classes. We provide all formal definitions and concepts in order to present these results in a rigorous way and in their latest update.
  • Parameterized algorithms
  • Subexponential FPT-algorithms
  • Kernelization
  • Linear kenrels
  • Bidimensionality
  • Graph Minors


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail