{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:15:13Z","timestamp":1725974113906},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_64","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"775-786","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized Approximation Schemes Using Graph Widths"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lampis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"64_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O. Ben-Zwi","year":"2011","unstructured":"Ben-Zwi, O., Hermelin, D., Lokshtanov, D., Newman, I.: Treewidth governs the complexity of target set selection. Discrete Optimization\u00a08(1), 87\u201396 (2011)","journal-title":"Discrete Optimization"},{"issue":"1","key":"64_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N. Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On bounded-degree vertex deletion parameterized by treewidth. Discrete Applied Mathematics\u00a0160(1), 53\u201360 (2012)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"64_CR3","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/S0097539795289859","volume":"27","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput.\u00a027(6), 1725\u20131746 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"64_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1093\/comjnl\/bxm037","volume":"51","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Koster, A.M.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal\u00a051(3), 255\u2013269 (2008)","journal-title":"The Computer Journal"},{"key":"64_CR5","unstructured":"Bonnet, E., Paschos, V.T.: Parameterized (in)approximability of subset problems. CoRR, abs\/1310.5576 (2013)"},{"key":"64_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-74839-7_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., Kant\u00e9, M.M.: Graph operations characterizing rank-width and balanced graph expressions. In: Brandst\u00e4dt, A., Kratsch, D., M\u00fcller, H. (eds.) WG 2007. LNCS, vol.\u00a04769, pp. 66\u201375. Springer, Heidelberg (2007)"},{"issue":"2","key":"64_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems\u00a033(2), 125\u2013150 (2000)","journal-title":"Theory of Computing Systems"},{"key":"64_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-79723-4_9","volume-title":"Parameterized and Exact Computation","author":"M. Dom","year":"2008","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: A parameterized perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 78\u201390. Springer, Heidelberg (2008)"},{"key":"64_CR9","unstructured":"Ebenlendr, T., Krc\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. In: Teng, S.-H. (ed.) SODA, pp. 483\u2013490. SIAM (2008)"},{"key":"64_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45477-2_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"W. Espelage","year":"2001","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Van Le, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 117\u2013128. Springer, Heidelberg (2001)"},{"issue":"2","key":"64_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. Information and Computation\u00a0209(2), 143\u2013153 (2011)","journal-title":"Information and Computation"},{"key":"64_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Algorithmic lower bounds for problems parameterized with clique-width. In: Charikar, M. (ed.) SODA, pp. 493\u2013502. SIAM (2010)","DOI":"10.1137\/1.9781611973075.42"},{"issue":"1","key":"64_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.disopt.2010.09.009","volume":"8","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Thilikos, D.M.: Paths of bounded length and their cuts: Parameterized complexity and algorithms. Discrete Optimization\u00a08(1), 72\u201386 (2011)","journal-title":"Discrete Optimization"},{"key":"64_CR14","unstructured":"Harland, J., Manyem, P.: Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symp osium (CATS 2008), Wollongong, NSW, Australia, January 22-25. CRPIT, vol.\u00a077. Australian Computer Society (2008)"},{"key":"64_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-642-28050-4_19","volume-title":"Parameterized and Exact Computation","author":"M. Lampis","year":"2012","unstructured":"Lampis, M.: Parameterized maximum path coloring. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol.\u00a07112, pp. 232\u2013245. Springer, Heidelberg (2012)"},{"key":"64_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-31833-0_3","volume-title":"Approximation and Online Algorithms","author":"D. Marx","year":"2005","unstructured":"Marx, D.: Minimum sum multicoloring on the edges of planar graphs and partial k-trees. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 9\u201322. Springer, Heidelberg (2005)"},{"issue":"1","key":"64_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J.\u00a051(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"key":"64_CR18","unstructured":"Meeks, K., Scott, A.: The parameterised complexity of list problems on graphs of bounded treewidth. CoRR, abs\/1110.4077 (2011)"},{"issue":"3","key":"64_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences\u00a043(3), 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"64_CR20","unstructured":"Samer, M., Szeider, S.: Tractable cases of the extended global cardinality constraint. In: Harland and Manyem [14], pp. 67\u201374"},{"issue":"2","key":"64_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jcss.2009.04.003","volume":"76","author":"M. Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. J. Comput. Syst. Sci.\u00a076(2), 103\u2013114 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"64_CR22","unstructured":"Skowron, P., Faliszewski, P.: Approximating the MaxCover problem with bounded frequencies in FPT time. CoRR, abs\/1309.4405 (2013)"},{"key":"64_CR23","unstructured":"Szeider, S.: Not so easy problems for tree decomposable graphs. CoRR, abs\/1107.1177 (2011)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:21:06Z","timestamp":1558923666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":23,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-662-43948-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}
