{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:43:48Z","timestamp":1792111428043,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":5,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_155","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:51:54Z","timestamp":1553097114000},"page":"800-802","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","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","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"155_CR6346","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/300515.300517","volume":"48","author":"Z Galil","year":"1999","unstructured":"Galil Z, Italiano GF, Sarnak N (1999) Fully dynamic planarity testing with applications. J ACM 48:28\u201391","journal-title":"J ACM"},{"issue":"1","key":"155_CR6347","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1996.0002","volume":"52","author":"D Eppstein","year":"1996","unstructured":"Eppstein D, Galil Z, Italiano GF, Spencer TH (1996) Separator based sparsification I: planarity testing and minimum spanning trees. J Comput Syst Sci Spec Issue STOC 93 52(1):3\u201327","journal-title":"J Comput Syst Sci Spec Issue STOC 93"},{"key":"155_CR6348","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539794269072","volume":"28","author":"D Eppstein","year":"1999","unstructured":"Eppstein D, Galil Z, Italiano GF, Spencer TH (1999) Separator based sparsification II: edge and vertex connectivity. SIAM J Comput 28:341\u2013381","journal-title":"SIAM J Comput"},{"issue":"3","key":"155_CR6349","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01955676","volume":"16","author":"D Giammarresi","year":"1996","unstructured":"Giammarresi D, Italiano GF (1996) Decremental 2- and 3-connectivity on planar graphs. Algorithmica 16(3):263\u2013287","journal-title":"Algorithmica"},{"issue":"1","key":"155_CR6350","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(94)90156-2","volume":"130","author":"J Hershberger","year":"1994","unstructured":"Hershberger J, Rauch M, Suri S (1994) Data structures for two-edge connectivity in planar graphs. Theor Comput Sci 130(1):139\u2013161","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-1-4939-2864-4_155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:44:48Z","timestamp":1792107888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_155"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_155","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}