{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:45:20Z","timestamp":1769157920006,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540357537","type":"print"},{"value":"9783540357551","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_17","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"160-171","source":"Crossref","is-referenced-by-count":41,"title":["Exact Computation of Maximum Induced Forest"],"prefix":"10.1007","author":[{"given":"Igor","family":"Razgon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J. Byskov","year":"2004","unstructured":"Byskov, J.: Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters\u00a032(6), 547\u2013556 (2004)","journal-title":"Operations Research Letters"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(01)00174-8","volume":"289","author":"E. Dantsin","year":"2002","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Sch\u00f6ning, U.: A deterministic (2-2\/(k+1))\n                    n\n                   algorithm for k-sat based on local search. Theor. Comput. Sci.\u00a0289(1), 69\u201383 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR3","unstructured":"Eppstein, D.: Improved algorithms for 3-coloring, 3-edge coloring and constraint satisfaction. In: SODA 2001, pp. 329\u2013337 (2001)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Measure and conquer: Domination - a case study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"key":"17_CR5","first-page":"47","volume":"87","author":"F. Fomin","year":"2005","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS\u00a087, 47\u201377 (2005)","journal-title":"Bulletin of the EATCS"},{"key":"17_CR6","unstructured":"Fomin, F., Pyatkin, A.: Finding minimum feedback vertex set in bipartite graphs. Report N 291, Department of Informatics, University of Bergen (2005)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/11560586_30","volume-title":"Theoretical Computer Science","author":"V. Raman","year":"2005","unstructured":"Raman, V., Saurabh, S., Sikdar, S.: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol.\u00a03701, pp. 375\u2013389. Springer, Heidelberg (2005)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"J. Robson","year":"1986","unstructured":"Robson, J.: Algorithms for maximum independent sets. Journal of Algorithms\u00a07, 425\u2013440 (1986)","journal-title":"Journal of Algorithms"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka, You Shrink!","author":"G. Woeginger","year":"2003","unstructured":"Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol.\u00a02570, pp. 185\u2013207. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:14Z","timestamp":1619507954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11785293_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}