{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:45Z","timestamp":1725896385533},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_29","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"289-300","source":"Crossref","is-referenced-by-count":2,"title":["Planar Biconnectivity Augmentation with Fixed Embedding"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"given":"Bernd","family":"Zey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"29_CR1","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"},{"key":"29_CR2","first-page":"260","volume-title":"Proc. SODA 1998","author":"S. Fialko","year":"1998","unstructured":"Fialko, S., Mutzel, P.: A new approximation algorithm for the planar augmentation problem. In: Proc. SODA 1998, pp. 260\u2013269. SIAM, Philadelphia (1998)"},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing\u00a04(4), 397\u2013411 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"1999","unstructured":"Gutwenger, C., Mutzel, P.: Planar polyline drawings with good angular resolution. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 167\u2013182. Springer, Heidelberg (1999)"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-3-642-02882-3_25","volume-title":"COCOON 2009","author":"C. Gutwenger","year":"2009","unstructured":"Gutwenger, C., Mutzel, P., Zey, B.: On the hardness and approximability of planar biconnectivity augmentation. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 249\u2013257. Springer, Heidelberg (2009)"},{"issue":"5","key":"29_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/0222056","volume":"22","author":"T.-S. Hsu","year":"1993","unstructured":"Hsu, T.-S., Ramachandran, V.: On finding a smallest augmentation to biconnect a graph. SIAM Journal on Computing\u00a022(5), 889\u2013912 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Algorithms and Data Structures","author":"G. Kant","year":"1991","unstructured":"Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 286\u2013298. Springer, Heidelberg (1991)"},{"key":"29_CR8","unstructured":"OGDF: An Open Graph Drawing Framework (2009), \n                    \n                      http:\/\/www.ogdf.net"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/0206003","volume":"6","author":"A. Rosenthal","year":"1977","unstructured":"Rosenthal, A., Goldner, A.: Smallest augmentations to biconnect a graph. SIAM Journal on Computing\u00a06(1), 55\u201366 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"29_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"5&6","key":"29_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"Westbrook, J., Tarjan, R.: Maintaining bridge-connected and biconnected components on-line. Algorithmica\u00a07(5&6), 433\u2013464 (1992)","journal-title":"Algorithmica"},{"key":"29_CR12","unstructured":"Zey, B.: Algorithms for planar graph augmentation. Master\u2019s thesis, Dortmund University of Technology (2008), \n                    \n                      http:\/\/ls11-www.cs.uni-dortmund.de\/people\/gutweng\/diploma_thesis_zey.pdf"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:31Z","timestamp":1619782471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}