{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:26Z","timestamp":1760440466457},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528265"},{"type":"electronic","value":"9783540471592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/bfb0032061","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:05:31Z","timestamp":1134263131000},"page":"598-611","source":"Crossref","is-referenced-by-count":43,"title":["On-line graph algorithms with SPQR-trees"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"G. Ausiello, G.F. Italiano, A. Marchetti-Spaccamela and U. Nanni, \u201cIncremental Algorithms for Minimal Length Paths,\u201d Proc. ACM-SIAM Symp. on Discrete Algorithms (1990), 12\u201321.","key":"45_CR1","DOI":"10.1016\/0196-6774(91)90036-X"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D. Bienstock","year":"1988","unstructured":"D. Bienstock and C.L. Monma, \u201cOn the Complexity of Covering Vertices by Faces in a Planar Graph,\u201d SIAM J. Computing 17 (1988), 53\u201376.","journal-title":"SIAM J. Computing"},{"unstructured":"A.L. Buchsbaum, P.C. Kanellakis and J.S. Vitter, \u201cA Data Structure for Arc Insertion and Regular Path Finding,\u201d Proc. ACM-SIAM Symp. on Discrete Algorithms (1990), 22\u201331.","key":"45_CR3"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia, \u201cAlgorithms for Plane Representations of Acyclic Digraphs,\u201d Theoretical Computer Science 61 (1988), 175\u2013198.","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia, \u201cIncremental Planarity Testing,\u201d Proc. 30th IEEE Symp. on Foundations of Computer Science (1989), 436\u2013441.","key":"45_CR5","DOI":"10.1109\/SFCS.1989.63515"},{"doi-asserted-by":"crossref","unstructured":"G. Di Battista, R. Tamassia and I.G. Tollis, \u201cArea Requirement and Symmetry Display in Drawing Graphs,\u201d Proc. ACM Symp. on Computational Geometry (1989), 51\u201360.","key":"45_CR6","DOI":"10.1145\/73833.73839"},{"unstructured":"D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook and M. Yung, \u201cMaintenance of a Minimum Spanning Forest in a Dynamic Planar Graph,\u201d Proc. First ACM-SIAM Symp. on Discrete Algorithms (1990), 1\u201311.","key":"45_CR7"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even and R.E. Tarjan, \u201cComputing an st-Numbering,\u201d Theoretical Computer Science 2 (1976), 339\u2013344.","journal-title":"Theoretical Computer Science"},{"key":"45_CR9","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G.N. Frederickson","year":"1985","unstructured":"G.N. Frederickson, \u201cData Structures for On-Line Updating of Minimum Spanning Trees, with Applications,\u201d SIAM J. Computing 14 (1985), 781\u2013798.","journal-title":"SIAM J. Computing"},{"key":"45_CR10","first-page":"379","volume":"372","author":"D. Fussell","year":"1989","unstructured":"D. Fussell, V. Ramachandran and R. Thurimella, \u201cFinding Triconnected Components by Local Replacements,\u201d Proc. 16th ICALP, LNCS, 372 (1989), 379\u2013393.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"H.N. Gabow and R.e. Tarjan, \u201cA Linear Time Algorithm for a Special Case of Disjoint Set Union,\u201d J. Computer Systems Sciences 30 (1985).","key":"45_CR11","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"45_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R.E. Tarjan, \u201cDividing a Graph into Triconnected Components,\u201d SIAM J. Computing 2 (1973), 135\u2013158.","journal-title":"SIAM J. Computing"},{"key":"45_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(87)90024-1","volume":"8","author":"H. Imai","year":"1987","unstructured":"H. Imai and T. Asano, \u201cDynamic Orthogonal Segment Intersection Search,\u201d J. Algorithms 8 (1987), 1\u201318.","journal-title":"J. Algorithms"},{"key":"45_CR14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","volume":"48","author":"G.F. Italiano","year":"1986","unstructured":"G.F. Italiano, \u201cAmortized Efficiency of a Path Retrieval Data Structure,\u201d Theoretical Computer Science 48 (1986), 273\u2013281.","journal-title":"Theoretical Computer Science"},{"key":"45_CR15","first-page":"352","volume":"382","author":"G.F. Italiano","year":"1989","unstructured":"G.F. Italiano, A. Marchetti-Spaccamela and U. Nanni, \u201cDynamic Data Structures for Series-Parallel Graphs,\u201d Proc. WADS' 89, LNCS 382 (1989), 352\u2013372.","journal-title":"LNCS"},{"unstructured":"A. Kanevsky and V. Ramachandran, \u201cA Characterization of Separating Pairs and Triplets in a Graph,\u201d Coordinated Science Laboratory, Univ. of Illinois, Technical Report ACT-79, 1987.","key":"45_CR16"},{"unstructured":"A. Lempel, S. Even and I. Cederbaum, \u201cAn Algorithm for Planarity Testing of Graphs,\u201d Theory of Graphs, Int. Symposium (1966), 215\u2013232.","key":"45_CR17"},{"unstructured":"J.A. La Poutr\u00e9, Personal Communication, 1990.","key":"45_CR18"},{"key":"45_CR19","first-page":"106","volume":"314","author":"J.A. Poutr\u00e9 La","year":"1988","unstructured":"J.A. La Poutr\u00e9 and J. van Leeuwen, \u201cMaintenance of Transitive Closures and Transitive Reductions of Graphs,\u201d Proc. WG '87, LNCS 314 (1988), 106\u2013120.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"F.P. Preparata and R. Tamassia, \u201cFully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures,\u201d Proc. 29th IEEE Symp. on Foundations of Computer Science (1988), 558\u2013567.","key":"45_CR20","DOI":"10.1109\/SFCS.1988.21972"},{"key":"45_CR21","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/0218056","volume":"18","author":"F.P. Preparata","year":"1989","unstructured":"F.P. Preparata and R. Tamassia, \u201cFully Dynamic Point Location in a Monotone Subdivision,\u201d SIAM J. Computing 18 (1989), 811\u2013830.","journal-title":"SIAM J. Computing"},{"key":"45_CR22","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"24","author":"D.D. Sleator","year":"1983","unstructured":"D.D. Sleator and R.E. Tarjan, \u201cA Data Structure for Dynamic Trees,\u201d J. Computer Systems Sciences 24 (1983), 362\u2013381.","journal-title":"J. Computer Systems Sciences"},{"key":"45_CR23","first-page":"576","volume":"317","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, \u201cA Dynamic Data Structure for Planar Graph Embedding,\u201d Proc. 15th ICALP, LNCS 317 (1988), 576\u2013590.","journal-title":"LNCS"},{"key":"45_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and J. van Leeuwen, \u201cWorst-Case Analysis of Set-Union Algorithms,\u201d J. ACM 31 (1984), 245\u2013281.","journal-title":"J. ACM"},{"unstructured":"J. Westbrook, \u201cAlgorithms and Data Structures for Dynamic Graph Problems,\u201d Dept. Computer Science, Princeton Univ., Ph.D. dissertation (Technical Report CSTR-229-89), 1989.","key":"45_CR25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:45:02Z","timestamp":1586598302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528265","9783540471592"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0032061","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}