{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:59Z","timestamp":1725512099053},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_16","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"182-191","source":"Crossref","is-referenced-by-count":1,"title":["Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity"],"prefix":"10.1007","author":[{"given":"Petr","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74839-7_1","volume-title":"Graph-theoretic Concepts in Computer Science, Proceedings WG 2007","author":"P. Golovach","year":"2007","unstructured":"Golovach, P., Kratochvil, J.: Computational complexity of generalized domination: A complete dichotomy for chordal graphs. In: Brandstaedt, A., Kratsch, D., M\u00fcller, H. (eds.) Graph-theoretic Concepts in Computer Science, Proceedings WG 2007. LNCS, vol.\u00a04769, pp. 1\u201311. Springer, Heidelberg (2007)"},{"key":"16_CR2","first-page":"173","volume":"5","author":"P. Heggernes","year":"1998","unstructured":"Heggernes, P., Telle, J.A.: Partitioning graphs into generalized dominating sets. Nordic J. Comput.\u00a05, 173\u2013195 (1998)","journal-title":"Nordic J. Comput."},{"key":"16_CR3","first-page":"41","volume":"2","author":"J. Kratochv\u00ed","year":"1995","unstructured":"Kratochv\u00ed, J., Manuel, P., Miller, M.: Generalized domination in chordal graphs. Nordic Journal of Computing\u00a02, 41\u201350 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"16_CR4","first-page":"157","volume":"1","author":"J.A. Telle","year":"1994","unstructured":"Telle, J.A.: Complexity of domination-type problems in graphs. Nordic Journal of Computing\u00a01, 157\u2013171 (1994)","journal-title":"Nordic Journal of Computing"},{"unstructured":"Telle, J.A.: Vertex partitioning problems: characterization, complexity and algorithms on partial k-trees, Ph. D tesisis, Department of Computer Science, Universiy of Oregon, Eugene (1994)","key":"16_CR5"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1137\/S0895480194275825","volume":"10","author":"J.A. Telle","year":"1997","unstructured":"Telle, J.A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial k-trees. SIAM J. Discrete Math.\u00a010, 529\u2013550 (1997)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:11Z","timestamp":1619522051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_16","relation":{},"subject":[]}}