Brandstädt, Andreas ;
Corneil, Derek G. ;
Jansen, Klaus ;
Spinrad, Jeremy P.
04221 Abstracts Collection -- Robust and Approximative Algorithms on Particular Graph Classes
Abstract
From 23.05.04 to 28.05.04, the Dagstuhl Seminar
04221 ``Robust and Approximative Algorithms on Particular Graph Classes'' was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
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{brandstdt_et_al:DSP:2005:273,
author = {Andreas Brandst{\"a}dt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad},
title = {04221 Abstracts Collection -- Robust and Approximative Algorithms on Particular Graph Classes},
booktitle = {Robust and Approximative Algorithms an Particular Graph Classes},
year = {2005},
editor = {Andreas Brandst{\"a}dt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad},
number = {04221},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2005/273},
annote = {Keywords: Graph algorithms, graph classes, graph algorithms, robust algorithms, approximation}
}
|
Keywords: |
|
Graph algorithms, graph classes, graph algorithms, robust algorithms, approximation |
|
Seminar: |
|
04221 - Robust and Approximative Algorithms an Particular Graph Classes
|
|
Issue date: |
|
2005 |
|
Date of publication: |
|
19.09.2005 |
