{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:13Z","timestamp":1759335973179},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T00:00:00Z","timestamp":1201132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s00453-008-9167-1","type":"journal-article","created":{"date-parts":[[2008,1,23]],"date-time":"2008-01-23T17:54:58Z","timestamp":1201110898000},"page":"160-179","source":"Crossref","is-referenced-by-count":6,"title":["Augmenting the Connectivity of Outerplanar Graphs"],"prefix":"10.1007","volume":"56","author":[{"given":"A.","family":"Garc\u00eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Hurtado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Noy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Tejel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,24]]},"reference":[{"key":"9167_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"9167_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, New York (1998)"},{"key":"9167_CR3","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s101070050041","volume":"84","author":"E. Cheng","year":"1999","unstructured":"Cheng, E., Jord\u00e1n, T.: Successive edge-connectivity augmentation problems. Math. Program. 84, 577\u2013593 (1999)","journal-title":"Math. Program."},{"key":"9167_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5, 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"key":"9167_CR5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1002\/jgt.10042","volume":"40","author":"A. Garc\u00eda","year":"2002","unstructured":"Garc\u00eda, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.: Packing trees into planar graphs. J. Graph Theory 40, 172\u2013181 (2002)","journal-title":"J. Graph Theory"},{"key":"9167_CR6","doi-asserted-by":"crossref","unstructured":"Hsu, T.S.: On four-connecting a triconnected graph. In: Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 70\u201379 (1992)","DOI":"10.1109\/SFCS.1992.267817"},{"key":"9167_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.jctb.2004.01.004","volume":"94","author":"B. Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. J. Comb. Theory Ser. B 94, 31\u201377 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9167_CR8","unstructured":"Kant, G.: Algorithms for drawing planar graphs. Ph.D. thesis, Dept. of Computer Science, Utrecht University (1993)"},{"key":"9167_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1996.0034","volume":"21","author":"G. Kant","year":"1996","unstructured":"Kant, G.: Augmenting outerplanar graphs. J. Algorithms 21, 1\u201325 (1996)","journal-title":"J. Algorithms"},{"key":"9167_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009739202898","volume":"1","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Ibaraki, T.: Deterministic O(nm) time edge-splitting in undirected graphs. J. Comb. Optim. 1, 5\u201346 (1997)","journal-title":"J. Comb. Optim."},{"key":"9167_CR11","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 35, 96\u2013144 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"9167_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(90)90116-T","volume":"28","author":"T. Watanabe","year":"1990","unstructured":"Watanabe, T., Nakamura, A.: A smallest augmentation to 3-connect a graph. Discrete Appl. Math. 28, 183\u2013186 (1990)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9167-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9167-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9167-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:01Z","timestamp":1559137501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9167-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,24]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["9167"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9167-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,24]]}}}