{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:50Z","timestamp":1725558650852},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/10692760_2","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T16:35:37Z","timestamp":1277915737000},"page":"17-25","source":"Crossref","is-referenced-by-count":1,"title":["Minus Domination in Small-Degree Graphs"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/3-540-60220-8_84","volume-title":"Algorithms and Data Structures","author":"P. Berman","year":"1995","unstructured":"Berman, P., Fujito, T.: On approximation properties of the independent set problem for degree 3 graphs. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 449\u2013460. Springer, Heidelberg (1995)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-57568-5_282","volume-title":"Algorithms and Computation","author":"G.J. Chang","year":"1993","unstructured":"Chang, G.J., Pandu Rangan, C., Coorg, S.R.: Weighted independent perfect domination on cocomparability graphs. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 506\u2013515. Springer, Heidelberg (1993)"},{"key":"2_CR3","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.T., Henning, M.A., McRae, A.: The algorithmic complexity of minus domination in graphs. Discrete Applied Math.\u00a068, 73\u201384 (1996)","journal-title":"Discrete Applied Math."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(94)00329-H","volume":"149","author":"J. Dunbar","year":"1996","unstructured":"Dunbar, J., Hedetniemi, S.T., Henning, M.A., McRae, A.: Minus domination in regular graphs. Discrete Math.\u00a0149, 311\u2013312 (1996)","journal-title":"Discrete Math."},{"key":"2_CR5","unstructured":"Dunbar, J., Hedetniemi, S.T., Henning, M.A., McRae, A.: Minus domination in graphs. Discrete Math. (to submitted)"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Dunbar, J., Hedetniemi, S.T., Henning, M.A., Slater, P.J.: Signed domination in graphs. Graph Theory, Combinatorics and Applications, 311\u2013322 (1995)","DOI":"10.1016\/0012-365X(94)00329-H"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0012-365X(96)00026-X","volume":"158","author":"O. Favaron","year":"1996","unstructured":"Favaron, O.: Signed domination in regular graphs. Discrete Math.\u00a0158, 287\u2013293 (1996)","journal-title":"Discrete Math."},{"volume-title":"Computers and Intractability - a Guide to the Theory of NP-Completeness","year":"1979","author":"M.R. Garey","key":"2_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability - a Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1006\/jagm.1993.1006","volume":"14","author":"P. Hell","year":"1993","unstructured":"Hell, P., Kirkpatrick, D.G.: Algorithms for degree constrained graph factors of minimum deficiency. J. Algorithms\u00a014, 115\u2013138 (1993)","journal-title":"J. Algorithms"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Natanzon, A., Shamir, R., Sharon, R.: A polynomial approximation algorithm for the minimum fill-in problem. In: 30th ACM STOC 1998, pp. 41\u201347 (1998)","DOI":"10.1145\/276698.276710"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comp. System Sc.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comp. System Sc."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10692760_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:40:03Z","timestamp":1578537603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692760_2"}},"subtitle":["(Extended abstract)"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/10692760_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}
