{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:08:48Z","timestamp":1770347328467,"version":"3.49.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031343469","type":"print"},{"value":"9783031343476","type":"electronic"}],"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-34347-6_19","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"221-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Make a Graph Singly Connected by Edge Orientations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1028-6351","authenticated-orcid":false,"given":"Tim A.","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Komal","family":"Muluk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H Bandelt","year":"1986","unstructured":"Bandelt, H., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182\u2013208 (1986). https:\/\/doi.org\/10.1016\/0095-8956(86)90043-2","journal-title":"J. Comb. Theory Ser. B"},{"key":"19_CR2","unstructured":"Borodin, O.V., Glebov, A.N.: On the partition of a planar graph of girth 5 into an empty and an acyclic subgraph (2001)"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0020-0190(93)90261-7","volume":"48","author":"AL Buchsbaum","year":"1993","unstructured":"Buchsbaum, A.L., Carlisle, M.C.: Determining uni-connectivity in directed graphs. Inf. Process. Lett. 48(1), 9\u201312 (1993). https:\/\/doi.org\/10.1016\/0020-0190(93)90261-7","journal-title":"Inf. Process. Lett."},{"key":"19_CR4","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"issue":"1\u20132","key":"19_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00234-6","volume":"263","author":"G Damiand","year":"2001","unstructured":"Damiand, G., Habib, M., Paul, C.: A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. 263(1\u20132), 99\u2013111 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00234-6","journal-title":"Theor. Comput. Sci."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2022.08.012","volume":"934","author":"A Das","year":"2022","unstructured":"Das, A., Kanesh, L., Madathil, J., Muluk, K., Purohit, N., Saurabh, S.: On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934, 47\u201364 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.08.012","journal-title":"Theor. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn., vol. 173. Graduate Texts in Mathematics. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"issue":"9","key":"19_CR8","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.ipl.2015.04.008","volume":"115","author":"M Dietzfelbinger","year":"2015","unstructured":"Dietzfelbinger, M., Jaberi, R.: On testing single connectedness in directed graphs and some related problems. Inf. Process. Lett. 115(9), 684\u2013688 (2015)","journal-title":"Inf. Process. Lett."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P.: Graph theory and probability. Can. J. Math. 11, 34\u201338 (1959)","journal-title":"Can. J. Math."},{"key":"19_CR10","first-page":"109","volume":"8","author":"H Gr\u00f6tzsch","year":"1959","unstructured":"Gr\u00f6tzsch, H.: Ein dreifarbensatz f\u00fcr dreikreisfreie netze auf der kugel. Wiss. Z. Martin Luther Univ. Halle-Wittenberg Math. Nat. Reihe 8, 109\u2013120 (1959)","journal-title":"Wiss. Z. Martin Luther Univ. Halle-Wittenberg Math. Nat. Reihe"},{"issue":"1\u20132","key":"19_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"PL Hammer","year":"1990","unstructured":"Hammer, P.L., Maffray, F.: Completely separable graphs. Discret. Appl. Math. 27(1\u20132), 85\u201399 (1990). https:\/\/doi.org\/10.1016\/0166-218X(90)90131-U","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(99)00135-0","volume":"72","author":"S Khuller","year":"1999","unstructured":"Khuller, S.: An $$\\cal{O} (|{V}|^2)$$ algorithm for single connectedness. Inf. Process. Lett. 72(3), 105\u2013107 (1999). https:\/\/doi.org\/10.1016\/S0020-0190(99)00135-0","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"19_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Lubiw, A., Nesetril, J.: Noncrossing subgraphs in topological layouts. SIAM J. Discret. Math. 4(2), 223\u2013244 (1991). https:\/\/doi.org\/10.1137\/0404022","journal-title":"SIAM J. Discret. Math."}],"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-031-34347-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:08:19Z","timestamp":1712758099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","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":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","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":"86","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":"33","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":"38% - 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.04","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":"5.69","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)"}}]}}