License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.3.10.36
URN: urn:nbn:de:0030-drops-44274
URL: http://drops.dagstuhl.de/opus/volltexte/2014/4427/
Go back to Dagstuhl Reports


Borradaile, Glencora ; Klein, Philp ; Marx, Dániel ; Mathieu, Claire
Weitere Beteiligte (Hrsg. etc.): Glencora Borradaile and Philip Klein and Dániel Marx and Claire Mathieu

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

pdf-format:
dagrep_v003_i010_p036_s13421.pdf (0.9 MB)


Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 13421 "Algorithms for Optimization Problems in Planar Graphs". The seminar was held from October 13 to October 18, 2013. 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.

BibTeX - Entry

@Article{borradaile_et_al:DR:2014:4427,
  author =	{Glencora Borradaile and Philp Klein and D{\'a}niel Marx and Claire Mathieu},
  title =	{{Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)}},
  pages =	{36--57},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{10},
  editor =	{Glencora Borradaile and Philip Klein and D{\'a}niel Marx and Claire Mathieu},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2014/4427},
  URN =		{urn:nbn:de:0030-drops-44274},
  doi =		{10.4230/DagRep.3.10.36},
  annote =	{Keywords: Algorithms, planar graphs, theory, approximation, fixed-parameter tractable, network flow, network design, kernelization}
}

Keywords: Algorithms, planar graphs, theory, approximation, fixed-parameter tractable, network flow, network design, kernelization
Seminar: Dagstuhl Reports, Volume 3, Issue 10
Issue Date: 2014
Date of publication: 13.02.2014


DROPS-Home | Fulltext Search | Imprint Published by LZI