2026-08-05T06:24:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6890 2024-03-06T10:39:00Z ddc:004 open_access

Graph Decompositions and Algorithms (Invited Talk) Fomin, Fedor V. Algorithms logic graph minor 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Fedor V. Fomin 2016 Is Part Of LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2016.5 urn:nbn:de:0030-drops-68903 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.5 eng https://creativecommons.org/licenses/by/3.0/legalcode