{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:01:47Z","timestamp":1725678107172},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_53","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"572-583","source":"Crossref","is-referenced-by-count":2,"title":["FPT Results for Signed Domination"],"prefix":"10.1007","author":[{"given":"Ying","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"crossref","unstructured":"Dunbar, J., Hedetniemi, S., Henning, M., Slater, P.: Signed domination in graphs. Graph Theory, Combinatorics and Applications, 311\u2013322 (1995)","DOI":"10.1016\/0012-365X(94)00329-H"},{"key":"53_CR2","first-page":"101","volume":"12","author":"J. Hattingh","year":"1995","unstructured":"Hattingh, J., Henning, M., Slater, P.: The algorithmic complexity of signed domination in graphs. Australasian Journal of Combinatorics\u00a012, 101\u2013112 (1995)","journal-title":"Australasian Journal of Combinatorics"},{"key":"53_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disc.2004.01.007","volume":"283","author":"R. Hass","year":"2004","unstructured":"Hass, R., Wexler, T.: Signed domination numbers of a graph and its complement. Discrete Math.\u00a0283, 87\u201392 (2004)","journal-title":"Discrete Math."},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1013782511179","volume":"51","author":"B. Zelinka","year":"2001","unstructured":"Zelinka, B.: Signed total domination number of a graph. Czechoslovak Math.\u00a051, 225\u2013229 (2001)","journal-title":"Czechoslovak Math."},{"key":"53_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s004930070034","volume":"20","author":"J. Matousek","year":"2000","unstructured":"Matousek, J.: On the signed domination in graphs. Combinatorica\u00a020, 103\u2013108 (2000)","journal-title":"Combinatorica"},{"key":"53_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors X. Obstructions to tree decomposition. J. of Combinatorial Theory, Series B\u00a052, 153\u2013190 (1991)","journal-title":"J. of Combinatorial Theory, Series B"},{"key":"53_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0012-365X(98)00189-7","volume":"195","author":"Z. Zhang","year":"1999","unstructured":"Zhang, Z., Xu, B., Li, Y., Liu, L.: A note on the lower bounds of signed domination number of a graph. Discrete Math.\u00a0195, 295\u2013298 (1999)","journal-title":"Discrete Math."},{"key":"53_CR8","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."},{"key":"53_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Treewidth: Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"},{"key":"53_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0029946","volume-title":"Mathematical Foundations of Computer Science 1997","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L.: Treewidth: Algorithmic Techniques and Results. In: Privara, I., Ru\u017ei\u010dka, P. (eds.) MFCS 1997. LNCS, vol.\u00a01295, pp. 19\u201336. Springer, Heidelberg (1997)"},{"key":"53_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0012-365X(96)00025-8","volume":"158","author":"M.A. Henning","year":"1996","unstructured":"Henning, M.A., Slater, P.J.: Irregularities relating domination parameters in cubic graphs. Discrete Mathematics\u00a0158, 87\u201398 (1996)","journal-title":"Discrete Mathematics"},{"key":"53_CR12","first-page":"263","volume":"43","author":"M.A. Henning","year":"1996","unstructured":"Henning, M.A.: Domination in regular graphs. Ars Combinatoria\u00a043, 263\u2013271 (1996)","journal-title":"Ars Combinatoria"},{"issue":"3","key":"53_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0895480103433410","volume":"18","author":"E.D. Demaine","year":"2004","unstructured":"Demaine, E.D., Fomin, F.V., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Disc. Math.\u00a018(3), 501\u2013511 (2004)","journal-title":"SIAM J. Disc. Math."},{"key":"53_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fellows, M., Niedermeier, R.: Polynomial time data reduction for dominating set. J. ACM\u00a051, 363\u2013384 (2004)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:23:06Z","timestamp":1620127386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}