04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes
Andreas Brandstädt, Derek Gordon Corneil, Klaus Jansen, Jeremy Spinrad · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2005
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.