{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T21:05:22Z","timestamp":1762981522800,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_14","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"192-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bounds for\u00a0the\u00a0Oriented Diameter of\u00a0Planar Triangulations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-8697","authenticated-orcid":false,"given":"Debajyoti","family":"Mondal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Parthiban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Ajish Kumar, K.S., Rajendraprasad, D., Sudeep, K.S.: Oriented Diameter of Star Graphs. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 307\u2013317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_25","DOI":"10.1007\/978-3-030-39219-2_25"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Optimal area algorithm for planar polyline drawings. In: Goos, G., Hartmanis, J., van Leeuwen, J., Ku\u010dera, L. (eds.) WG 2002. LNCS, vol. 2573, pp. 35\u201346. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36379-3_4","DOI":"10.1007\/3-540-36379-3_4"},{"issue":"1","key":"14_CR3","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. Combin. Theory, Ser. B 24(1), 61\u201375 (1978)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jgt.22181","volume":"88","author":"P Dankelmann","year":"2018","unstructured":"Dankelmann, P., Guo, Y., Surmacs, M.: Oriented diameter of graphs with given maximum degree. J. Graph Theory 88, 5\u201317 (2018)","journal-title":"J. Graph Theory"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s002360050082","volume":"34","author":"HN Djidjev","year":"1997","unstructured":"Djidjev, H.N., Venkatesan, S.M.: Reduced constants for simple cycle graph separation. Acta Inform. 34(3), 231\u2013243 (1997)","journal-title":"Acta Inform."},{"key":"14_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":"14_CR7","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Matamala, M., Prisner, E., Rapaport, I.: Bilateral orientations and domination. Electron. Notes Discrete Math. 7 (2001)","DOI":"10.1016\/S1571-0653(04)00216-1"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-36379-3_19","volume":"2573","author":"FV Fomin","year":"2002","unstructured":"Fomin, F.V., Matamala, M., Rapaport, I.: The complexity of approximating the oriented diameter of chordal graphs. Int. Workshop Graph-Theoretic Concepts Comput. Sci. 2573, 211\u2013222 (2002)","journal-title":"Int. Workshop Graph-Theoretic Concepts Comput. Sci."},{"key":"14_CR9","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., Rapaport, I.: AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. 141, 135\u2013148 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"14_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discret. Appl. Math. 53(1\u20133), 79\u2013133 (1994)","journal-title":"Discret. Appl. Math."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Fujita, S.: On oriented diameter of star graphs. In: First International Symposium on Computing and Networking, pp. 48\u201356 (2013)","DOI":"10.1109\/CANDAR.2013.16"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Gazit, H., Miller, G.L.: Planar separators and the Euclidean norm. In: Asano, T., Ibaraki, T., Imai, H., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 338\u2013347. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52921-7_83","DOI":"10.1007\/3-540-52921-7_83"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(01)00298-0","volume":"121","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Yeo, A.: Orientations of digraphs almost preserving diameter. Discret. Appl. Math. 121, 129\u2013138 (2002)","journal-title":"Discret. Appl. Math."},{"key":"14_CR14","unstructured":"Guttmann-Beck, N., Hassin, R.: Minimum diameter and cycle-diameter orientations on planar graphs. arXiv e-prints pp. arXiv-1105 (2011)"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Guttmann-Beck, N., Hassin, R.: Series-parallel orientations preserving the cycle-radius. Inf. Process. Lett. 112(4), 153\u2013160 (2012). https:\/\/doi.org\/10.1016\/j.ipl.2011.10.020","DOI":"10.1016\/j.ipl.2011.10.020"},{"issue":"1\u20133","key":"14_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0012-365X(94)00315-A","volume":"149","author":"KM Koh","year":"1996","unstructured":"Koh, K.M., Tan, B.P., Rapaport, I.: The diameter of an orientation of a complete multipartite graph. Discret. Math. 149(1\u20133), 131\u2013139 (1996)","journal-title":"Discret. Math."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0012-365X(99)00136-3","volume":"211","author":"KM Koh","year":"2000","unstructured":"Koh, K.M., Tay, E.G.: On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. Discret. Math. 211, 75\u2013102 (2000)","journal-title":"Discret. Math."},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s003730200060","volume":"18","author":"KM Koh","year":"2002","unstructured":"Koh, K.M., Tay, E.G.: Optimal orientations of graphs and digraphs: a survey. Graphs Comb. 18(4), 745\u2013756 (2002)","journal-title":"Graphs Comb."},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(199808)32:1<1::AID-NET1>3.0.CO;2-G","volume":"32","author":"J K\u00f6nig","year":"1998","unstructured":"K\u00f6nig, J., Krumme, D.W., Lazard, E.: Diameter-preserving orientations of the torus. Networks 32(1), 1\u201311 (1998)","journal-title":"Networks"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/0221026","volume":"21","author":"DW Krumme","year":"1992","unstructured":"Krumme, D.W.: Fast gossiping for the hypercube. SIAM J. Comput. 21(2), 365\u2013380 (1992)","journal-title":"SIAM J. Comput."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Kurz1y, S., Latsch, M.: Bounds for the minimum oriented diameter. Discret. Math. Theoret. Computer Sci. 14(1), 109\u2013142 (2012)","DOI":"10.46298\/dmtcs.567"},{"issue":"3","key":"14_CR22","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. Combinat. Theory 100(3), 265\u2013273 (2010)","journal-title":"J. Combinat. Theory"},{"issue":"2\u20133","key":"14_CR23","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(88)90123-9","volume":"68","author":"JE McCanna","year":"1988","unstructured":"McCanna, J.E.: Orientations of the n-cube with minimum diameter. Discret. Math. 68(2\u20133), 309\u2013313 (1988)","journal-title":"Discret. Math."},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller, G.L.: Finding small simple cycle separators for 2-connected planar graphs. J. Comput. Syst. Sci. 32(3), 265\u2013279 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Mondal, D., Parthiban, N., Rajasingh, I.: Oriented diameter of planar triangulations. CoRR abs\/2203.04253 (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.04253","DOI":"10.48550\/arXiv.2203.04253"},{"issue":"1\u20133","key":"14_CR26","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.disc.2005.04.012","volume":"297","author":"KL Ng","year":"2005","unstructured":"Ng, K.L., Koh, K.M.: On optimal orientation of cycle vertex multiplications. Discret. Math. 297(1\u20133), 104\u2013118 (2005)","journal-title":"Discret. Math."},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/0401022","volume":"1","author":"FS Roberts","year":"1988","unstructured":"Roberts, F.S., Xu, Y.: On the optimal strongly connected orientations of city street graphs I: large grids. SIAM J. Discret. Math. 1(2), 199\u2013222 (1988)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Roberts, F.S., Xu, Y.: On the optimal strongly connected orientations of city street graphs. III. three east-west avenues or north-south streets. Networks 22(2), 109\u2013143 (1992)","DOI":"10.1002\/net.3230220202"},{"key":"14_CR29","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 138\u2013148. ACM, San Francisco, California, USA (1990)"},{"issue":"3","key":"14_CR30","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1002\/jgt.22707","volume":"98","author":"X Wang","year":"2021","unstructured":"Wang, X., Chen, Y., Dankelmann, P., Guo, Y., Surmacs, M., Volkmann, L.: Oriented diameter of maximal outerplanar graphs. J. Graph Theory 98(3), 426\u2013444 (2021)","journal-title":"J. Graph Theory"},{"key":"14_CR31","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall (2000)"},{"issue":"2","key":"14_CR32","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00454-004-1154-y","volume":"33","author":"H Zhang","year":"2005","unstructured":"Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discret. Comput. Geometry 33(2), 321\u2013344 (2005)","journal-title":"Discret. Comput. Geometry"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T10:22:51Z","timestamp":1728642171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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":"3","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)"}}]}}