{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:44Z","timestamp":1725677624142},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_33","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"359-367","source":"Crossref","is-referenced-by-count":3,"title":["Partial Degree Bounded Edge Packing Problem"],"prefix":"10.1007","author":[{"given":"Peng","family":"Zhang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Bu, T.M., Yuan, C., Zhang, P.: Computing on Binary Strings. In: arXiv:1112.0278v2 (2012)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","volume":"14","author":"J. Nieminen","year":"1974","unstructured":"Nieminen, J.: Two bounds for the domination number of a graph. Journal of the Institute of Mathematics and its Applications\u00a014, 183\u2013187 (1974)","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: nonblocker: Parameterized Algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 237\u2013245. Springer, Heidelberg (2006)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.: Graph minors. iii. planar tree-width. Journal of Combinatorial Theory, Series B\u00a036(1), 49\u201364 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second order theory of graphs i: Recognisable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:34:27Z","timestamp":1558312467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}