{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:20:58Z","timestamp":1743106858856,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_25","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"356-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4887-9179","authenticated-orcid":false,"given":"Toru","family":"Hasunuma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.comgeo.2007.09.001","volume":"40","author":"M Abellanas","year":"2008","unstructured":"Abellanas, M., Garc\u00eda, A., Hurtado, F., Tejel, J., Urrutia, J.: Augmenting the connectivity of geometric graphs. Comput. Geom. 40, 220\u2013230 (2008)","journal-title":"Comput. Geom."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/jgt.21780","volume":"77","author":"T Araki","year":"2014","unstructured":"Araki, T.: Dirac\u2019s condition for completely independent spanning trees. J. Graph Theor. 77, 171\u2013179 (2014)","journal-title":"J. Graph Theor."},{"key":"25_CR3","first-page":"332","volume":"11","author":"MA Bekos","year":"2020","unstructured":"Bekos, M.A., Kaufmann, M., Klute, F., Pupyrev, S., Raftopoulou, C., Ueckerdt, T.: Four pages are indeed necessary for planar graphs. J. Comput. Geom. 11, 332\u2013353 (2020)","journal-title":"J. Comput. Geom."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F Bernhart","year":"1979","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theor. Ser. B 27, 320\u2013331 (1979)","journal-title":"J. Combin. Theor. Ser. B"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.dam.2016.11.019","volume":"219","author":"B Cheng","year":"2017","unstructured":"Cheng, B., Wang, D., Fan, J.: Constructing completely independent spanning trees in crossed cubes. Discrete Appl. Math. 219, 100\u2013109 (2017)","journal-title":"Discrete Appl. Math."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"FRK Chung","year":"1987","unstructured":"Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Embedding graphs in books: a layout problem with application to VLSI design. SIAM J. Algebraic Discrete Method 8, 33\u201358 (1987)","journal-title":"SIAM J. Algebraic Discrete Method"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.dam.2016.09.007","volume":"217","author":"B Darties","year":"2017","unstructured":"Darties, B., Gastineau, N., Togni, O.: Completely independent spanning trees in some regular graphs. Discrete Appl. Math. 217, 163\u2013174 (2017)","journal-title":"Discrete Appl. Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0012-365X(00)00377-0","volume":"234","author":"T Hasunuma","year":"2001","unstructured":"Hasunuma, T.: Completely independent spanning trees in the underlying graph of a line digraph. Discrete Math. 234, 149\u2013157 (2001)","journal-title":"Discrete Math."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/3-540-36379-3_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Hasunuma","year":"2002","unstructured":"Hasunuma, T.: Completely independent spanning trees in maximal planar graphs. In: Goos, G., Hartmanis, J., van Leeuwen, J., Ku\u010dera, Lud\u011bk (eds.) WG 2002. LNCS, vol. 2573, pp. 235\u2013245. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36379-3_21"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-29516-9_22","volume-title":"Combinatorial Algorithms","author":"T Hasunuma","year":"2016","unstructured":"Hasunuma, T.: Minimum degree conditions and optimal graphs for completely independent spanning trees. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 260\u2013273. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29516-9_22"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-1-4614-0110-0_17","volume-title":"Thirty Essays on Geometric Graph Theory","author":"F Hurtado","year":"2013","unstructured":"Hurtado, F., T\u00f3th, C.: Plane geometric graph augmentation: a generic perspective. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 327\u2013354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_17"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.jctb.2004.01.004","volume":"94","author":"B Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Independence free graphs and vertex connectivity augmentation. J. Combin. Theor. Ser. B 94, 31\u201377 (2005)","journal-title":"J. Combin. Theor. Ser. B"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1996.0034","volume":"21","author":"G Kant","year":"1996","unstructured":"Kant, G.: Augmenting outplanar graphs. J. Algorithms 21, 1\u201325 (1996)","journal-title":"J. Algorithms"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Algorithms and Data Structures","author":"G Kant","year":"1991","unstructured":"Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol. 519, pp. 286\u2013298. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0028270"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(99)00111-8","volume":"71","author":"Y-F Lan","year":"1999","unstructured":"Lan, Y.-F., Wang, Y.-L., Suzuki, H.: A linear-time algorithm for solving the center problem on weighted cactus graphs. Inform. Process. Lett. 71, 205\u2013212 (1999)","journal-title":"Inform. Process. Lett."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2016.08.024","volume":"652","author":"K-J Pai","year":"2016","unstructured":"Pai, K.-J., Chang, J.-M.: Constructing two completely independent spanning trees in hypercube-variant networks. Theor. Comput. Sci. 652, 28\u201337 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2020.02.007","volume":"140","author":"K-J Pai","year":"2020","unstructured":"Pai, K.-J., Chang, R.-S., Chang, J.-M.: A protection routing with secure mechanism in M\u00f6bius cubes. J. Parallel Distrib. Comput. 140, 1\u201312 (2020)","journal-title":"J. Parallel Distrib. Comput."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.disc.2011.11.015","volume":"312","author":"F P\u00e9terfalvi","year":"2012","unstructured":"P\u00e9terfalvi, F.: Two counterexamples on completely independent spanning trees. Discrete Math. 312, 808\u2013810 (2012)","journal-title":"Discrete Math."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"599","DOI":"10.7155\/jgaa.00275","volume":"16","author":"I Rutter","year":"2012","unstructured":"Rutter, I., Wolff, A.: Augmenting the connectivity of planar and geometric graphs. J. Graph Algorithms Appl. 16, 599\u2013628 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1137\/100787507","volume":"25","author":"LA V\u00e9gh","year":"2011","unstructured":"V\u00e9gh, L.A.: Augmenting undirected node-connectivity by one. SIAM J. Discrete Math. 25, 695\u2013718 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T Watanabe","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. J. Comput. Syst. Sci. 35, 96\u2013144 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR22","unstructured":"Wigderson, A.: The complexity of the Hamiltonian circuit problem for maximal planar graphs, Technical Report TR 298. Princeton University (1982)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Four pages are necessary and sufficient for planar graphs (extended abstract). In: Proceedings 18th Annual ACM Symposium on Theory of Computing, pp. 104\u2013108 (1986)","DOI":"10.1145\/12130.12141"},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38, 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jctb.2020.05.008","volume":"145","author":"M Yannakakis","year":"2020","unstructured":"Yannakakis, M.: Planar graphs that need four pages. J. Combin. Theor. Ser. B 145, 241\u2013263 (2020)","journal-title":"J. Combin. Theor. Ser. B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:13:57Z","timestamp":1625008437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","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":"38","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":"36% - 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.1","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":"9.1","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":"The workshop was held virtually.","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)"}}]}}