{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:02:27Z","timestamp":1768780947833,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642346101","type":"print"},{"value":"9783642346118","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_19","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T08:42:25Z","timestamp":1350895345000},"page":"172-183","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized Algorithms for Even Cycle Transversal"],"prefix":"10.1007","author":[{"given":"Pranabendu","family":"Misra","sequence":"first","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, 3rd edn., vol.\u00a0173. Springer, Heidelberg (2005), \n                    \n                      http:\/\/www.math.uni-hamburg.de\/home\/diestel\/books\/graph.theory\/GraphTheoryIII.pdf","edition":"3"},{"key":"19_CR2","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, New York (1999)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-13036-6_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"S. Fiorini","year":"2010","unstructured":"Fiorini, S., Joret, G., Pietropaoli, U.: Hitting Diamonds and Growing Cacti. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 191\u2013204. Springer, Heidelberg (2010)"},{"key":"19_CR4","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. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"19_CR5","unstructured":"Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: Approximation and kernelization. In: STACS, pp. 189\u2013200 (2011)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM\u00a016, 372\u2013378 (1973), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/362248.362272","journal-title":"Commun. ACM"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.7155\/jgaa.00177","volume":"13","author":"F. H\u00fcffner","year":"2009","unstructured":"H\u00fcffner, F.: Algorithm engineering for optimal graph bipartization. J. Graph Algorithms Appl.\u00a013(2), 77\u201398 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Kakimura, N., Ichi Kawarabayashi, K., Kobayashi, Y.: Erd\u00f6s-p\u00f3sa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing. In: SODA, pp. 1726\u20131736 (2012)","DOI":"10.1137\/1.9781611973099.137"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-10217-2_37","volume-title":"Combinatorial Algorithms","author":"D. Lokshtanov","year":"2009","unstructured":"Lokshtanov, D., Saurabh, S., Sikdar, S.: Simpler Parameterized Algorithm for OCT. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 380\u2013384. Springer, Heidelberg (2009)"},{"key":"19_CR10","unstructured":"Loksthanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster Parameterized Algorithms using Linear Programming. ArXiv e-prints (March 2012)"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B.A. Reed","year":"2004","unstructured":"Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett.\u00a032(4), 299\u2013301 (2004)","journal-title":"Oper. Res. Lett."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: SODA, pp. 115\u2013119 (2009)","DOI":"10.1137\/1.9781611973068.13"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.3190120111","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"Thomassen, C.: On the presence of disjoint subgraphs of a specified type. Journal of Graph Theory\u00a012(1), 101\u2013111 (1988)","journal-title":"Journal of Graph Theory"}],"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-34611-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:00:41Z","timestamp":1620133241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}