{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:34:14Z","timestamp":1794357254801,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":5,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_155","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:59Z","timestamp":1214490959000},"page":"337-339","source":"Crossref","is-referenced-by-count":0,"title":["Fully Dynamic Higher Connectivity for Planar Graphs"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"155_CR1_155","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/300515.300517","volume":"48","author":"Z. Galil","year":"1999","unstructured":"Galil Z., Italiano G.F., Sarnak N.: Fully dynamic planarity testing with applications. J.\u00a0ACM 48, 28\u201391 (1999)","journal-title":"J. ACM"},{"issue":"1","key":"155_CR2_155","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1996.0002","volume":"93","author":"D. Eppstein","year":"1996","unstructured":"Eppstein D., Galil Z., Italiano G.F., Spencer T.H.: Separator based sparsification I: planarity testing and minimum spanning trees. J.\u00a0Comput. Syst. Sci., Special issue of STOC 93 52(1), 3\u201327 (1996)","journal-title":"J. Comput. Syst. Sci., Special issue of STOC"},{"key":"155_CR3_155","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539794269072","volume":"28","author":"D. Eppstein","year":"1999","unstructured":"Eppstein D., Galil Z., Italiano G.F., Spencer T.H.: Separator based sparsification II: edge and vertex connectivity. SIAM J. Comput. 28, 341\u2013381 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"155_CR4_155","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01955676","volume":"16","author":"D. Giammarresi","year":"1996","unstructured":"Giammarresi D., Italiano G.F.: Decremental 2- and 3\u2011connectivity on planar graphs. Algorithmica 16(3), 263\u2013287 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"155_CR5_155","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(94)90156-2","volume":"130","author":"J.M.R. Hershberger","year":"1994","unstructured":"Hershberger J., M.R., Suri S.: Data structures for two-edge connectivity in planar graphs. Theor. Comput. Sci. 130(1), 139\u2013161 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T22:15:18Z","timestamp":1662156918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_155"}},"subtitle":["1998; Eppstein, Galil, Italiano, Spencer"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_155","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}