{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:20Z","timestamp":1742912900184,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174926"},{"type":"electronic","value":"9783642174933"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17493-3_11","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T08:41:01Z","timestamp":1291365661000},"page":"95-106","source":"Crossref","is-referenced-by-count":5,"title":["An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[]},{"given":"Jakub Onufry","family":"Wojtaszczyk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.endm.2004.03.008","volume":"17","author":"C. \u00c0lvarez","year":"2004","unstructured":"\u00c0lvarez, C., Serna, M.J.: The proper interval colored graph problem for caterpillar trees (extended abstract). Electronic Notes in Discrete Mathematics\u00a017, 23\u201328 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-54487-9_49","volume-title":"Computer Science Logic","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Proskurowski, A., Seese, D.: Monadic Second Order Logic, tree automata and forbidden minors. In: Sch\u00f6nfeld, W., B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M. (eds.) CSL 1990. LNCS, vol.\u00a0533, pp. 1\u201316. Springer, Heidelberg (1991)"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"S.F. Assmann","year":"1981","unstructured":"Assmann, S.F., Peck, G.W., Syso, M.M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM Journal on Algebraic and Discrete Methods\u00a02(4), 387\u2013393 (1981)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Proc. of SWAT 2010, pp. 93\u2013104 (2010)","DOI":"10.1007\/978-3-642-13731-0_10"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Proc. of STOC 2010, pp. 251\u2013260 (2010)","DOI":"10.1145\/1806689.1806725"},{"key":"11_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Heidelberg (2005)"},{"key":"11_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"11_CR8","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, 1st edn. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (March 2006)","edition":"1"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.tcs.2006.07.015","volume":"363","author":"M. Lin","year":"2006","unstructured":"Lin, M., Lin, Z., Xu, J.: Graph bandwidth of weighted caterpillars. Theor. Comput. Sci.\u00a0363(3), 266\u2013277 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. AMS Chelsea Publishing (2009)","DOI":"10.1090\/chel\/367"},{"key":"11_CR11","series-title":"Oxford Lecture Series in Mathematics and Its Applications","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 Lecture Series in Mathematics and Its Applications. Oxford University Press, USA (March 2006)"},{"issue":"4","key":"11_CR12","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1215\/S0012-7094-55-02268-7","volume":"22","author":"O. Ore","year":"1955","unstructured":"Ore, O.: Graphs and matching theorems. Duke Math. J.\u00a022(4), 625\u2013639 (1955)","journal-title":"Duke Math. J."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing\u00a016(3), 263\u2013270 (1976)","journal-title":"Computing"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Philip, G., Raman, V., Villanger, Y.: A quartic kernel for pathwidth-one vertex deletion. In: Proc. of WG 2010 (to appear, 2010)","DOI":"10.1007\/978-3-642-16926-7_19"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory, Ser. B\u00a035(1), 39\u201361 (1983)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"3","key":"11_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: Proc. of SODA 2009, pp. 115\u2013119 (2009)","DOI":"10.1137\/1.9781611973068.13"}],"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-17493-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:39:01Z","timestamp":1559835541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17493-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174926","9783642174933"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17493-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}