{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:18Z","timestamp":1725558378897},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_42","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"484-492","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized Complexity of Directed Feedback Set Problems in Tournaments"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"Arvind, V., Fellows, M.R., Mahajan, M., Raman, V., Rao, S.S., Rosamond, F.A., Subramanian, C.R.: Parametric Duality and Fixed Parameter Tractability (2001) (manuscript)"},{"key":"42_CR2","volume-title":"Digraphs Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2001","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs Theory, Algorithms and Applications. Springer, Heidelberg (2001)"},{"key":"42_CR3","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1998)"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G. (Seffi) Naor, J., Schieber, B., Sudan, M.: Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica\u00a020, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-68530-8_9","volume-title":"Algorithms - ESA \u201998","author":"M. Fellows","year":"1998","unstructured":"Fellows, M., Hallett, M., Korostensky, C., Stege, U.: Analogs and Duals of the MAST Problem for Sequences and Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 103\u2013114. Springer, Heidelberg (1998)"},{"issue":"4","key":"42_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a Minimum Circuit in a Graph. Siam Journal of Computing\u00a07(4), 413\u2013423 (1978)","journal-title":"Siam Journal of Computing"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S. Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized Complexity of Finding Subgraphs with Hereditary Properties. Theoretical Computer Science\u00a0289, 997\u20131008 (2002)","journal-title":"Theoretical Computer Science"},{"key":"42_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above Guaranteed Values: MaxSat and MaxCut. Journal of Algorithms\u00a031, 335\u2013354 (1999)","journal-title":"Journal of Algorithms"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient Fixed Parameter Algorithm for 3-Hitting Set. Journal of Discrete Algorithms\u00a02(1) (2001)","DOI":"10.1016\/S1570-8667(03)00009-1"},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.4153\/CJM-1982-036-8","volume":"34","author":"S. Poljak","year":"1982","unstructured":"Poljak, S., Turzik, D.: A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem. Canad. J. Math.\u00a034(3), 519\u2013524 (1982)","journal-title":"Canad. J. Math."},{"key":"42_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-36136-7_22","volume-title":"Algorithms and Computation","author":"V. Raman","year":"2002","unstructured":"Raman, V., Saurabh, S., Subramanian, C.R.: Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set\u2019. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 241\u2013248. Springer, Heidelberg (2002)"},{"key":"42_CR12","series-title":"Lecture Notes in Computer Science","first-page":"218","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Speckenmeyer","year":"1989","unstructured":"Speckenmeyer, E.: On Feedback Problems in Digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 218\u2013231. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:06:07Z","timestamp":1552597567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}