2026-08-10T22:58:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6722 2024-03-06T10:26:35Z ddc:004 open_access

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) Erickson, Jeff Klein, Philip N. Marx, Dániel Mathieu, Claire Algorithms planar graphs theory approximation fixed-parameter tractable network flow network design kernelization This report documents the program and the outcomes of Dagstuhl Seminar 16221 “Algorithms for Optimization Problems in Planar Graphs”. The seminar was held from May 29 to June 3, 2016. This report contains abstracts for the recent developments in planar graph algorithms discussed during the seminar as well as summaries of open problems in this area of research. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jeff Erickson and Philip N. Klein and Dániel Marx and Claire Mathieu 2016 Is Part Of Dagstuhl Reports, Volume 6, Issue 5 (2016) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.6.5.94 urn:nbn:de:0030-drops-67227 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.5.94 eng https://creativecommons.org/licenses/by/3.0/legalcode