{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:13Z","timestamp":1759637893597},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_32","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"332-343","source":"Crossref","is-referenced-by-count":11,"title":["Parameterized Algorithms for Hitting Set: The Weighted Case"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"Journal of Algorithms"},{"key":"32_CR2","doi-asserted-by":"crossref","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":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45848-4_1","volume-title":"Graph Drawing","author":"V. Dujmovi\u0107","year":"2002","unstructured":"Dujmovi\u0107, V., Fellows, M.R., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to two-layer planarization. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 1\u201315. Springer, Heidelberg (2002)"},{"key":"32_CR4","unstructured":"Eppstein, D.: Quasiconvex analysis of backtracking algorithms. In: Proc. 15th Symp. Discrete Algorithms SODA, January 2004, pp. 781\u2013790. ACM and SIAM (2004)"},{"key":"32_CR5","unstructured":"Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-Hitting Set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity ECCC (2004)"},{"key":"#cr-split#-32_CR6.1","unstructured":"Fernau, H.: Parameterized algorithmics for linear arrangement problems. In: Faigle, U. (ed.) CTW 2005: Workshop on Graphs and Combinatorial Optimization, pp. 27???31. University of Cologne, Germany (2005);"},{"key":"#cr-split#-32_CR6.2","unstructured":"Long version submitted to a special issue of Discrete Applied Mathematics"},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.7155\/jgaa.00106","volume":"9","author":"H. Fernau","year":"2005","unstructured":"Fernau, H.: Two-layer planarization: Improving on parameterized algorithmics. Journal of Graph Algorithms and Applications\u00a09, 205\u2013238 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11590156_37","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"H. Fernau","year":"2005","unstructured":"Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 457\u2013469. Springer, Heidelberg (2005)"},{"key":"32_CR9","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.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and conquer: domination \u2013 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":"32_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0004-3702(92)90027-U","volume":"56","author":"J. Kleer de","year":"1992","unstructured":"de Kleer, J., Mackworth, A.K., Reiter, R.: Characterizing diagnoses and systems. Artificial Intelligence\u00a056, 197\u2013222 (1992)","journal-title":"Artificial Intelligence"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms\u00a01, 89\u2013102 (2003)","journal-title":"Journal of Discrete Algorithms"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed parameter algorithms for weighted vertex cover. Journal of Algorithms\u00a047, 63\u201377 (2003)","journal-title":"Journal of Algorithms"},{"key":"32_CR13","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":"32_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence\u00a032, 57\u201395 (1987)","journal-title":"Artificial Intelligence"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jalgor.2004.01.001","volume":"51","author":"M. Wahlstr\u00f6m","year":"2004","unstructured":"Wahlstr\u00f6m, M.: Exact algorithms for finding minimum transversals in rank-3 hypergraphs. Journal of Algorithms\u00a051, 107\u2013121 (2004)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:27Z","timestamp":1619507067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11758471_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}