07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes

2022/01/26 by Brandstädt, Andreas, Jansen, Klaus, Kratsch, Dieter +1
#Graph theory #approximation algorithms #certifying algorithms #exact algorithms

paper · doi:10.4230/dagsemproc.07211.1

Abstract

From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying 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.

Related

• 04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes
• 05301 Abstracts Collection – Exact Algorithms and Fixed-Parameter Tractability
• 07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs
• 05291 Abstracts Collection – Sublinear Algorithms
• 05201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms