{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:58:33Z","timestamp":1770339513995,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439470","type":"print"},{"value":"9783662439487","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_66","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"800-811","source":"Crossref","is-referenced-by-count":15,"title":["Parameterized Algorithms to Preserve Connectivity"],"prefix":"10.1007","author":[{"given":"Manu","family":"Basavaraju","sequence":"first","affiliation":[]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Pranabendu","family":"Misra","sequence":"additional","affiliation":[]},{"given":"M. S.","family":"Ramanujan","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-39206-1_17","volume-title":"Automata, Languages, and Programming","author":"H.L. Bodlaender","year":"2013","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 196\u2013207. Springer, Heidelberg (2013)"},{"key":"66_CR2","unstructured":"Dinits, E., Karzanov, A., Lomonosov, M.: On the structure of a family of minimal weighted cuts in graphs. In: Fridman, A. (ed.) Studies in Discrete Mathematics, Nauka, Moscow, pp. 290\u2013306 (1976)"},{"issue":"3","key":"66_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks\u00a01(3), 195\u2013207 (1971)","journal-title":"Networks"},{"issue":"4","key":"66_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. Eswaran","year":"1976","unstructured":"Eswaran, K., Tarjan, R.: Augmentation problems. SIAM Journal on Computing\u00a05(4), 653\u2013665 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"66_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Mathematics\u00a05(1), 25\u201353 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"66_CR6","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., J\u00e1J\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput.\u00a010(2), 270\u2013283 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"66_CR7","first-page":"131","volume":"56","author":"J. Guo","year":"2010","unstructured":"Guo, J., Uhlmann, J.: Kernelization and complexity results for connectivity augmentation problems. Networks\u00a056(2), 131\u2013142 (2010)","journal-title":"Networks"},{"key":"66_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-642-39206-1_61","volume-title":"Automata, Languages, and Programming","author":"D. Marx","year":"2013","unstructured":"Marx, D., V\u00e9gh, L.A.: Fixed-parameter algorithms for minimum cost edge-connectivity augmentation. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol.\u00a07965, pp. 721\u2013732. Springer, Heidelberg (2013)"},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Nagamochi, H.: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discrete Applied Mathematics\u00a0126(1), 83\u2013113 (2003); 5th Annual International Computing and combinatorics Conference","DOI":"10.1016\/S0166-218X(02)00218-4"},{"issue":"2","key":"66_CR10","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/100787507","volume":"25","author":"L. Vegh","year":"2011","unstructured":"Vegh, L.: Augmenting undirected node-connectivity by one. SIAM Journal on Discrete Mathematics\u00a025(2), 695\u2013718 (2011)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"66_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. Journal of Computer and System Sciences\u00a035(1), 96\u2013144 (1987)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T08:41:21Z","timestamp":1565512881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}