Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)

Erickson, Jeff; Klein, Philip N.; Marx, Dániel; Mathieu, Claire

doi:10.4230/DagRep.6.5.94

Document

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)

Authors Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 6, Issue 5
Part of: Volume: Dagstuhl Reports, Volume 6
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2016-11-15

PDF

File

PDF

DagRep.6.5.94.pdf

Filesize: 1.06 MB
20 pages

Document Identifiers

DOI: 10.4230/DagRep.6.5.94
URN: urn:nbn:de:0030-drops-67227

Subject Classification

Keywords

Algorithms
planar graphs
theory
approximation
fixed-parameter tractable
network flow
network design
kernelization

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get BibTex

Jeff Erickson, Philip N. Klein, Dániel Marx, and Claire Mathieu. Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). In Dagstuhl Reports, Volume 6, Issue 5, pp. 94-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/DagRep.6.5.94

Author Details

Jeff Erickson

Philip N. Klein

Dániel Marx

Claire Mathieu

and all authors of the abstracts in this report

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