{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:54Z","timestamp":1725535134283},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_25","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"249-257","source":"Crossref","is-referenced-by-count":3,"title":["On the Hardness and Approximability of Planar Biconnectivity Augmentation"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Zey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","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":"25_CR1","DOI":"10.1007\/BFb0028270"},{"unstructured":"Fialko, S., Mutzel, P.: A new approximation algorithm for the planar augmentation problem. In: Proc. SODA 1998, SIAM, pp. 260\u2013269. SIAM, Philadelphia (1998)","key":"25_CR2"},{"issue":"5","key":"25_CR3","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"},{"doi-asserted-by":"crossref","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":"25_CR4","DOI":"10.1007\/3-540-37623-2_13"},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing\u00a02(3), 135\u2013158 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM Journal on Computing\u00a025, 956\u2013997 (1996)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)","key":"25_CR7","DOI":"10.1007\/3-540-44541-2_8"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theoretical Computer Science\u00a01(3), 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"unstructured":"Zey, B.: Algorithms for planar graph augmentation. Master\u2019s thesis, Dortmund University of Technology (2008), http:\/\/ls11-www.cs.uni-dortmund.de\/people\/gutweng\/diploma_thesis_zey.pdf","key":"25_CR9"},{"doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An O $(\\sqrt{|V|}|{E}|)$ algorithm for finding maximum matching in general graphs. In: Proc. FOCS 1980, pp. 17\u201327. IEEE, Los Alamitos (1980)","key":"25_CR10","DOI":"10.1109\/SFCS.1980.12"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T10:44:57Z","timestamp":1558435497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}