{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:12:50Z","timestamp":1649023970390},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,5,29]],"date-time":"2009-05-29T00:00:00Z","timestamp":1243555200000},"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":[[2009,10]]},"DOI":"10.1007\/s10878-009-9234-9","type":"journal-article","created":{"date-parts":[[2009,5,28]],"date-time":"2009-05-28T18:24:02Z","timestamp":1243535042000},"page":"294-306","source":"Crossref","is-referenced-by-count":2,"title":["Multiple hypernode hitting sets and smallest two-cores with targets"],"prefix":"10.1007","volume":"18","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,29]]},"reference":[{"key":"9234_CR1","series-title":"LNCS","first-page":"13","volume-title":"3rd int workshop on parameterized and exact computation, IWPEC 2008","author":"O Amini","year":"2008","unstructured":"Amini O, Sau I, Saurabh S (2008) Parameterized complexity of the smallest degree-constrained subgraph problem. In: 3rd int workshop on parameterized and exact computation, IWPEC 2008. LNCS, vol\u00a05018. Springer, Berlin, pp 13\u201329"},{"key":"9234_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader GD, Hogue CWV (2003) An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4:2","journal-title":"BMC Bioinformatics"},{"key":"9234_CR3","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, Berlin"},{"key":"9234_CR4","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S Dreyfus","year":"1971","unstructured":"Dreyfus S, Wagner R (1971) The Steiner problem in graphs. Networks 1:195\u2013207","journal-title":"Networks"},{"key":"9234_CR5","doi-asserted-by":"crossref","first-page":"2035","DOI":"10.1016\/j.dam.2007.04.017","volume":"156","author":"T Eiter","year":"2008","unstructured":"Eiter T, Makino K, Gottlob G (2008) Computational aspects of monotone dualization: a brief survey. Discrete Appl Math 156:2035\u20132049","journal-title":"Discrete Appl Math"},{"key":"9234_CR6","series-title":"LNCS","first-page":"91","volume-title":"3rd int workshop on parameterized and exact computation, IWPEC 2008","author":"K Elbassioni","year":"2008","unstructured":"Elbassioni K, Hagen M, Rauf I (2008) Some fixed-parameter tractable classes of hypergraph duality and related problems. In: 3rd int workshop on parameterized and exact computation, IWPEC 2008. LNCS, vol\u00a05018. Springer, Berlin, pp 91\u2013102"},{"key":"9234_CR7","series-title":"LNCS","first-page":"332","volume-title":"6th Italian conf on algorithms and complexity, CIAC 2006","author":"H Fernau","year":"2006","unstructured":"Fernau H (2006) Parameterized algorithms for hitting set: the weighted case. In: 6th Italian conf on algorithms and complexity, CIAC 2006. LNCS, vol\u00a03998. Springer, Berlin, pp 332\u2013343"},{"key":"9234_CR8","series-title":"LNCS","first-page":"245","volume-title":"30th int workshop on graph-theoretic concepts in computer science, WG 2004","author":"FV Fomin","year":"2004","unstructured":"Fomin FV, Kratsch D, Woeginger GJ (2004) Exact (exponential) algorithms for the dominating set problem. In: 30th int workshop on graph-theoretic concepts in computer science, WG 2004. LNCS, vol\u00a03353. Springer, Berlin, pp 245\u2013256"},{"key":"9234_CR9","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.tcs.2005.10.021","volume":"351","author":"R Haas","year":"2006","unstructured":"Haas R, Hoffmann M (2006) Chordless paths through three vertices. Theor Comput Sci 351:360\u2013371","journal-title":"Theor Comput Sci"},{"key":"9234_CR10","series-title":"Oxford lecture series in mathematics and its applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9234-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9234-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9234-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:14Z","timestamp":1559276294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9234-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,29]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9234"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9234-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,29]]}}}