{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:26:42Z","timestamp":1648873602292},"reference-count":22,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1051\/ro\/2016018","type":"journal-article","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T07:36:24Z","timestamp":1455867384000},"page":"261-266","source":"Crossref","is-referenced-by-count":1,"title":["Dual parameterization and parameterized approximability of subset graph problems"],"prefix":"10.1051","volume":"51","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2017,2,1]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"J. Alber and R. Niedermeier, Improved tree decomposition based algorithms for domination-like problems. In Proc. Latin American Symposium on Theoretical Informatics, LATIN\u201902. Vol. 2286 of Lect. Notes Comput. Sci., edited by S. Rajsbaum. Springer-Verlag (2002) 613\u2013628.","DOI":"10.1007\/3-540-45995-2_52"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer-Verlag, Berlin (1999).","DOI":"10.1007\/978-3-642-58412-1"},{"key":"R3","first-page":"272","volume":"339","author":"Bazgan","year":"2005"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"D. Bertsimas, C.-P. Teo and R. Vohra, On dependent randomized rounding algorithms. In Proc. International Conference on Integer Programming and Combinatorial Optimization, IPCO\u201996. Vol. 1084 of Lect. Notes Comput. Sci.. Springer-Verlag (1996) 330\u2013344.","DOI":"10.1007\/3-540-61310-2_25"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender, B.M.P. Jansen and S. Kratsch, Preprocessing for treewidth: a combinatorial analysis through kernelization. In Proc. 38th ICALP. Vol. 6755 of Lect. Notes Comput. Sci. Springer (2011).","DOI":"10.1007\/978-3-642-22006-7_37"},{"key":"R6","unstructured":"N. Bourgeois, K. Dabrowski, M. Demange and V. Th. Paschos, Playing with parameters: structural parameterization in graphs. Preprint arXiv:1309.6144 (2013)."},{"key":"R7","first-page":"102","volume":"51","author":"Cai","year":"2008"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"L. Cai and X. Huang, Fixed-parameter approximation: conceptual framework and approximability results. In Proc. International Workshop on Parameterized and Exact Computation, IWPEC\u201906, Vol. 4169 of Lect. Notes Comput. Sci., edited by H.L. Bodlaender and M.A. Langston. Springer-Verlag (2006) 96\u2013108.","DOI":"10.1007\/11847250_9"},{"key":"R9","unstructured":"M. Cesati, Compendium of parameterized problems. Available at http:\/\/cesati.sprg.uniroma2.it\/research\/compendium\/."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Y. Chen, M. Grohe and M. Gr\u00fcber, On parameterized approximability. In Proc. International Workshop on Parameterized and Exact Computation, IWPEC\u201906. Vol. 4169 of Lect. Notes Comput. Sci., edited by H.L. Bodlaender and M.A. Langston. Springer-Verlag (2006) 109\u2013120.","DOI":"10.1007\/11847250_10"},{"key":"R11","first-page":"117","volume":"158","author":"Demange","year":"1996"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows, Parameterized complexity. Monographs in Computer Science. Springer, New York (1999).","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows and C. McCartin, Parameterized approximation problems. In Proc. International Workshop on Parameterized and Exact Computation, IWPEC\u201906. Vol. 4169 of Lect. Notes Comput. Sci., edited by H.L. Bodlaender and M.A. Langston. Springer-Verlag (2006) 121\u2013129.","DOI":"10.1007\/11847250_11"},{"key":"R14","unstructured":"H. Fernau, Parameterized algorithms: a graph-theoretic approach. Habilitationsschrift, Universit\u00e4t T\u00fcbingen (2005)."},{"key":"R15","first-page":"169","volume":"46","author":"Halld\u00f3rsson","year":"1993"},{"key":"R16","first-page":"1212","volume":"55","author":"Kesselman","year":"2007"},{"key":"R17","first-page":"997","volume":"289","author":"Khot","year":"2002"},{"key":"R18","first-page":"60","volume":"51","author":"Marx","year":"2008"},{"key":"R19","first-page":"122","volume":"51","author":"Sloper","year":"2008"},{"key":"R20","first-page":"25","volume":"3","author":"Vizing","year":"1964"},{"key":"R21","unstructured":"G.J. Woeginger, Exact algorithms for NP-hard problems: a survey. In Combinatorial Optimization \u2013 Eureka! You shrink!. Vol. 2570 of Lect. Notes Comput. Sci., edited by M. Juenger, G. Reinelt and G. Rinaldi. Springer-Verlag (2003) 185\u2013207."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number. In Proc. STOC\u201906 (2006) 681\u2013690.","DOI":"10.1145\/1132516.1132612"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2016018\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T19:17:44Z","timestamp":1567624664000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2016018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":22,"journal-issue":{"issue":"1"},"alternative-id":["ro151107"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2016018","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1]]}}}