{"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":1792111428250,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":12,"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_157","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:51:54Z","timestamp":1553097114000},"page":"806-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fully Dynamic Planarity Testing"],"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":"157_CR6366","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/00207169408804320","volume":"53","author":"R Cimikowski","year":"1994","unstructured":"Cimikowski R (1994) Branch-and-bound techniques for the maximum planar subgraph problem. Int J Comput Math 53:135\u2013147","journal-title":"Int J Comput Math"},{"issue":"5","key":"157_CR6367","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D Eppstein","year":"1997","unstructured":"Eppstein D, Galil Z, Italiano GF, Nissenzweig A (1997) Sparsification \u2013 a technique for speeding up dynamic graph algorithms. J Assoc Comput Mach 44(5):669\u2013696","journal-title":"J Assoc Comput Mach"},{"issue":"1","key":"157_CR6368","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":"157_CR6369","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"},{"key":"157_CR6370","doi-asserted-by":"crossref","unstructured":"Eppstein D, Italiano GF, Tamassia R, Tarjan RE, Westbrook J, Yung M (1992) Maintenance of a minimum spanning forest in a dynamic plane graph. J Algorithms 13:33\u201354","DOI":"10.1016\/0196-6774(92)90004-V"},{"key":"157_CR6371","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"GN Frederickson","year":"1985","unstructured":"Frederickson GN (1985) Data structures for on-line updating of minimum spanning trees, with applications. SIAM J Comput 14:781\u2013798","journal-title":"SIAM J Comput"},{"issue":"2","key":"157_CR6372","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0097539792226825","volume":"26","author":"GN Frederickson","year":"1997","unstructured":"Frederickson GN (1997) Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J Comput 26(2):484\u2013538","journal-title":"SIAM J Comput"},{"key":"157_CR6373","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":"3","key":"157_CR6374","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":"157_CR6375","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, Suri MR, Suri S (1994) Data structures for two-edge connectivity in planar graphs. Theor Comput Sci 130(1):139\u2013161","journal-title":"Theor Comput Sci"},{"key":"157_CR6376","doi-asserted-by":"crossref","unstructured":"Italiano GF, La Poutr\u00e9 JA, Rauch M (1993) Fully dynamic planarity testing in planar embedded graphs. In: 1st annual European symposium on algorithms, Bad Honnef, 30 Sept\u20132 Oct","DOI":"10.1007\/3-540-57273-2_57"},{"key":"157_CR6377","doi-asserted-by":"crossref","unstructured":"Tamassia R (1988) A dynamic data structure for planar graph embedding. In: 15th international colloquium automata, languages, and programming. LNCS, vol 317. Springer, Berlin, pp 576\u2013590","DOI":"10.1007\/3-540-19488-6_143"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:44:50Z","timestamp":1792107890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_157","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"}}]}}