Document Open Access Logo

Graph Decompositions and Algorithms (Invited Talk)

Author Fedor V. Fomin

Thumbnail PDF


  • Filesize: 198 kB
  • 1 pages

Document Identifiers

Author Details

Fedor V. Fomin

Cite AsGet BibTex

Fedor V. Fomin. Graph Decompositions and Algorithms (Invited Talk). In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, p. 5:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


We overview the recent progress in solving intractable optimization problems on planar graphs as well as other classes of sparse graphs. In particular, we discuss how tools from Graph Minors theory can be used to obtain: * subexponential parameterized algorithms * approximation algorithms, and * preprocessing and kernelization algorithms on these classes of graphs.
  • Algorithms
  • logic
  • graph minor


  • 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