{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:04:39Z","timestamp":1750161879773},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_55","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"611-622","source":"Crossref","is-referenced-by-count":7,"title":["Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Fleischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liwei","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: On linear time minor tests with depth first search. Journal of Algorithms\u00a014, 1\u201323 (1993)","journal-title":"Journal of Algorithms"},{"key":"55_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-79723-4_16","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2008","unstructured":"Bodlaender, H.L., Penninkx, E.: A linear kernel for planar feedback vertex set. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 160\u2013171. Springer, Heidelberg (2008)"},{"key":"55_CR3","unstructured":"Chatrand, G., Lesniak, L.: Graphs & Digraphs, 2nd edn. The Wadsworth and Brooks\/Cole Mathematics Series (1986)"},{"issue":"5","key":"55_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411511","volume":"55","author":"J. Chen","year":"2008","unstructured":"Chen, J., Liu, Y., Lu, S., Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM\u00a055(5), 1\u201319 (2008)","journal-title":"Journal of the ACM"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: basic results. SIAM Journal on Computing\u00a024, 873\u2013921 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"55_CR6","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, Heidelberg (1999)"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J., Schieber, B.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"55_CR8","unstructured":"Fleischer, R., Xi, W., Yuan, L.: DFVS Project (2009), http:\/\/www.tcs.fudan.edu.cn\/rudolf\/Projects\/DFVS\/dfvs.html"},{"issue":"51","key":"55_CR9","first-page":"7","volume":"1","author":"F. Huffner","year":"2008","unstructured":"Huffner, F., Niedermeier, R., Wernicke, S.: Techniques for practical fixed-parameter algorithms. The Computer Journal\u00a01(51), 7\u201325 (2008)","journal-title":"The Computer Journal"},{"key":"55_CR10","unstructured":"Jula, H., Tralamazza, D.M., Zamfir, C., Candea, G.: Deadlock immunity: Enabling systems to defend against deadlocks. In: Proceedings of the 8th USENIX Symposium on Operating System Design and Implementation (OSDI 2008), pp. 295\u2013308 (2008)"},{"issue":"5","key":"55_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF00137392","volume":"1","author":"A. Kunzamann","year":"1990","unstructured":"Kunzamann, A., Wunderlich, H.J.: An analytical approach to the partial scan problem. Journal of Electronic Tesing: Theory and Applications\u00a01(5), 163\u20131741 (1990)","journal-title":"Journal of Electronic Tesing: Theory and Applications"},{"key":"55_CR12","unstructured":"LEDA: A library of the data types and algorithms of combinatorial computing, http:\/\/www.mpi-inf.mpg.de\/LEDA\/"},{"key":"55_CR13","unstructured":"Melancon, G., Dutour, I., Bousquet-Melou, M.: Random generation of directed acyclic graphs. Technical report, CWI Amsterdam (2006), http:\/\/www.cwi.nl\/InfoVisu"},{"key":"55_CR14","unstructured":"Seidl, H.: Personal communication (2000)"},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"Thomasse, S.: A quadratic kernel for feedback vertex set. In: Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 115\u2013119 (2009)","DOI":"10.1137\/1.9781611973068.13"},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Wang, C.-C., Lloyd, E.L., Soffa, M.L.: Feedback vertex sets and cyclically reducible graphs. Journal of the ACM\u00a032(2), 2960\u20132913 (1985)","DOI":"10.1145\/3149.3159"},{"key":"55_CR17","doi-asserted-by":"crossref","unstructured":"Wilson, D.B.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the 28th ACM Symposium on the Theory of Computation (STOC 1996), pp. 296\u2013303 (1996)","DOI":"10.1145\/237814.237880"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:04Z","timestamp":1558524124000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}