{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:39:19Z","timestamp":1775716759224,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10878-024-01177-z","type":"journal-article","created":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T16:01:57Z","timestamp":1716220917000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the oriented diameter of planar triangulations"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-8697","authenticated-orcid":false,"given":"Debajyoti","family":"Mondal","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2170-6403","authenticated-orcid":false,"given":"N.","family":"Parthiban","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9721-9505","authenticated-orcid":false,"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,20]]},"reference":[{"key":"1177_CR1","doi-asserted-by":"crossref","unstructured":"Ajish\u00a0Kumar KS, Rajendraprasad D, Sudeep KS (2020) Oriented diameter of star graphs. In: Proceedings of the 6th international conference on algorithms and discrete applied mathematics. Springer, vol 12016, pp 307\u2013317","DOI":"10.1007\/978-3-030-39219-2_25"},{"issue":"4","key":"1177_CR2","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1002\/jgt.22941","volume":"103","author":"J Babu","year":"2023","unstructured":"Babu J, Benson D, Rajendraprasad D (2023) Improved bounds for the oriented radius of mixed multigraphs. J Graph Theory 103(4):674\u2013689","journal-title":"J Graph Theory"},{"key":"1177_CR3","doi-asserted-by":"crossref","unstructured":"Bonichon N, Sa\u00ebc BL, Mosbah M (2002) Wagner\u2019s theorem on realizers. In: Proceedings of the 29th international colloquium on automata, languages and programming (ICALP). LNCS, Springer, vol\u00a02380, pp 1043\u20131053","DOI":"10.1007\/3-540-45465-9_89"},{"issue":"1","key":"1177_CR4","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 (1978) Distances in orientations of graphs. J Comb Theory Ser B 24(1):61\u201375","journal-title":"J Comb Theory Ser B"},{"key":"1177_CR5","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 (2018) Oriented diameter of graphs with given maximum degree. J Graph Theory 88:5\u201317","journal-title":"J Graph Theory"},{"issue":"1","key":"1177_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s00373-023-02741-w","volume":"40","author":"P Dankelmann","year":"2024","unstructured":"Dankelmann P, Morgan J, Rivett-Carnac E (2024) The oriented diameter of graphs with given connected domination number and distance domination number. Graphs Comb 40(1):18","journal-title":"Graphs Comb"},{"issue":"3","key":"1177_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s002360050082","volume":"34","author":"HN Djidjev","year":"1997","unstructured":"Djidjev HN, Venkatesan SM (1997) Reduced constants for simple cycle graph separation. Acta Informatica 34(3):231\u2013243","journal-title":"Acta Informatica"},{"key":"1177_CR8","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 SD (2009) Minimizing the oriented diameter of a planar graph. Electron Notes Discr Math 34:267\u2013271","journal-title":"Electron Notes Discr Math"},{"key":"1177_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/S1571-0653(04)00216-1","volume":"7","author":"FV Fomin","year":"2001","unstructured":"Fomin FV, Matamala M, Prisner E, Rapaport I (2001) Bilateral orientations and domination. Electron Notes Disc Math 7:26\u201329","journal-title":"Electron Notes Disc Math"},{"key":"1177_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-36379-3_19","volume":"2573","author":"FV Fomin","year":"2002","unstructured":"Fomin FV, Matamala M, Rapaport I (2002) The complexity of approximating the oriented diameter of chordal graphs. Int Workshop Graph-Theoretic Concepts Comput Sci 2573:211\u2013222","journal-title":"Int Workshop Graph-Theoretic Concepts Comput Sci"},{"key":"1177_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(03)00376-7","volume":"141","author":"FV Fomin","year":"2004","unstructured":"Fomin FV, Matamala M, Rapaport I (2004) AT-free graphs: linear bounds for the oriented diameter. Discret Appl Math 141:135\u2013148","journal-title":"Discret Appl Math"},{"issue":"1\u20133","key":"1177_CR12","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 (1994) Methods and problems of communication in usual networks. Discret Appl Math 53(1\u20133):79\u2013133","journal-title":"Discret Appl Math"},{"key":"1177_CR13","doi-asserted-by":"crossref","unstructured":"Fujita S (2013) On oriented diameter of star graphs. In: First international symposium on computing and networking. pp 48\u201356","DOI":"10.1109\/CANDAR.2013.16"},{"key":"1177_CR14","doi-asserted-by":"crossref","unstructured":"Gazit H, Miller GL (1990) Planar separators and the Euclidean norm. In: Proceedings of the international symposium on algorithms (SIGAL). LNCS, Springer, vol\u00a0450, pp 338\u2013347","DOI":"10.1007\/3-540-52921-7_83"},{"key":"1177_CR15","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 (2002) Orientations of digraphs almost preserving diameter. Discret Appl Math 121:129\u2013138","journal-title":"Discret Appl Math"},{"key":"1177_CR16","unstructured":"Guttmann-Beck N, Hassin R (2011) Minimum diameter and cycle-diameter orientations on planar graphs. arXiv e-prints pp. arXiv:1105"},{"issue":"4","key":"1177_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ipl.2011.10.020","volume":"112","author":"N Guttmann-Beck","year":"2012","unstructured":"Guttmann-Beck N, Hassin R (2012) Series-parallel orientations preserving the cycle-radius. Inf Process Lett 112(4):153\u2013160. https:\/\/doi.org\/10.1016\/j.ipl.2011.10.020","journal-title":"Inf Process Lett"},{"issue":"1\u20133","key":"1177_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0012-365X(94)00315-A","volume":"149","author":"KM Koh","year":"1996","unstructured":"Koh KM, Tan BP, Rapaport I (1996) The diameter of an orientation of a complete multipartite graph. Discret Math 149(1\u20133):131\u2013139","journal-title":"Discret Math"},{"key":"1177_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0012-365X(99)00136-3","volume":"211","author":"KM Koh","year":"2000","unstructured":"Koh KM, Tay EG (2000) On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. Discret Math 211:75\u2013102","journal-title":"Discret Math"},{"issue":"4","key":"1177_CR20","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s003730200060","volume":"18","author":"KM Koh","year":"2002","unstructured":"Koh KM, Tay EG (2002) Optimal orientations of graphs and digraphs: a survey. Graphs Comb 18(4):745\u2013756","journal-title":"Graphs Comb"},{"issue":"1","key":"1177_CR21","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 DW, Lazard E (1998) Diameter-preserving orientations of the torus. Networks 32(1):1\u201311","journal-title":"Networks"},{"issue":"2","key":"1177_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1137\/0221026","volume":"21","author":"DW Krumme","year":"1992","unstructured":"Krumme DW (1992) Fast gossiping for the hypercube. SIAM J Comput 21(2):365\u2013380","journal-title":"SIAM J Comput"},{"issue":"1","key":"1177_CR23","first-page":"109","volume":"14","author":"S Kurz","year":"2012","unstructured":"Kurz S, Latsch M (2012) Bounds for the minimum oriented diameter. Disc Math Theor Comput Sci 14(1):109\u2013142","journal-title":"Disc Math Theor Comput Sci"},{"issue":"3","key":"1177_CR24","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.jctb.2009.08.003","volume":"100","author":"PK Kwok","year":"2010","unstructured":"Kwok PK, Liu Q, West DB (2010) Oriented diameter of graphs with diameter 3. J Comb Theory 100(3):265\u2013273","journal-title":"J Comb Theory"},{"issue":"2\u20133","key":"1177_CR25","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(88)90123-9","volume":"68","author":"JE McCanna","year":"1988","unstructured":"McCanna JE (1988) Orientations of the n-cube with minimum diameter. Discret Math 68(2\u20133):309\u2013313","journal-title":"Discret Math"},{"issue":"3","key":"1177_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","volume":"32","author":"GL Miller","year":"1986","unstructured":"Miller GL (1986) Finding small simple cycle separators for 2-connected planar graphs. J Comput Syst Sci 32(3):265\u2013279","journal-title":"J Comput Syst Sci"},{"issue":"1\u20133","key":"1177_CR27","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.disc.2005.04.012","volume":"297","author":"KL Ng","year":"2005","unstructured":"Ng KL, Koh KM (2005) On optimal orientation of cycle vertex multiplications. Discret Math 297(1\u20133):104\u2013118","journal-title":"Discret Math"},{"issue":"2","key":"1177_CR28","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1137\/0401022","volume":"1","author":"FS Roberts","year":"1988","unstructured":"Roberts FS, Xu Y (1988) On the optimal strongly connected orientations of city street graphs I: large grids. SIAM J Discret Math 1(2):199\u2013222","journal-title":"SIAM J Discret Math"},{"issue":"2","key":"1177_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230220202","volume":"22","author":"FS Roberts","year":"1992","unstructured":"Roberts FS, Xu Y (1992) On the optimal strongly connected orientations of city street graphs. III. Three east-west avenues or north-south streets. Networks 22(2):109\u2013143","journal-title":"Networks"},{"key":"1177_CR30","unstructured":"Schnyder W (1990) Embedding planar graphs on the grid. In: Proceedings of the 1st annual ACM-SIAM symposium on discrete algorithms (SODA), San Francisco, California, USA. ACM, pp 138\u2013148"},{"issue":"3","key":"1177_CR31","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 (2021) Oriented diameter of maximal outerplanar graphs. J Graph Theory 98(3):426\u2013444","journal-title":"J Graph Theory"},{"key":"1177_CR32","volume-title":"Introduction to graph theory","author":"DB West","year":"2000","unstructured":"West DB (2000) Introduction to graph theory. Prentice-Hall, Hoboken"},{"issue":"2","key":"1177_CR33","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 (2005) Canonical ordering trees and their applications in graph drawing. Disc Comput Geometry 33(2):321\u2013344","journal-title":"Disc Comput Geometry"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01177-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01177-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01177-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T12:54:24Z","timestamp":1732020864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01177-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["1177"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01177-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,20]]},"assertion":[{"value":"2 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interes"}}],"article-number":"79"}}