{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:48:44Z","timestamp":1725889724065},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332920"},{"type":"electronic","value":"9783642332937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33293-7_7","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T10:50:58Z","timestamp":1346237458000},"page":"49-60","source":"Crossref","is-referenced-by-count":0,"title":["Restricted and Swap Common Superstring: A Parameterized View"],"prefix":"10.1007","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Italo","family":"Zoppis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","first-page":"844","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J.\u00a0ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J.\u00a0ACM"},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1145\/179812.179818","volume":"41","author":"A. Blum","year":"1994","unstructured":"Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear Approximation of Shortest Superstrings. J. ACM\u00a041(4), 630\u2013647 (1994)","journal-title":"J. ACM"},{"issue":"8","key":"7_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On Problems Without Polynomial Kernels. J. Comput. Syst. Sci.\u00a075(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR4","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-Composition: A New Technique for Kernelization Lower Bounds. In: Proceedings of STACS 2011, pp. 165\u2013176 (2011)"},{"issue":"35","key":"7_CR5","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel Bounds for Disjoint Cycles and Disjoint Paths. Theor. Comput. Sci.\u00a0412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-21458-5_39","volume-title":"Combinatorial Pattern Matching","author":"R. Clifford","year":"2011","unstructured":"Clifford, R., Gotthilf, Z., Lewenstein, M., Popa, A.: Restricted Common Superstring and Restricted Common Supersequence. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 467\u2013478. Springer, Heidelberg (2011)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-10217-2_2","volume-title":"Combinatorial Algorithms","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R.: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 2\u201310. Springer, Heidelberg (2009)"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of Instance Compression and Succinct PCPs for NP. J. Comput. Syst. Sci.\u00a077(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR9","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-16321-0_28","volume-title":"String Processing and Information Retrieval","author":"Z. Gotthilf","year":"2010","unstructured":"Gotthilf, Z., Lewenstein, M., Popa, A.: On Shortest Common Superstring and Swap Permutations. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 270\u2013278. Springer, Heidelberg (2010)"},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"7_CR13","unstructured":"Niedermeier, R.: Reflections on Multivariate algorithmics and Problem Parameterization. In: Proceedings of STACS 2010, pp. 17\u201332 (2010)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-46784-X_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Ott","year":"1999","unstructured":"Ott, S.: Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 55\u201364. Springer, Heidelberg (1999)"},{"key":"7_CR15","volume-title":"Data Compression: Methods and Theory","author":"J. Storer","year":"1988","unstructured":"Storer, J.: Data Compression: Methods and Theory. Computer Science Press, New York (1988)"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"1999","unstructured":"Sweedyk, Z.: A 2\n                  \n                    \n                  \n                  $\\frac{1}{2}$\n                -Approximation Algorithm for Shortest Superstring. SIAM J. Comput.\u00a029(3), 954\u2013986 (1999)","journal-title":"SIAM J. Comput."},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/11549345_68","volume-title":"Mathematical Foundations of Computer Science 2005","author":"V. Vassilevska","year":"2005","unstructured":"Vassilevska, V.: Explicit Inapproximability Bounds for the Shortest Superstring Problem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 793\u2013800. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33293-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:03:31Z","timestamp":1620129811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33293-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332920","9783642332937"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33293-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}