{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:29:10Z","timestamp":1742912950474,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_27","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"337-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithmic Aspect of Minus Domination on Small-Degree Graphs"],"prefix":"10.1007","author":[{"given":"Jin-Yong","family":"Lin","sequence":"first","affiliation":[]},{"given":"Ching-Hao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Proc. 3rd Italian Conference on Algorithms and Complexity (CIAC), pp. 288\u2013298 (1997)","DOI":"10.1007\/3-540-62592-5_80"},{"issue":"1\u20132","key":"27_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0166-218X(00)00219-5","volume":"108","author":"P Damaschke","year":"2001","unstructured":"Damaschke, P.: Minus domination in small-degree graphs. Discrete Applied Mathematics 108(1\u20132), 53\u201364 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity, 3rd edn. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1\u20132","key":"27_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0166-218X(95)00056-W","volume":"68","author":"J Dunbar","year":"1996","unstructured":"Dunbar, J., Goddard, W., Hedetniemi, S., McRae, A., Henning, M.A.: The algorithmic complexity of minus domination in graphs. Discrete Applied Mathematics 68(1\u20132), 73\u201384 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20133","key":"27_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0012-365X(98)00284-2","volume":"199","author":"J Dunbar","year":"1999","unstructured":"Dunbar, J., Hedetniemi, S., McRae, A., Henning, M.A.: Minus domination in graphs. Discrete Applied Mathematics 199(1\u20133), 35\u201347 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-03780-6_16","volume-title":"Combinatorial Optimization and Applications","author":"L Faria","year":"2013","unstructured":"Faria, L., Hon, W.-K., Kloks, T., Liu, H.-H., Wang, T.-M., Wang, Y.-L.: On complexities of minus domination. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 178\u2013189. Springer, Heidelberg (2013)"},{"issue":"2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing 11(2), 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-29952-0_53","volume-title":"Theory and Applications of Models of Computation","author":"Y Zheng","year":"2012","unstructured":"Zheng, Y., Wang, J., Feng, Q., Chen, J.: FPT results for signed domination. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol. 7287, pp. 572\u2013583. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:32:09Z","timestamp":1674567129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}