2010/01/01 by Erik D. Demaine, Demaine, Erik D., MohammadTaghi Hajiaghayi +3
Computer Science · #Advanced Graph Theory Research #Approximation algorithms #Computability, Logic, AI Algorithms #Parameterized complexity #semigroups and automata theory
paper · doi:10.4230/dagsemproc.09511.1
openalex publication_date 2010/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.