{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:47:59Z","timestamp":1743058079094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_15","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"202-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maintaining Triconnected Components Under Node Expansion"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2754-1195","authenticated-orcid":false,"given":"Simon D.","family":"Fink","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-4406","authenticated-orcid":false,"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1142\/S0218195914600103","volume":"24","author":"P Angelini","year":"2014","unstructured":"Angelini, P., Bl\u00e4sius, T., Rutter, I.: Testing mutual duality of planar graphs. Int. J. Comput. Geom. Appl. 24(4), 325\u2013346 (2014). https:\/\/doi.org\/10.1142\/S0218195914600103","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"15_CR2","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Fink, S.D., Rutter, I.: Synchronized planarity with applications to constrained planarity problems. In: Proceedings of the 29th Annual European Symposium on Algorithms (ESA\u201921). LIPIcs, vol. 204, pp. 19:1\u201319:14 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.19","DOI":"10.4230\/LIPIcs.ESA.2021.19"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2), 16:1\u201316:46 (2016). https:\/\/doi.org\/10.1145\/2738054","DOI":"10.1145\/2738054"},{"issue":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/s0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976). https:\/\/doi.org\/10.1016\/s0022-0000(76)80045-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/bf01961541","volume":"15","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996). https:\/\/doi.org\/10.1007\/bf01961541","journal-title":"Algorithmica"},{"issue":"5","key":"15_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/s0097539794280736","volume":"25","author":"G Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996). https:\/\/doi.org\/10.1137\/s0097539794280736","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR7","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, G.F., Spencer, T.H.: Separator based sparsification. J. Comput. Syst. Sci. 52(1), 3\u201327 (1996). https:\/\/doi.org\/10.1006\/jcss.1996.0002","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Fink, S.D., Rutter, I.: Maintaining triconnected components under node expansion (2023). https:\/\/arxiv.org\/abs\/2301.03972","DOI":"10.1007\/978-3-031-30448-4_15"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Fulek, R., T\u00f3th, C.D.: Atomic embeddability, clustered planarity, and thickenability. J. ACM 69(2), 13:1\u201313:34 (2022). https:\/\/doi.org\/10.1145\/3502264","DOI":"10.1145\/3502264"},{"key":"15_CR10","unstructured":"Gutwenger, C.: Application of SPQR-trees in the planarization approach for drawing graphs. Ph.D. thesis (2010). https:\/\/eldorado.tu-dortmund.de\/bitstream\/2003\/27430\/1\/diss_gutwenger.pdf"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Holm, J., Rotenberg, E.: Fully-dynamic planarity testing in polylogarithmic time. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020). vol. abs\/1911.03449, pp. 167\u2013180. ACM (2020). https:\/\/doi.org\/10.1145\/3357713.3384249","DOI":"10.1145\/3357713.3384249"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Holm, J., Rotenberg, E.: Worst-case polylog incremental SPQR-trees: embeddings, planarity, and triconnectivity. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 2378\u20132397. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.146","DOI":"10.1137\/1.9781611975994.146"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"Weiskircher, R.: New applications of SPQR-trees in graph drawing. Ph.D. thesis, Universit\u00e4t des Saarlandes (2002). https:\/\/doi.org\/10.22028\/D291-25752","DOI":"10.22028\/D291-25752"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:04:07Z","timestamp":1684191847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}