{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:14:41Z","timestamp":1754482481837},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_54","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"604-615","source":"Crossref","is-referenced-by-count":5,"title":["New Parameterized Algorithms for the Edge Dominating Set Problem"],"prefix":"10.1007","author":[{"given":"Mingyu","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-17493-3_6","volume-title":"Parameterized and Exact Computation","author":"D. Binkele-Raible","year":"2010","unstructured":"Binkele-Raible, D., Fernau, H.: Enumerate and measure: Improving parameter budget management. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 38\u201349. Springer, Heidelberg (2010)"},{"key":"54_CR2","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/j.tcs.2008.12.036","volume":"410","author":"J. Cardinal","year":"2009","unstructured":"Cardinal, J., Langerman, S., Levy, E.: Improved approximation bounds for edge dominating set in dense graphs. Theor. Comput. Sci.\u00a0410, 949\u2013957 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"54_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11847250_13","volume-title":"Parameterized and Exact Computation","author":"H. Fernau","year":"2006","unstructured":"Fernau, H.: Edge dominating set: Efficient Enumeration-Based Exact Algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 142\u2013153. Springer, Heidelberg (2006)"},{"issue":"2","key":"54_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s00453-007-9133-3","volume":"54","author":"F. Fomin","year":"2009","unstructured":"Fomin, F., Gaspers, S., Saurabh, S., Stepanov, A.: On two techniques of combining branching and treewidth. Algorithmica\u00a054(2), 181\u2013207 (2009)","journal-title":"Algorithmica"},{"issue":"3","key":"54_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0166-218X(00)00383-8","volume":"118","author":"T. Fujito","year":"2002","unstructured":"Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics\u00a0118(3), 19\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"54_CR6","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)"},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D. Johnson","year":"1988","unstructured":"Johnson, D., Yannakakis, M., Papadimitriou, C.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math.\u00a03, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"54_CR9","unstructured":"Prieto, E.: Systematic kernelization in FPT algorithm design. PhD-thesis, The University of Newcastle, Australia (2005)"},{"key":"54_CR10","unstructured":"Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set. Technical Report zaik 2005-501, Universit\u00e4t zu K\u00f6ln, Germany (2005)"},{"issue":"3","key":"54_CR11","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00224-007-1334-2","volume":"42","author":"V. Raman","year":"2007","unstructured":"Raman, V., Saurabh, S., Sikdar, S.: Efficient exact algorithms through enumerating maximal independent sets and other techniques. Theory of Computing Systems\u00a042(3), 563\u2013587 (2007)","journal-title":"Theory of Computing Systems"},{"key":"54_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-79723-4_20","volume-title":"Parameterized and Exact Computation","author":"J.M.M. Rooij van","year":"2008","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact Algorithms for Edge Domination. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 214\u2013225. Springer, Heidelberg (2008)"},{"key":"54_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-11440-3_26","volume-title":"WALCOM: Algorithms and Computation","author":"M. Xiao","year":"2010","unstructured":"Xiao, M.: A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 281\u2013292. Springer, Heidelberg (2010)"},{"key":"#cr-split#-54_CR14.1","doi-asserted-by":"crossref","unstructured":"Xiao, M., Nagamochi, H.: Exact algorithms for annotated edge dominating set in cubic graphs. TR 2011-009. Kyoto University (2011);","DOI":"10.1007\/978-3-642-21204-8_14"},{"key":"#cr-split#-54_CR14.2","doi-asserted-by":"crossref","unstructured":"A preliminary version appeared as: Xiao, M.: Exact and parameterized algorithms for edge dominating set in 3-degree graphs. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.??6509, pp. 387???400. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-17461-2_31"},{"key":"54_CR15","series-title":"LNCS","first-page":"100","volume-title":"Proceedings FAW-AAIM","author":"M. Xiao","year":"2011","unstructured":"Xiao, M., Nagamochi, H.: Parameterized edge dominating set in cubic graphs. In: Proceedings FAW-AAIM. LNCS, vol.\u00a06681, pp. 100\u2013112. Springer, Heidelberg (2011)"},{"issue":"3","key":"54_CR16","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math.\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:19Z","timestamp":1606187419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}