The beta version of DROPS 2 is now publicly available! Check this page out at DROPS 2 now!


License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09511.1
URN: urn:nbn:de:0030-drops-25025
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2502/
Go to the corresponding Portal

Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel

09511 Abstracts Collection -- Parameterized complexity and approximation algorithms

pdf-format:
09511_abstracts_collection.2502.pdf (0.2 MB)

Abstract

From 14. 12. 2009 to 17. 12. 2009., the Dagstuhl Seminar 09511
``Parameterized complexity and approximation algorithms '' was held
in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.

BibTeX - Entry

@InProceedings{demaine_et_al:DagSemProc.09511.1,
  author =	{Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Marx, D\'{a}niel},
  title =	{{09511 Abstracts Collection – Parameterized complexity and approximation algorithms}},
  booktitle =	{Parameterized complexity and approximation algorithms},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9511},
  editor =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D\'{a}niel Marx},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2502},
  URN =		{urn:nbn:de:0030-drops-25025},
  doi =		{10.4230/DagSemProc.09511.1},
  annote =	{Keywords: Parameterized complexity, Approximation algorithms}
}

Keywords: Parameterized complexity, Approximation algorithms
Collection: 09511 - Parameterized complexity and approximation algorithms
Issue Date: 2010
Date of publication: 02.03.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI