{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T16:16:54Z","timestamp":1772468214562,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1007\/bf01961541","type":"journal-article","created":{"date-parts":[[2005,7,29]],"date-time":"2005-07-29T16:13:26Z","timestamp":1122653606000},"page":"302-318","source":"Crossref","is-referenced-by-count":88,"title":["On-line maintenance of triconnected components with SPQR-trees"],"prefix":"10.1007","volume":"15","author":[{"given":"G.","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"R.","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01961541_CR1","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia, Incremental Planarity Testing,Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 436\u2013441.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"BF01961541_CR2","doi-asserted-by":"crossref","unstructured":"G. Di Battista and R. Tamassia, On-Line Planarity Testing,SIAM Journal on Computing,25(5) (1996), to appear.","DOI":"10.1137\/S0097539794280736"},{"key":"BF01961541_CR3","first-page":"379","volume-title":"Lecture Notes in Computer Science, Vol. 372","author":"D. Fussell","year":"1989","unstructured":"D. Fussell, V. Ramachandran, and R. Thurimella, Finding Triconnected Components by Local Replacements,Automata, Languages and Programming (Proc. 16th ICALP), Lecture Notes in Computer Science, Vol. 372, Springer-Verlag, Berlin, 1989, pp. 379\u2013393."},{"key":"BF01961541_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H. N. Gabow","year":"1985","unstructured":"H. N. Gabow and R. E. Tarjan, A Linear Time Algorithm for a Special Case of Disjoint Set Union,J. Comput. Systems Sci.,30 (1985), 209\u2013221.","journal-title":"J. Comput. Systems Sci."},{"key":"BF01961541_CR5","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, Dividing a Graph into Triconnected Components,SIAM J. Comput.,2 (1973), 135\u2013158.","journal-title":"SIAM J. Comput."},{"key":"BF01961541_CR6","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, Dynamic Orthogonal Segment Intersection Search,J. Algorithms,8 (1987), 1\u201318.","journal-title":"J. Algorithms"},{"key":"BF01961541_CR7","first-page":"213","volume":"74","author":"A. Kanevsky","year":"1990","unstructured":"A. Kanevsky, A Characterization of Separating Pairs and Triplets in a Graph,Congress. Numer.,74 (1990), 213\u2013232.","journal-title":"Congress. Numer."},{"key":"BF01961541_CR8","first-page":"354","volume-title":"Lecture Notes in Computer Science, Vol. 623","author":"J. A. Poutr\u00e9 La","year":"1992","unstructured":"J. A. La Poutr\u00e9, Maintenance of Triconnected Components of Graphs,Automata, Languages and Programming (Proc. 19th ICALP), Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin, 1992, pp. 354\u2013365."},{"key":"BF01961541_CR9","doi-asserted-by":"crossref","unstructured":"R. Tamassia, On-Line Planar Graph Embedding,J. Algorithms (to appear). (Preliminary version inProc. 15th ICALP, Lecture Notes in Computer Science, Vol. 317, Springer-Verlag, Berlin, 1988, pp. 576\u2013590.)","DOI":"10.1007\/3-540-19488-6_143"},{"key":"BF01961541_CR10","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan, Amortized Computational Complexity,SIAM J. Algebraic Discrete Methods,6 (1985), 306\u2013318.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01961541_CR11","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, Worst-Case Analysis of Set-Union Algorithms,J. Assoc. Comput. Mach.,31 (1984), 245\u2013281.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01961541_CR12","volume-title":"Encyclopedia of Mathematics and Its Applications, Vol. 21","author":"W. T. Tutte","year":"1984","unstructured":"W. T. Tutte,Graph Theory, Encyclopedia of Mathematics and Its Applications, Vol. 21, Addison-Wesley, Reading, MA, 1984."},{"key":"BF01961541_CR13","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"J. Westbrook and R. E. Tarjan, Maintaining Bridge-Connected and Biconnected Components On-Line,Algorithmica,7 (1992), 433\u2013464.","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01961541.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01961541\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01961541","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T12:04:53Z","timestamp":1586347493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01961541"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["BF01961541"],"URL":"https:\/\/doi.org\/10.1007\/bf01961541","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}