{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T23:13:39Z","timestamp":1747178019939,"version":"3.40.5"},"reference-count":40,"publisher":"Informa UK Limited","issue":"6","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2023,11,2]]},"DOI":"10.1080\/10556788.2023.2205646","type":"journal-article","created":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T13:41:50Z","timestamp":1683034910000},"page":"1142-1162","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Crossing edge minimization in radial outerplanar layered graphs using segment paths"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4495-2017","authenticated-orcid":false,"given":"Francisco","family":"Madera-Ram\u00edrez","sequence":"first","affiliation":[{"name":"Universidad Aut\u00f3noma de Yucat\u00e1n-Facultad de Matem\u00e1ticas, M\u00e9rida, Mexico"}]},{"given":"Joel Antonio","family":"Trejo-S\u00e1nchez","sequence":"additional","affiliation":[{"name":"CONACYT-Centro de Investigaci\u00f3n en Matem\u00e1ticas, M\u00e9rida, Mexico"}]},{"given":"Jos\u00e9","family":"L\u00f3pez-Mart\u00ednez","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de Yucat\u00e1n-Facultad de Matem\u00e1ticas, M\u00e9rida, Mexico"}]},{"given":"Jorge","family":"R\u00edos-Mart\u00ednez","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de Yucat\u00e1n-Facultad de Matem\u00e1ticas, M\u00e9rida, Mexico"}]}],"member":"301","published-online":{"date-parts":[[2023,5,2]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21840-3_1"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9233-8"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1703.06040"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30559-0_28"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14497"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.178"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101975"},{"key":"e_1_3_3_10_1","unstructured":"P. Bourke Minimum distance between a point and a line 1988; Available at http:\/\/paulbourke.net\/geometry\/pointlineplane\/."},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1201\/b15385-5"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0895480102417379"},{"key":"e_1_3_3_13_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2009","unstructured":"T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, MIT Press,\u00a0Cambridge, MA, 2009."},{"key":"e_1_3_3_14_1","doi-asserted-by":"crossref","unstructured":"W. Didimo P. Eades and G. Liotta Drawing graphs with right angle crossings in Algorithms and Data Structures F. Dehne M. Gavrilova J.R. Sack and C.D. T\u00f3th eds. Springer Berlin 2009 pp. 206\u2013217.","DOI":"10.1007\/978-3-642-03367-4_19"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187020"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvc775vw"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0_13"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.221135"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0604033"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1201\/b15385-11"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1846"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73915-1_19"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80087-4"},{"key":"e_1_3_3_24_1","first-page":"45","article-title":"Minimizing crossings in constrained two-sided circular graph layouts","volume":"10","author":"Klute F.","year":"2019","unstructured":"F. Klute and M. N\u00f6llenburg, Minimizing crossings in constrained two-sided circular graph layouts, J. Comput. Geom. 10 (2019), pp. 45\u201369. http:\/\/hdl.handle.net\/20.500.12708\/86553.","journal-title":"J. Comput. Geom."},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45803-7_20"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.04.003"},{"key":"e_1_3_3_28_1","unstructured":"S. Masuda T. Kashiwabara K. Nakajima and T. Fujisawa On the NP-completeness of a computer network layout problem in Proceedings\u2013IEEE International Symposium on Circuits and Systems 1987."},{"key":"e_1_3_3_29_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.SoCG.2019.53"},{"key":"e_1_3_3_30_1","unstructured":"M. Patrignani Planarity testing and embedding in Handbook on Graph Drawing and Visualization R. Tamassia ed. Chapman and Hall\/CRC 2013 pp. 1\u201342."},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63938-1_67"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.05.017"},{"key":"e_1_3_3_33_1","unstructured":"K. Samp The design and evaluation of graphical radial menus Ph.D. diss. College of Engineering and Informatics University of Galway Galway Irland 2011. https:\/\/aran.library.nuigalway.ie\/handle\/10379\/2672."},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.37236\/2713"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-594-7.50023-0"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01956.x"},{"key":"e_1_3_3_37_1","doi-asserted-by":"publisher","DOI":"10.1201\/b15385-13"},{"key":"e_1_3_3_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65609-5"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"e_1_3_3_40_1","first-page":"9","article-title":"Critical graphs with given chromatic index","volume":"5","author":"Vizing V.G.","year":"1965","unstructured":"V.G. Vizing, Critical graphs with given chromatic index, Metody Diskretnogo Analiza 5 (1965), pp. 9\u201317.","journal-title":"Metody Diskretnogo Analiza"},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12650-014-0266-6"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2023.2205646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:17:49Z","timestamp":1700835469000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2023.2205646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,2]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11,2]]}},"alternative-id":["10.1080\/10556788.2023.2205646"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2023.2205646","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2023,5,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-05-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-04-18","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}