{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:34Z","timestamp":1725569734366},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"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-16926-7_12","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"112-122","source":"Crossref","is-referenced-by-count":0,"title":["On the Small Cycle Transversal of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ge","family":"Xia","sequence":"first","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM\u00a051(3), 363\u2013384 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0095-8956(03)00036-4","volume":"88","author":"N. Alon","year":"2003","unstructured":"Alon, N., Bollob\u00e1s, B., Krivelevich, M., Sudakov, B.: Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory Ser. B\u00a088(2), 329\u2013346 (2003)","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR3","series-title":"DIMACS Series","first-page":"1","volume-title":"Robust Communication Networks: Interconnection and Survivability","author":"A. Bley","year":"1998","unstructured":"Bley, A., Gr\u00f6tschel, M., Wessly, R.: Design of broadband virtual private networks: Model and heuristics for the B-WiN. In: Robust Communication Networks: Interconnection and Survivability. DIMACS Series, vol.\u00a053, pp. 1\u201316. AMS, Providence (1998)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS CoRR, abs\/0904.0727 (2009)","DOI":"10.1109\/FOCS.2009.46"},{"key":"12_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"},{"key":"12_CR6","doi-asserted-by":"publisher","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":"1","key":"12_CR7","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":"12_CR8","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)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1006\/jctb.2002.2123","volume":"86","author":"S. Hoory","year":"2002","unstructured":"Hoory, S.: The size of bipartite graphs with a given girth. J. Comb. Theory Ser. B\u00a086(2), 215\u2013220 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR10","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":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.ipl.2004.06.020","volume":"92","author":"I. Krasikov","year":"2004","unstructured":"Krasikov, I., Noble, S.D.: Finding next-to-shortest paths in a graph. Inf. Process. Lett.\u00a092(3), 117\u2013119 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"9","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1786","DOI":"10.1101\/gr.2395204","volume":"14","author":"P. Pevzner","year":"2004","unstructured":"Pevzner, P., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. Genome Research\u00a014(9), 1786\u20131796 (2004)","journal-title":"Genome Research"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-007-9148-9","volume":"52","author":"V. Raman","year":"2008","unstructured":"Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica\u00a052(2), 203\u2013225 (2008)","journal-title":"Algorithmica"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Timmons, C.: Star coloring high girth planar graphs. The Electronic Journal of Combinatorics\u00a015(R124) (2008)","DOI":"10.37236\/848"},{"key":"12_CR15","unstructured":"Xia, G., Zhang, Y.: On the small cycle transversal of planar graphs. Technical Report, http:\/\/www.cs.lafayette.edu\/~gexia\/research\/sctrans.pdf"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Xia, G., Zhang, Y.: Kernelization for cycle transversal problems. In: AAIM, pp. 293\u2013303 (2010)","DOI":"10.1007\/978-3-642-14355-7_30"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC 1978, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"issue":"1-3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2008.04.018","volume":"407","author":"J. Zhu","year":"2008","unstructured":"Zhu, J., Bu, Y.: Equitable list colorings of planar graphs without short cycles. Theor. Comput. Sci.\u00a0407(1-3), 21\u201328 (2008)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T13:33:07Z","timestamp":1592055187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}