{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:33:24Z","timestamp":1794357204348,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":12,"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_157","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:59Z","timestamp":1214490959000},"page":"342-343","source":"Crossref","is-referenced-by-count":0,"title":["Fully Dynamic Planarity Testing"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"157_CR1_157","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/00207169408804320","volume":"53","author":"R. Cimikowski","year":"1994","unstructured":"Cimikowski, R.: Branch-and-bound techniques for the maximum planar subgraph problem. Int. J. Computer Math. 53, 135\u2013147 (1994)","journal-title":"Int. J. Computer Math."},{"issue":"5","key":"157_CR2_157","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, G.F., Nissenzweig, A.: Sparsification\u00a0\u2013 a\u00a0technique for speeding up dynamic graph algorithms. J.\u00a0Assoc. Comput. Mach. 44(5), 669\u2013696 (1997)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"157_CR3_157","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":"157_CR4_157","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."},{"key":"157_CR5_157","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","volume":"13","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D., Italiano, G.F., Tamassia, R., Tarjan, R.E., Westbrook, J., Yung, M.: Maintenance of a\u00a0minimum spanning forest in a\u00a0dynamic plane graph. J.\u00a0Algorithms 13, 33\u201354 (1992)","journal-title":"J. Algorithms"},{"key":"157_CR6_157","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G.N. Frederickson","year":"1985","unstructured":"Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14, 781\u2013798 (1985)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"157_CR7_157","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0097539792226825","volume":"26","author":"G.N. Frederickson","year":"1997","unstructured":"Frederickson, G.N.: Ambivalent data structures for dynamic 2-edge\u2010connectivity and k smallest spanning trees. SIAM J. Comput. 26(2), 484\u2013538 (1997)","journal-title":"SIAM J. Comput."},{"key":"157_CR8_157","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":"3","key":"157_CR9_157","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\u2010connectivity on planar graphs. Algorithmica 16(3):263\u2013287 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"157_CR10_157","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, 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."},{"key":"157_CR11_157","doi-asserted-by":"crossref","unstructured":"Italiano, G.F., La Poutr\u00e9, J.A., Rauch, M.: Fully dynamic planarity testing in planar embedded graphs. 1st Annual European Symposium on Algorithms, Bad Honnef, Germany, 30 September\u20132 October 1993","DOI":"10.1007\/3-540-57273-2_57"},{"key":"157_CR12_157","volume-title":"A dynamic data structure for planar graph embedding. 15th Int. Colloq. Automata, Languages, and Programming. LNCS, vol. 317, pp. 576\u2013590","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R.: A\u00a0dynamic data structure for planar graph embedding. 15th Int. Colloq. Automata, Languages, and Programming. LNCS, vol.\u00a0317, pp.\u00a0576\u2013590. Springer, Berlin (1988)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T22:15:29Z","timestamp":1662156929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_157"}},"subtitle":["1999; Galil, Italiano, Sarnak"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_157","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]]}}}