2026-07-22T13:50:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2499 2024-03-06T11:09:05Z ddc:004 open_access

09511 Open Problems – Parameterized complexity and approximation algorithms Demaine, Erik D. Hajiaghayi, MohammadTaghi Marx, Dániel Parameterized complexity approximation algorithms open problems The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Erik D. Demaine and MohammadTaghi Hajiaghayi and Dániel Marx 2010 Is Part Of Dagstuhl Seminar Proceedings, Volume 9511, Parameterized complexity and approximation algorithms (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09511.3 urn:nbn:de:0030-drops-24992 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09511.3 eng https://creativecommons.org/licenses/by/4.0/legalcode