{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T06:36:08Z","timestamp":1770532568992,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T00:00:00Z","timestamp":1368748800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10878-013-9629-5","type":"journal-article","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T11:37:28Z","timestamp":1368704248000},"page":"847-858","source":"Crossref","is-referenced-by-count":5,"title":["Parameterizations of hitting set of bundles and inverse scope"],"prefix":"10.1007","volume":"29","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,17]]},"reference":[{"key":"9629_CR1","doi-asserted-by":"crossref","first-page":"2474","DOI":"10.1093\/bioinformatics\/bts423","volume":"28","author":"V Acuna","year":"2012","unstructured":"Acuna V, Vieira Milreu P (2012) Algorithms and complexity of enumerating minimal precursor sets in genome-wide metabolic networks. Bioinformatics 28:2474\u20132483","journal-title":"Bioinformatics"},{"key":"9629_CR2","doi-asserted-by":"crossref","first-page":"4534","DOI":"10.1016\/j.tcs.2009.08.017","volume":"410","author":"E Angel","year":"2009","unstructured":"Angel E, Bampis E, Gourv\u00e8s L (2009) On the minimum hitting set of bundles problem. Theor Comp Sci 410:4534\u20134542","journal-title":"Theor Comp Sci"},{"key":"9629_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2010.09.007","volume":"8","author":"O Ben-Zwi","year":"2011","unstructured":"Ben-Zwi O, Hermelin D, Lokshtanov D, Newman I (2011) Treewidth governs the complexity of target set selection. Discret Optim 8:87\u201396","journal-title":"Discret Optim"},{"key":"9629_CR4","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/S0022-0000(03)00073-4","volume":"67","author":"M Cesati","year":"2003","unstructured":"Cesati M (2003) The Turing way to parameterized complexity. J Comp Syst Sci 67:654\u2013685","journal-title":"J Comp Syst Sci"},{"key":"9629_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.tcs.2005.10.004","volume":"351","author":"P Damaschke","year":"2006","unstructured":"Damaschke P (2006) Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor Comp Sci 351:337\u2013350","journal-title":"Theor Comp Sci"},{"key":"9629_CR6","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/s10878-009-9234-9","volume":"18","author":"P Damaschke","year":"2009","unstructured":"Damaschke P (2009) Multiple hypernode hitting sets and smallest two-cores with targets. J Comb Optim 18:294\u2013306","journal-title":"J Comb Optim"},{"key":"9629_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity. Springer, Heidelberg"},{"key":"9629_CR8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00224-008-9138-6","volume":"46","author":"MR Fellows","year":"2010","unstructured":"Fellows MR, Flum J, Hermelin D, M\u00fcller M, Rosamond FA (2010) W-hierarchies defined by symmetric gates. Theor Comp Syst 46:311\u2013339","journal-title":"Theor Comp Syst"},{"key":"9629_CR9","doi-asserted-by":"crossref","first-page":"3157","DOI":"10.1080\/00207160903176868","volume":"87","author":"H Fernau","year":"2010","unstructured":"Fernau H (2010a) Parameterized algorithmics for d-hitting set. Int J Comput Math 87:3157\u20133174","journal-title":"Int J Comput Math"},{"key":"9629_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00453-008-9199-6","volume":"57","author":"H Fernau","year":"2010","unstructured":"Fernau H (2010b) A top-down approach to search-trees: improved algorithmics for 3-hitting set. Algorithmica 57:97\u2013118","journal-title":"Algorithmica"},{"key":"9629_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms. Oxford lecture series in mathematics and its applications","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier R (2006) Invitation to fixed-parameter algorithms. Oxford lecture series in mathematics and its applications. Oxford University Press, Oxford"},{"key":"9629_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier R, Rossmanith P (2003) An efficient fixed-parameter algorithm for 3-hitting set. J Discret Algorithm 1:89\u2013102","journal-title":"J Discret Algorithm"},{"key":"9629_CR13","first-page":"99","volume-title":"WABI 2008, LNCS 5251","author":"Z Nikoloski","year":"2008","unstructured":"Nikoloski Z, Grimbs S, Selbig J, Ebenh\u00f6h O (2008) Hardness and approximability of the inverse scope problem. In: Crandall KA, Lagergren J (eds) WABI 2008, LNCS 5251. Springer, Heidelberg, pp 99\u2013112"},{"key":"9629_CR14","unstructured":"Wahlstr\u00f6m M (2007) Algorithms, measures, and upper bounds for satisfiability and related problems, Dissertation 1079, Link\u00f6ping Studies in Science and Technology."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9629-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9629-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9629-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:21Z","timestamp":1559276601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9629-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,17]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9629"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9629-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,17]]}}}