{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:40Z","timestamp":1759638520665},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_30","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T09:34:40Z","timestamp":1277285680000},"page":"293-303","source":"Crossref","is-referenced-by-count":3,"title":["Kernelization for Cycle Transversal Problems"],"prefix":"10.1007","author":[{"given":"Ge","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N.: Kernelization algorithms for d-hitting set problems. In: WADS, pp. 434\u2013445 (2007)","DOI":"10.1007\/978-3-540-73951-7_38"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01261315","volume":"16","author":"N. Alon","year":"1996","unstructured":"Alon, N.: Bipartite subgraphs. Combinatorica\u00a016, 301\u2013311 (1996)","journal-title":"Combinatorica"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (2009)","DOI":"10.1109\/FOCS.2009.46"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1002\/jgt.20346","volume":"60","author":"O.V. Borodin","year":"2009","unstructured":"Borodin, O.V., Kostochka, A.V., Sheikh, N.N., Yu, G.: M-degrees of quadrangle-free planar graphs. J. Graph Theory\u00a060(1), 80\u201385 (2009)","journal-title":"J. Graph Theory"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.endm.2009.02.008","volume":"32","author":"D. Br\u00fcgmann","year":"2009","unstructured":"Br\u00fcgmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electronic Notes in Discrete Mathematics\u00a032, 51\u201358 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/jgt.3190180405","volume":"18","author":"G. Cherlin","year":"1994","unstructured":"Cherlin, G., Komj\u00e1th, P.: There is no universal countable pentagon-free graph. J. Graph Theory\u00a018(4), 337\u2013341 (1994)","journal-title":"J. Graph Theory"},{"key":"30_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1002\/jgt.20391","volume":"62","author":"L. Esperet","year":"2009","unstructured":"Esperet, L., Montassier, M., Zhu, X.: Adapted list coloring of planar graphs. J. Graph Theory\u00a062(2), 127\u2013138 (2009)","journal-title":"J. Graph Theory"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.endm.2006.06.065","volume":"25","author":"H. Fernau","year":"2006","unstructured":"Fernau, H.: Speeding up exact algorithms with high probability. Electronic Notes in Discrete Mathematics\u00a025, 57\u201359 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.0052","volume":"68","author":"Z. F\u00fcredi","year":"1996","unstructured":"F\u00fcredi, Z.: On the number of edges of quadrilateral-free graphs. J. Comb. Theory Ser. B\u00a068(1), 1\u20136 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.aim.2005.04.011","volume":"203","author":"Z. F\u00fcredi","year":"2006","unstructured":"F\u00fcredi, Z., Naor, A., Verstraete, J.: On the turan number for the hexagon. Advances in Mathematics\u00a0203(2), 476\u2013496 (2006)","journal-title":"Advances in Mathematics"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-73420-8_34","volume-title":"Automata, Languages and Programming","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Linear problem kernels for NP-hard problems on planar graphs. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 375\u2013386. Springer, Heidelberg (2007)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.endm.2009.07.059","volume":"34","author":"E. Gy\u00f6ri","year":"2009","unstructured":"Gy\u00f6ri, E., Lemons, N.: Hypergraphs with no odd cycle of given length. Electronic Notes in Discrete Mathematics\u00a034, 359\u2013362 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"9","key":"30_CR15","doi-asserted-by":"publisher","first-page":"4219","DOI":"10.1109\/TIT.2006.880060","volume":"52","author":"T.R. Halford","year":"2006","unstructured":"Halford, T.R., Grant, A.J., Chugg, K.M.: Which codes have 4-cycle-free tanner graphs? IEEE Transactions on Information Theory\u00a052(9), 4219\u20134223 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"30_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci.\u00a074(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-85363-3_10","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"G. Kortsarz","year":"2008","unstructured":"Kortsarz, G., Langberg, M., Nutov, Z.: Approximating maximum subgraphs without short cycles. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 118\u2013131. Springer, Heidelberg (2008)"},{"issue":"1-3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(93)00228-W","volume":"142","author":"M. Krivelevich","year":"1995","unstructured":"Krivelevich, M.: On a conjecture of tuza about packing and covering of triangles. Discrete Math.\u00a0142(1-3), 281\u2013286 (1995)","journal-title":"Discrete Math."},{"key":"30_CR19","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/3-540-13883-8_86","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"C.E. Veni Madhavan","year":"1984","unstructured":"Veni Madhavan, C.E.: Foundations of Software Technology and Theoretical Computer Science, vol.\u00a0181, pp. 381\u2013392. Springer, Heidelberg (1984)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-95891-8_37","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"H. Moser","year":"2009","unstructured":"Moser, H.: A problem kernelization for graph packing. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 401\u2013412. Springer, Heidelberg (2009)"},{"issue":"5-6","key":"30_CR21","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1017\/S0963548305007029","volume":"14","author":"A. Naor","year":"2005","unstructured":"Naor, A., Verstra\u00ebte, J.: A note on bipartite graphs without 2k-cycles. Comb. Probab. Comput.\u00a014(5-6), 845\u2013849 (2005)","journal-title":"Comb. Probab. Comput."},{"issue":"4","key":"30_CR22","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s00493-002-0009-5","volume":"22","author":"C. Thomassen","year":"2002","unstructured":"Thomassen, C.: On the chromatic number of triangle-free graphs of large minimum degree. Combinatorica\u00a022(4), 591\u2013596 (2002)","journal-title":"Combinatorica"},{"issue":"2","key":"30_CR23","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00493-007-0054-1","volume":"27","author":"C. Thomassen","year":"2007","unstructured":"Thomassen, C.: On the chromatic number of pentagon-free graphs of large minimum degree. Combinatorica\u00a027(2), 241\u2013243 (2007)","journal-title":"Combinatorica"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:25:13Z","timestamp":1619771113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}