{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:43Z","timestamp":1759637683624,"version":"3.40.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_47","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"625-636","source":"Crossref","is-referenced-by-count":2,"title":["On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints"],"prefix":"10.1007","author":[{"given":"Faisal N.","family":"Abu-Khzam","sequence":"first","affiliation":[]},{"given":"Judith","family":"Egan","sequence":"additional","affiliation":[]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[]},{"given":"Frances A.","family":"Rosamond","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Shaw","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"3","key":"47_CR1","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.jda.2011.03.006","volume":"9","author":"FN Abu-Khzam","year":"2011","unstructured":"Abu-Khzam, F.N., Mouawad, A.E., Liedloff, M.: An exact algorithm for connected red-blue dominating set. J. Discrete Algorithms 9(3), 252\u2013262 (2011)","journal-title":"J. Discrete Algorithms"},{"key":"47_CR2","unstructured":"Bharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. In: IEEE International Conference on Communication, pp. 376\u2013380 (1997)"},{"issue":"36","key":"47_CR3","doi-asserted-by":"publisher","first-page":"3428","DOI":"10.1016\/j.tcs.2008.04.039","volume":"410","author":"HJ B\u00f6ckenhauer","year":"2009","unstructured":"B\u00f6ckenhauer, H.J., Hromkovic, J., Kr\u00e1lovic, R., M\u00f6mke, T., Rossmanith, P.: Reoptimization of steiner trees: changing the terminal set. Theor. Comput. Sci. 410(36), 3428\u20133435 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Carlsson, M.: Monads for incremental computing. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, ICFP \u201902, pp. 26\u201335. ACM, New York (2002)","DOI":"10.1145\/581478.581482"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y.P., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (2002)","DOI":"10.1145\/513819.513821"},{"issue":"4","key":"47_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TST.2014.6867515","volume":"19","author":"RG Downey","year":"2014","unstructured":"Downey, R.G., Egan, J., Fellows, M.R., Rosamond, F.A., Shaw, P.: Dynamic dominating set and turbo-charging greedy heuristics. J. Tsinghua Sci. Technol. 19(4), 329\u2013337 (2014)","journal-title":"J. Tsinghua Sci. Technol."},{"key":"47_CR7","first-page":"191","volume-title":"Complexity Theory: Current Research","author":"RG Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. In: Ambos-Spies, K., Homer, S., Sch\u00f6ning, U. (eds.) Complexity Theory: Current Research, pp. 191\u2013225. Cambridge University Press, Cambridge (1992)"},{"key":"47_CR8","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2012.12.049","volume":"494","author":"S Hartung","year":"2013","unstructured":"Hartung, S., Niedermeier, R.: Incremental list coloring of graphs, parameterized by conservation. Theor. Comput. Sci. 494, 86\u201398 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"47_CR10","unstructured":"Lackner, M., Pfandler, A.: Fixed-parameter algorithms for finding minimal models. In: KR (2012)"},{"issue":"2","key":"47_CR11","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s00224-007-9089-3","volume":"43","author":"D M\u00f6lle","year":"2008","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover. Theory Comput. Syst. 43(2), 234\u2013253 (2008)","journal-title":"Theory Comput. Syst."},{"key":"47_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, Part I. LNCS, vol. 5555, pp. 713\u2013725. Springer, Heidelberg (2009)"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"HN Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. 61, 143\u2013164 (1995)","journal-title":"Ann. Oper. Res."},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Ramamurthy, B., Iness, J., Mukherjee, B.: Minimizing the number of optical amplifiers needed to support a multi-wavelength optical lan\/man. In: IEEE International Conference on Computer Communications, pp. 261\u2013268 (1997)","DOI":"10.1109\/INFCOM.1997.635138"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"Salhieh, A., Weinmann, J., Kochha, M., Schwiebert, L.: Power efficient topologies for wireless sensor networks. In: International Conference on Parallel Processing, pp. 156\u2013163 (2001)","DOI":"10.1109\/ICPP.2001.952059"},{"key":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/978-3-642-29344-3_52","volume-title":"LATIN 2012: Theoretical Informatics","author":"H Shachnai","year":"2012","unstructured":"Shachnai, H., Tamir, G., Tamir, T.: A theory and algorithms for combinatorial reoptimization. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 618\u2013630. Springer, Heidelberg (2012)"},{"key":"47_CR17","unstructured":"Sivakumar, R., Das, B., Bharghavan, V.: An improved spine-based infrastructure for routing in ad hoc networks. In: IEEE Symposium on Computer and Communications (1998)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T18:25:57Z","timestamp":1747160757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}