{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:47:10Z","timestamp":1743022030271,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_8","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"117-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improvement to Chv\u00e1tal and Thomassen\u2019s Upper Bound for Oriented Diameter"],"prefix":"10.1007","author":[{"given":"Jasine","family":"Babu","sequence":"first","affiliation":[]},{"given":"Deepu","family":"Benson","sequence":"additional","affiliation":[]},{"given":"Deepak","family":"Rajendraprasad","sequence":"additional","affiliation":[]},{"given":"Sai Nishant","family":"Vaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. Am. Math. Monthly 46(5), 281\u2013283 (1939)","journal-title":"Am. Math. Monthly"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0095-8956(78)90078-3","volume":"24","author":"V Chv\u00e1tal","year":"1978","unstructured":"Chv\u00e1tal, V., Thomassen, C.: Distances in orientations of graphs. J. Comb. Theory Ser. B 24(1), 61\u201375 (1978)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1002\/net.3230150409","volume":"15","author":"FRK Chung","year":"1985","unstructured":"Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly connected orientations of mixed multigraphs. Networks 15(4), 477\u2013484 (1985)","journal-title":"Networks"},{"issue":"1\u20133","key":"8_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(03)00376-7","volume":"141","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Matamala, M., Prisner, E., Rapaport, I.: AT-free graphs: linear bounds for the oriented diameter. Discrete Appl. Math. 141(1\u20133), 135\u2013148 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/jgt.10160","volume":"45","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Matamala, M., Rapaport, I.: Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4), 255\u2013269 (2004)","journal-title":"J. Graph Theory"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.endm.2009.07.043","volume":"34","author":"N Eggemann","year":"2009","unstructured":"Eggemann, N., Noble, S.D.: Minimizing the oriented diameter of a planar graph. Electron. Notes Discrete Math. 34, 267\u2013271 (2009)","journal-title":"Electron. Notes Discrete Math."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejc.2015.03.003","volume":"49","author":"S Bau","year":"2015","unstructured":"Bau, S., Dankelmann, P.: Diameter of orientations of graphs with given minimum degree. Eur. J. Comb. 49, 126\u2013133 (2015)","journal-title":"Eur. J. Comb."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ejc.2016.08.006","volume":"59","author":"M Surmacs","year":"2017","unstructured":"Surmacs, M.: Improved bound on the oriented diameter of graphs with given minimum degree. Eur. J. Comb. 59, 187\u2013191 (2017)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.jctb.2009.08.003","volume":"100","author":"PK Kwok","year":"2010","unstructured":"Kwok, P.K., Liu, Q., West, D.B.: Oriented diameter of graphs with diameter 3. J. Comb. Theory Ser. B 100(3), 265\u2013274 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"8_CR10","first-page":"51","volume":"16","author":"X Huang","year":"2014","unstructured":"Huang, X., Li, H., Li, X., Sun, Y.: Oriented diameter and rainbow connection number of a graph. Discret. Math. Theor. Comput. Sci. 16(3), 51\u201360 (2014)","journal-title":"Discret. Math. Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:04:07Z","timestamp":1592780647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","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":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"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":"7","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 conference was cancelled as a live conference due to the corona pandemic.","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)"}}]}}