{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:40Z","timestamp":1725534100336},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_25","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T05:17:47Z","timestamp":1245388667000},"page":"237-250","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set"],"prefix":"10.1007","author":[{"given":"Jianxin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Beiwei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Randerath, B., Schiermeyer, I.: Exact algorithms for minimum dominating set, Technical Report, TCologne: Zentrum fur Angewandte Informatik (2005)"},{"issue":"3","key":"25_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s00224-007-1334-2","volume":"41","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\u00a041(3), 563\u2013587 (2007)","journal-title":"Theory of Computing Systems"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S.: Branching and treewidth based exact algorithms. In: Proceedings of the 17th International Symposium on Algorithms and Computation, pp. 16\u201325 (2006)","DOI":"10.1007\/11940128_4"},{"key":"25_CR4","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact Algorithms for Edge Domination. Technical Report UU-CS-2007-051, Netherlands: Dept. of Information and Computing Sciences Utrecht University (2007)"},{"key":"25_CR5","unstructured":"Parekh, O.: Edge domination and hypomatchable sets. In: Proceedings of the SODA, pp. 287\u2013291 (2002)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Fernau, H.: Edge dominating set: efficient enumeration-based exact algorithms. In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, pp. 142\u2013153 (2006)","DOI":"10.1007\/11847250_13"},{"key":"25_CR7","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On two techniques of combining branching and treewidth. Technical Report No. 337, Norway: Dept. of Informatics, University of Bergen (2006)"},{"key":"25_CR8","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/3-540-48194-X_23","volume-title":"Combinatorial Pattern Matching","author":"J. Gramm","year":"2001","unstructured":"Gramm, J., Niedermeier, R.: Quartet inconsistency is fixed parameter tractable. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 241\u2013256. Springer, Heidelberg (2001)"},{"key":"25_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11415770_1","volume-title":"Research in Computational Molecular Biology","author":"J. Scott","year":"2005","unstructured":"Scott, J., Ideker, T., Karp, R., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a03500, pp. 1\u201313. Springer, Heidelberg (2005)"},{"key":"25_CR11","unstructured":"Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pp. 269\u2013278 (2000)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Chen, J., Kanj, I.A., Meng, J., Xia, G., Zhang, F.: On effective enumerability of NP problems. In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, pp. 215\u2013226 (2006)","DOI":"10.1007\/11847250_20"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-28639-4_1","volume-title":"Parameterized and Exact Computation","author":"P. Damaschke","year":"2004","unstructured":"Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 1\u201312. Springer, Heidelberg (2004)"},{"issue":"22","key":"25_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(87)90017-5","volume":"18","author":"R. Chegireddy","year":"1987","unstructured":"Chegireddy, R., Hamacher, W.: Algorithms for finding K-best perfect matchings. Discrete applied mathematics\u00a018(22), 155\u2013165 (1987)","journal-title":"Discrete applied mathematics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T21:43:38Z","timestamp":1552081418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}