{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:55:09Z","timestamp":1725555309516},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_4","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["An Exact Algorithm for Connected Red-Blue Dominating Set"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[]},{"given":"Amer E.","family":"Mouawad","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/0-387-23830-1_8","volume-title":"Handbook of Combinatorial Optimization","author":"J. Blum","year":"2005","unstructured":"Blum, J., Ding, M., Thaeler, A., Cheng, X.: Connected dominating set in sensor networks and manets. In: Handbook of Combinatorial Optimization, vol.\u00a0B(suppl.), pp. 329\u2013369. Springer, New York (2005)"},{"key":"4_CR2","unstructured":"Navid, I.: Data reduction for connected dominating set. Master Thesis, Simon Fraser University (2005)"},{"key":"4_CR3","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1990","unstructured":"Garey, M., Johnson, D.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"4_CR4","first-page":"95","volume-title":"Proceedings of the 13th Annual European Symposium on Algorithms ESA","author":"F. Dorn","year":"2005","unstructured":"Dorn, F., Penninkx, E., Bodlaender, H., Fomin, F.: Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In: Proceedings of the 13th Annual European Symposium on Algorithms ESA, pp. 95\u2013106. Springer, Heidelberg (2005)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R., Fellows, M., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. Series in Discrete Mathematics and Theoretical Computer Science DIMACS, pp. 49\u201399 (1997)","DOI":"10.1090\/dimacs\/049\/04"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Raible, D., Rossmanith, P.: An exact algorithm for the maximum leaf spanning tree problem. In: Proceedings of the 4th International Workshop on Parameterized and Exact Computation IWPEC (2009)","DOI":"10.1007\/978-3-642-11269-0_13"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00453-007-9145-z","volume":"52","author":"F. Fomin","year":"2008","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: Solving connected dominating set faster than 2 n . Algorithmica\u00a052(2), 153\u2013166 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/S0097539797323571","volume":"29","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M., Vardy, A., Whittle, G.: The parametrized complexity of some fundamental problems in coding theory. SIAM J. Comput.\u00a029(2), 545\u2013570 (1999)","journal-title":"SIAM J. Comput."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-44985-X_10","volume-title":"Algorithm Theory - SWAT 2000","author":"J. Alber","year":"2000","unstructured":"Alber, J., Bodlaender, H., Fernau, H., Niedermeier, R.: Fixed parameter algorithms for planar dominating set and related problems. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 97\u2013110. Springer, Heidelberg (2000)"},{"key":"4_CR10","unstructured":"van Rooij, J., Bodlaender, H.: Design by measure and conquer, a faster exact algorithm for dominating set. In: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science STACS, Dagstuhl, Germany. Leibniz International Proceedings in Informatics, vol.\u00a01, pp. 657\u2013668 (2008)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-04128-0_50","volume-title":"Algorithms - ESA 2009","author":"J. Rooij van","year":"2009","unstructured":"van Rooij, J., Nederlof, J., van Dijk, T.: Inclusion\/exclusion meets measure and conquer: Exact algorithms for counting dominating sets. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 554\u2013565. Springer, Heidelberg (2009)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-642-02927-1_59","volume-title":"Automata, Languages and Programming","author":"J. Nederlof","year":"2009","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using m\u00f6bius inversion: Improving on steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 713\u2013725. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T22:46:11Z","timestamp":1559083571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}