{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:25Z","timestamp":1759638145371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"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-92681-6_26","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"318-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Smallest Number of\u00a0Vertices in\u00a0a\u00a02-Arc-Strong Digraph Without Pair of\u00a0Arc-Disjoint In- and\u00a0Out-Branchings"],"prefix":"10.1007","author":[{"given":"Ran","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shasha","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenyu","family":"Taoqiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90002-2","volume":"51","author":"J Bang-Jensen","year":"1991","unstructured":"Bang-Jensen, J.: Edge-disjoint in- and out-branchings in tournaments and related path problems. J. Combin. Theory Ser. B 51(1), 1\u201323 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bang-Jensen J., Bessy S., Havet F., Yeo, A.: Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. arXiv:2003.02107 (2020)","DOI":"10.1002\/jgt.22779"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Bang-Jensen J., Bessy, S., Yeo, A.: Non-separating spanning trees and out-branchings in digraphs of independence number 2. arXiv:2007.02834v1 (2020)","DOI":"10.1002\/jgt.22779"},{"key":"26_CR4","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71840-8","volume-title":"Classes of Directed Graphs","year":"2018","unstructured":"Bang-Jensen, J., Gutin, G. (eds.): Classes of Directed Graphs. SMM, Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-71840-8"},{"key":"26_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer Verlag, London (2009). https:\/\/doi.org\/10.1007\/978-1-84800-998-1","edition":"2"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.22568","volume":"95","author":"J Bang-Jensen","year":"2020","unstructured":"Bang-Jensen, J., Gutin, G., Yeo, A.: Arc-disjoint strong spanning subdigraphs of semicomplete compositions. J. Graph Theory 95(2), 267\u2013289 (2020)","journal-title":"J. Graph Theory"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.jctb.2011.09.001","volume":"102","author":"J Bang-Jensen","year":"2010","unstructured":"Bang-Jensen, J., Huang, J.: Decomposing locally semicomplete digraphs into strong spanning subdigraphs. J. Combin. Theory Ser. B 102(3), 701\u2013714 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00453-015-0037-3","volume":"76","author":"J Bang-Jensen","year":"2016","unstructured":"Bang-Jensen, J., Saurabh, S., Simonsen, S.: Parameterized algorithms for non-separating trees and branchings in digraphs. Algorithmica 76(1), 279\u2013296 (2016). https:\/\/doi.org\/10.1007\/s00453-015-0037-3","journal-title":"Algorithmica"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Gu R., Gutin G., Li S., Shi Y., Taoqiu Z.: The smallest number of vertices in a 2-arc-strong digraph which has no good pair. arXiv:2012.03742 (2020)","DOI":"10.1007\/978-3-030-92681-6_26"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.jcss.2018.01.003","volume":"95","author":"G Gutin","year":"2018","unstructured":"Gutin, G., Reidl, F., Wahlstr\u00f6m, M.: $$k$$-distinct in- and out-branchings in digraphs. J. Comput. Syst. Sci. 95, 86\u201397 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On two min-max theorems in graph theory. J. Comb. Theory Ser. B 21, 96\u2013103 (1976)","journal-title":"J. Comb. Theory Ser. B"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1111\/j.1749-6632.1989.tb22479.x","volume":"555","author":"C Thomassen","year":"1989","unstructured":"Thomassen, C.: Configurations in graphs of large minimum degree, connectivity, or chromatic number. Ann. New York Acad. Sci. 555, 402\u2013412 (1989)","journal-title":"Ann. New York Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:05:43Z","timestamp":1639353943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_26","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":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"62","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":"16","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":"8","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":"26% - 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":"4.2","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":"2.75","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)"}}]}}