{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:46Z","timestamp":1772893006508,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642102165","type":"print"},{"value":"9783642102172","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_37","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"380-384","source":"Crossref","is-referenced-by-count":19,"title":["Simpler Parameterized Algorithm for OCT"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, Y., Lu, S., Razgon, I., O\u2019Sullivan, B.: A Fixed-Parameter Algorithm for the Directed Feedback Vertex Set Problem. Journal of the ACM\u00a055(5) (2008)","DOI":"10.1145\/1411509.1411511"},{"issue":"3","key":"37_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00224-007-1345-z","volume":"41","author":"F. Dehne","year":"2007","unstructured":"Dehne, F., Fellows, M., Langston, M., Rosamond, F., Stevens, K.: An O(2\n                    O(k)\n                  n\n                  3) FPT algorithm for the undirected feedback vertex set problem. Theory of Comput. Syst.\u00a041(3), 479\u2013492 (2007)","journal-title":"Theory of Comput. Syst."},{"issue":"8","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci.\u00a072(8), 1386\u20131396 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-540-78773-0_61","volume-title":"LATIN 2008: Theoretical Informatics","author":"F. H\u00fcffner","year":"2008","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 711\u2013722. Springer, Heidelberg (2008)"},{"issue":"2","key":"37_CR5","doi-asserted-by":"crossref","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. Journal of Graph Algorithms and Applications\u00a013(2), 77\u201398 (2009)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11917496_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Marx","year":"2006","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 37\u201348. Springer, Heidelberg (2006)"},{"key":"37_CR7","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"An Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.orl.2003.10.009","volume":"32","author":"B. Reed","year":"2004","unstructured":"Reed, B., Vetta, A., Smith, K.: Finding Odd Cycle Transversals. Operations Research Letters\u00a032, 229\u2013301 (2004)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:34Z","timestamp":1619782474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}