{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:01Z","timestamp":1725566221633},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_23","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"260-270","source":"Crossref","is-referenced-by-count":3,"title":["Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raman","sequence":"first","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","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)"},{"issue":"3","key":"23_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/jgt.3190040311","volume":"4","author":"J.C. Bermond","year":"1980","unstructured":"Bermond, J.C., Germa, A., Heydemann, M.C., Sotteau, D.: Girth in Digraphs. Journal of Graph theory\u00a04(3), 337\u2013341 (1980)","journal-title":"Journal of Graph theory"},{"issue":"4","key":"23_CR3","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/S0022-0000(03)00074-6","volume":"67","author":"L. Cai","year":"2003","unstructured":"Cai, L., Juedes, D.: On the Existence of Subexponential Parameterized Algorithms. Journal of Computer and System Sciences\u00a067(4), 789\u2013807 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR4","volume-title":"\u2018Parameterized Complexity\u2019","author":"R. Downey","year":"1998","unstructured":"Downey, R., Fellows, M.R.: \u2018Parameterized Complexity\u2019. Springer, Heidelberg (1998)"},{"key":"23_CR5","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank Aggregation Revisited, WWW10; selected as Web Search Area highlight (2001)"},{"key":"23_CR6","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":"23_CR7","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":"23_CR8","first-page":"53","volume":"145","author":"D.A. Narayan","year":"2000","unstructured":"Narayan, D.A.: The Reversing Number of a Digraph; A Disjoint Union of Directed Stars. Congressus Numerantium\u00a0145, 53\u201364 (2000)","journal-title":"Congressus Numerantium"},{"key":"23_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"},{"key":"23_CR10","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. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 241\u2013248. Springer, Heidelberg (2002)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-45078-8_42","volume-title":"Algorithms and Data Structures","author":"V. Raman","year":"2003","unstructured":"Raman, V., Saurabh, S.: Parameterized Complexity of Directed Feedback Set Problems in Tournaments. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 484\u2013492. Springer, Heidelberg (2003)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-52292-1_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Speckenmeyer","year":"1990","unstructured":"Speckenmeyer, E.: On Feedback Problems in Digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 218\u2013231. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:58Z","timestamp":1620012598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}