{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:35:05Z","timestamp":1774596905172,"version":"3.50.1"},"reference-count":178,"publisher":"Informa UK Limited","issue":"3","license":[{"start":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T00:00:00Z","timestamp":1689033600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["AKCE International Journal of Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,9,2]]},"DOI":"10.1080\/09728600.2023.2218459","type":"journal-article","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T16:43:31Z","timestamp":1689093811000},"page":"258-281","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["An annotated review on graph drawing and its applications"],"prefix":"10.1080","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8388-4216","authenticated-orcid":false,"given":"Pinki","family":"Pinki","sequence":"first","affiliation":[{"name":"Department of Mathematics, BITS Pilani, Pilani Campus, Pilani, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3408-7912","authenticated-orcid":false,"given":"Krishnendra","family":"Shekhawat","sequence":"additional","affiliation":[{"name":"Department of Mathematics, BITS Pilani, Pilani Campus, Pilani, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2023,7,11]]},"reference":[{"key":"e_1_3_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.025"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/100819564"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54423-1_13"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03841-4_8"},{"key":"e_1_3_1_6_1","doi-asserted-by":"crossref","unstructured":"Alegria C. Da Lozzo G. Di Battista G. Frati F. Grosso F. Patrignani M. (2022). Unit-length rectangular drawings of graphs. arXiv preprint arXiv:2208.14142.","DOI":"10.1007\/978-3-031-22203-0_10"},{"key":"e_1_3_1_7_1","unstructured":"Alfonso X. (1843). King of Castile and Le\u00f3n Libros del ajedrez dados y tablas."},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511607202"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.12.004"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195913600029"},{"key":"e_1_3_1_11_1","unstructured":"Angelini P. Bekos M. A. Kaufmann M. Pfister M. Ueckerdt T. (2018). Beyond-planarity: Tur\u00e1n-type results for non-planar bipartite graphs. In: 29th International Symposium on Algorithms and Computation (ISAAC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_1_12_1","first-page":"13","volume-title":"International Symposium on Graph Drawing","author":"Angelini P.","year":"2010","unstructured":"Angelini, P., Colasante, E., Battista, G. D., Frati, F., Patrignani, M. (2010). Monotone drawings of graphs. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 13\u201324."},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629341"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.12.015"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9790-3"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68766-3_21"},{"key":"e_1_3_1_17_1","unstructured":"Auber D. Mary P. (2007). Tulip: Data Visualization Software Version 5.6.3. https:\/\/tulip.labri.fr\/TulipDrupal\/"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1961.10.10032"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01578784"},{"key":"e_1_3_1_20_1","first-page":"105","article-title":"Mathematical recreations and essays","volume":"17","author":"Ball W. R.","year":"1893","unstructured":"Ball, W. R. (1893). Mathematical recreations and essays. Bull. des Sci. Math. 17: 105\u2013107.","journal-title":"Bull. des Sci. Math"},{"key":"e_1_3_1_21_1","volume-title":"Mathematical Recreations and Essays","author":"Ball W. W. R.","year":"1914","unstructured":"Ball, W. W. R. (1914). Mathematical Recreations and Essays. London: Macmillan."},{"key":"e_1_3_1_22_1","unstructured":"Barth L. Niedermann B. Rutter I. Wolf M. (2017). Towards a topology-shape-metrics framework for orthoradial drawings. In: 33rd International Symposium on Computational Geometry (SoCG 2017) Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_1_23_1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"Battista G. D.","year":"1998","unstructured":"Battista, G. D., Eades, P., Tamassia, R., Tollis, I. G. (1998). Graph Drawing: Algorithms for the Visualization of Graphs. Hoboken, NJ: Prentice Hall PTR."},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68766-3_20"},{"key":"e_1_3_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.039"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15612-5_20"},{"key":"e_1_3_1_27_1","first-page":"150","volume-title":"International Symposium on Graph Drawing","author":"Bekos M. A.","year":"2012","unstructured":"Bekos, M. A., Kaufmann, M., Kobourov, S. G., Symvonis, A. (2012). Smooth orthogonal layouts. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 150\u2013161."},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.868028"},{"key":"e_1_3_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762117"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2017.08.001"},{"key":"e_1_3_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00026-6"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27261-0_13"},{"key":"e_1_3_1_33_1","first-page":"1736","volume-title":"Graph Theory","author":"Biggs N.","year":"1986","unstructured":"Biggs, N., Lloyd, E. K., Wilson, R. J. (1986). Graph Theory. Oxford: Oxford University Press, pp. 1736\u20131936."},{"key":"e_1_3_1_34_1","unstructured":"Biofabric Version 2 Beta Release 2 (2019). Available at: http:\/\/www.biofabric.org\/"},{"key":"e_1_3_1_35_1","first-page":"92","volume-title":"International Symposium on Graph Drawing","author":"Bl\u00e4sius T.","year":"2010","unstructured":"Bl\u00e4sius, T., Krug, M., Rutter, I., Wagner, D. (2010). Orthogonal graph drawing with flexibility constraints In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 92\u2013104."},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51963-0_23"},{"key":"e_1_3_1_37_1","volume-title":"Progress in Graph Theory","author":"Bondy J. A.","year":"1984","unstructured":"Bondy, J. A., Murty, U. S., eds. (1984). Progress in Graph Theory, Vol. 2. Toronto; Orlando: Academic Press."},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0177-6"},{"key":"e_1_3_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36379-3_4"},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80045-1"},{"key":"e_1_3_1_41_1","first-page":"140","volume-title":"SODA","author":"Boyer J. M.","year":"1999","unstructured":"Boyer, J. M., Myrvold, W. J. (1999). Stop minding your p\u2019s and q\u2019s: A simplified O (n) planar embedding algorithm. In: SODA, pp. 140\u2013146."},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812773289_0014"},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00028"},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0080456800020007"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00316"},{"key":"e_1_3_1_46_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786445708642275"},{"key":"e_1_3_1_47_1","unstructured":"Chang Y. J. Yen H. C. (2017). On bend-minimized orthogonal drawings of planar 3-graphs. In: 33rd International Symposium on Computational Geometry (SoCG 2017) Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010080"},{"key":"e_1_3_1_49_1","first-page":"320","volume-title":"International Symposium on Graph Drawing","author":"Chernobelskiy R.","year":"2011","unstructured":"Chernobelskiy, R., Cunningham, K. I., Goodrich, M. T., Kobourov, S. G., Trott, L. (2011). Force-directed Lombardi-style graph drawing. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 320\u2013331."},{"key":"e_1_3_1_50_1","unstructured":"Chiba N. (1984). Linear algorithms for convex drawings of planar graphs. Progress in graph theory."},{"key":"e_1_3_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90004-2"},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264230"},{"key":"e_1_3_1_53_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195997000144"},{"key":"e_1_3_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(98)00016-9"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00020-D"},{"key":"e_1_3_1_56_1","first-page":"111","volume-title":"International Symposium on Graph Drawing","author":"Cornelsen S.","year":"2011","unstructured":"Cornelsen, S., Karrenbauer, A. (2011). Accelerated bend minimization. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 111\u2013122."},{"key":"e_1_3_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/234535.234538"},{"key":"e_1_3_1_58_1","unstructured":"De Fraysseix H. de Mendez P. O. (2001). Pigale Software. Available at: https:\/\/www.swmath.org\/software\/5435."},{"key":"e_1_3_1_59_1","unstructured":"de Fraysseix H. de Mendez P. O. (2002). PIGALE-public implementation of a graph algorithm library and editor. SourceForge project page http:\/\/sourceforge.net\/projects\/pigale."},{"key":"e_1_3_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2008.06.035"},{"key":"e_1_3_1_61_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106004248"},{"key":"e_1_3_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122694"},{"key":"e_1_3_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"e_1_3_1_64_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794262847"},{"key":"e_1_3_1_65_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195907002276"},{"key":"e_1_3_1_66_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.04.002"},{"key":"e_1_3_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1185-7"},{"key":"e_1_3_1_68_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.12.016"},{"key":"e_1_3_1_69_1","first-page":"1","volume-title":"International Symposium on Graph Drawing","author":"Dickerson M.","year":"2003","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M. T., Meng, J. Y. (2003). Confluent drawings: Visualizing non-planar diagrams in a planar way. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 1\u201312."},{"key":"e_1_3_1_70_1","doi-asserted-by":"crossref","unstructured":"Didimo W. Kaufmann M. Liotta G. Ortali G. (2022). Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time. arXiv preprint arXiv:2205.07500.","DOI":"10.1007\/s00453-023-01110-6"},{"key":"e_1_3_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3301281"},{"key":"e_1_3_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04414-5_34"},{"key":"e_1_3_1_73_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.49"},{"key":"e_1_3_1_74_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2006.09.002"},{"key":"e_1_3_1_75_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812773296_0015"},{"key":"e_1_3_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45803-7_26"},{"key":"e_1_3_1_77_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2018.02.003"},{"key":"e_1_3_1_78_1","first-page":"149","article-title":"A heuristic for graph drawing","volume":"42","author":"Eades P.","year":"1984","unstructured":"Eades, P. (1984). A heuristic for graph drawing. Congressus Numerantium 42: 149\u2013160.","journal-title":"Congressus Numerantium"},{"key":"e_1_3_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21840-3_25"},{"key":"e_1_3_1_80_1","unstructured":"Elliot M. A. (2010). Elliott Avedon Virtual Museum of Games. Available at: https:\/\/healthy.uwaterloo.ca\/museum\/VirtualExhibits\/rowgames\/mill.html."},{"key":"e_1_3_1_81_1","first-page":"195","volume-title":"International Symposium on Graph Drawing","author":"Erten C.","year":"2004","unstructured":"Erten, C., Kobourov, S. G. (2004). Simultaneous embedding of planar graphs with few bends. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 195\u2013205."},{"key":"e_1_3_1_82_1","first-page":"128","article-title":"Solutio problematis ad geometriam situs pertinentis","author":"Euler L.","year":"1741","unstructured":"Euler, L. (1741). Solutio problematis ad geometriam situs pertinentis. Commentarii academiae scientiarum Petropolitanae, pp. 128\u2013140.","journal-title":"Commentarii academiae scientiarum Petropolitanae"},{"key":"e_1_3_1_83_1","first-page":"229","article-title":"On straight-line representation of planar graphs","volume":"11","author":"F\u00e1ry I.","year":"1948","unstructured":"F\u00e1ry, I. (1948). On straight-line representation of planar graphs. Acta Sci. Math. 11: 229\u2013233.","journal-title":"Acta Sci. Math"},{"key":"e_1_3_1_84_1","first-page":"448","volume-title":"International Symposium on Graph Drawing","author":"Finkel B.","year":"2004","unstructured":"Finkel, B., Tamassia, R. (2004). Curvilinear graph drawing using the force-directed method. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 448\u2013453."},{"key":"e_1_3_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.6027"},{"key":"e_1_3_1_86_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222063"},{"key":"e_1_3_1_87_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00052"},{"key":"e_1_3_1_88_1","first-page":"239","volume-title":"International Symposium on Graph Drawing","author":"Gansner E. R.","year":"2004","unstructured":"Gansner, E. R., Koren, Y., North, S. (2004). Graph drawing by stress majorization. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 239\u2013250."},{"key":"e_1_3_1_89_1","first-page":"201","volume-title":"International Symposium on Graph Drawing","author":"Garg A.","year":"1996","unstructured":"Garg, A., Tamassia, R. (1996). A new minimum cost flow algorithm with applications to graph drawing. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 201\u2013216."},{"key":"e_1_3_1_90_1","unstructured":"Gephi:The open graph viz platform Version 0.9. Available at: https:\/\/gephi.org\/"},{"key":"e_1_3_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54423-1_12"},{"key":"e_1_3_1_92_1","first-page":"16","volume-title":"Graph and Combinatorics Conference, Contract No. NONR 1858-(21)","author":"Goldstein A. J.","year":"1963","unstructured":"Goldstein, A. J. (1963). An efficient and constructive algorithm for testing whether a graph can be embedded in a plane. In: Graph and Combinatorics Conference, Contract No. NONR 1858-(21), Office of Naval Research Logistics Proj., Dept. of Mathematics, Princeton University, May 16\u201318."},{"key":"e_1_3_1_93_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1115"},{"key":"e_1_3_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-37623-2_13"},{"key":"e_1_3_1_95_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00389-9"},{"key":"e_1_3_1_96_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2008.06.029"},{"key":"e_1_3_1_97_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00289"},{"key":"e_1_3_1_98_1","unstructured":"Hagberg A. Schult D. Swart P. (2004). NetworkX network analysis in Python Version 2.8.6. Available at: https:\/\/networkx.org\/documentation\/stable\/tutorial.html"},{"key":"e_1_3_1_99_1","unstructured":"Hamilton R. W. (1859). The icosian Game instruction leaflet A copy of the leaflet can be found in [16] pp. 32\u201335."},{"key":"e_1_3_1_100_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00051"},{"key":"e_1_3_1_101_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009189"},{"key":"e_1_3_1_102_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26176-4_21"},{"key":"e_1_3_1_103_1","volume-title":"Chez Gogu\u00e9 & N\u00e9e de la Rochelle","author":"Ha\u00fcy R. J.","year":"1784","unstructured":"Ha\u00fcy, R. J. (1784). Essai d\u2019une th\u00e9orie sur la structure des crystaux: appliqu\u00e9e \u00e0 plusieurs genres de substances crystallis\u00e9es. Chez Gogu\u00e9 & N\u00e9e de la Rochelle."},{"key":"e_1_3_1_104_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32241-9_29"},{"key":"e_1_3_1_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"e_1_3_1_106_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"e_1_3_1_107_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68705-6_24"},{"key":"e_1_3_1_108_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.004"},{"key":"e_1_3_1_109_1","doi-asserted-by":"publisher","DOI":"10.1142\/S179383091550007X"},{"key":"e_1_3_1_110_1","doi-asserted-by":"publisher","DOI":"10.3390\/info9070153"},{"key":"e_1_3_1_111_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6"},{"key":"e_1_3_1_112_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(95)00257-X"},{"key":"e_1_3_1_113_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086606"},{"key":"e_1_3_1_114_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72504-6_53"},{"key":"e_1_3_1_115_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.10.038"},{"key":"e_1_3_1_116_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35802-0_32"},{"key":"e_1_3_1_117_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45803-7_41"},{"key":"e_1_3_1_118_1","volume-title":"A Generic Framework for the Topology-Shapemetrics Based Layout","author":"Klose P.","year":"2012","unstructured":"Klose, P. (2012). A Generic Framework for the Topology-Shapemetrics Based Layout. Christian-Albrechts-Universit\u00e4t zu Kiel."},{"key":"e_1_3_1_119_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2005.103"},{"key":"e_1_3_1_120_1","first-page":"458","volume-title":"Proceedings of the Fourth International Conference on Genetic Algorithms","author":"Kosak C.","year":"1991","unstructured":"Kosak, C. (1991). A parallel genetic algorithm for network-diagram layout. In: Proceedings of the Fourth International Conference on Genetic Algorithms, 458\u2013465."},{"key":"e_1_3_1_121_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150202"},{"key":"e_1_3_1_122_1","first-page":"272","volume-title":"International Symposium on Graph Drawing","author":"Kruja E.","year":"2001","unstructured":"Kruja, E., Marks, J., Blair, A., Waters, R. (2001). A short note on the history of graph drawing. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 272\u2013286."},{"key":"e_1_3_1_123_1","first-page":"22","volume-title":"Proc. 1st General Conference on Social Graphics, US Dept. of the Census","author":"Kruskal J. B.","year":"1980","unstructured":"Kruskal, J. B. (1980). Designing network diagrams. In: Proc. 1st General Conference on Social Graphics, US Dept. of the Census, 22\u201350."},{"key":"e_1_3_1_124_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"e_1_3_1_125_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840399"},{"key":"e_1_3_1_126_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744433"},{"key":"e_1_3_1_127_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.13"},{"key":"e_1_3_1_128_1","volume-title":"Theory of Graphs, International Symposium","author":"Lempel A.","year":"1967","unstructured":"Lempel, A. (1967). An algorithm for planarity testing of graphs. In: Rosenstiel, P., ed. Theory of Graphs, International Symposium, Rome, July 1966."},{"key":"e_1_3_1_129_1","volume-title":"Vorstudien zur topologie","author":"Listing J. B.","year":"1848","unstructured":"Listing, J. B. (1848). Vorstudien zur topologie. Vandenhoeck und Ruprecht."},{"key":"e_1_3_1_130_1","unstructured":"Low G. (2004). Graphviz: Graph visualization software. Available at: https:\/\/graphviz.org\/"},{"key":"e_1_3_1_131_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940648"},{"key":"e_1_3_1_132_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195906002026"},{"key":"e_1_3_1_133_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9390-6"},{"key":"e_1_3_1_134_1","doi-asserted-by":"crossref","unstructured":"Mondal D. Nishat R. I. Rahman M. S. Alam M. J. (2011). Minimum-area drawings of plane 3-trees.","DOI":"10.1007\/978-3-642-18469-7_29"},{"key":"e_1_3_1_135_1","first-page":"296","volume-title":"International Symposium on Graph Drawing","author":"Nakano S. I.","year":"2000","unstructured":"Nakano, S. I., Yoshikawa, M. (2000). A linear-time algorithm for bend-optimal orthogonal drawings of biconnected cubic plane graphs. In: International Symposium on Graph Drawing, Berlin, Heidelberg: Springer, pp. 296\u2013307."},{"key":"e_1_3_1_136_1","unstructured":"Nees E. Ludo W. Visualizing scientific landscapes. Available at: https:\/\/www.vosviewer.com\/"},{"key":"e_1_3_1_137_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-68766-3_19"},{"key":"e_1_3_1_138_1","doi-asserted-by":"publisher","DOI":"10.1142\/5648"},{"key":"e_1_3_1_139_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-6533-5_11"},{"issue":"5","key":"e_1_3_1_140_1","first-page":"81","article-title":"Applying topology-shape-metric and fuzzy genetic algorithm for automatic planar hierarchical and orthogonal graphs","volume":"6","author":"Omran N. F.","year":"2015","unstructured":"Omran, N. F., Abd-el Ghany, S. F. (2015). Applying topology-shape-metric and fuzzy genetic algorithm for automatic planar hierarchical and orthogonal graphs. Int. J. Adv. Comput. Sci. Appl. 6(5): 81\u201387.","journal-title":"Int. J. Adv. Comput. Sci. Appl"},{"key":"e_1_3_1_141_1","unstructured":"Ono K. (2001). Cytoscape: Open source software network data integration analysis and visualization in a box. Available at: https:\/\/cytoscape.org\/"},{"key":"e_1_3_1_142_1","unstructured":"Ontrup J. Ritter H. (2001). Hyperbolic self-organizing maps for semantic navigation. In: Advances in Neural Information Processing Systems Vol. 14."},{"key":"e_1_3_1_143_1","unstructured":"Pajek\/Pajekxxl\/Pajek3xl Version 5.16. Available at: http:\/\/mrvar.fdv.uni-lj.si\/pajek\/"},{"key":"e_1_3_1_144_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00017-5"},{"key":"e_1_3_1_145_1","unstructured":"Peixoto T. D. P. (2006). Graph-tool. Available at: https:\/\/graph-tool.skewed.de\/"},{"key":"e_1_3_1_146_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1979.1084652"},{"key":"e_1_3_1_147_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36379-3_32"},{"key":"e_1_3_1_148_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/E88-D.1.23"},{"key":"e_1_3_1_149_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2008.09.002"},{"key":"e_1_3_1_150_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(98)00003-0"},{"key":"e_1_3_1_151_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777638_0017"},{"key":"e_1_3_1_152_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00061-X"},{"key":"e_1_3_1_153_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00126-3"},{"key":"e_1_3_1_154_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812773296_0016"},{"key":"e_1_3_1_155_1","doi-asserted-by":"publisher","DOI":"10.1016\/0360-1323(82)90037-3"},{"key":"e_1_3_1_156_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00020-E"},{"key":"e_1_3_1_157_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_67"},{"key":"e_1_3_1_158_1","first-page":"138","volume-title":"Proceedings of the first Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Schnyder W.","year":"1990","unstructured":"Schnyder, W. (1990). Embedding planar graphs on the grid. In: Proceedings of the first Annual ACM-SIAM Symposium on Discrete Algorithms, 138\u2013148."},{"key":"e_1_3_1_159_1","volume-title":"Social Network Analysis: A Handbook","author":"Scott J.","year":"2000","unstructured":"Scott, J. (2000). Social Network Analysis: A Handbook, 2nd ed. London: SAGE Publications.","edition":"2"},{"key":"e_1_3_1_160_1","doi-asserted-by":"crossref","unstructured":"Seifert E. Rademacher H. (1934). Vorlesungen \u00fcber die Theorie der Polyeder (Die Grundlehren d. math. Wiss. in Einzeldarstell. mit besonderer Ber\u00fccksichtigung d. Anwendungsgeb. Hrsg. von R. Courant. Gemeinsam mit W. Blaschke M. Born u. BL van der Waerden. Bd. 41.) Berlin 1934 Julius Springer Verlag. XII+ 351\u2009S. Preis geb. 27 M geb. 28 80 M.","DOI":"10.1002\/zamm.19340140516"},{"issue":"1","key":"e_1_3_1_161_1","first-page":"179","article-title":"A new planarity test","volume":"223","author":"Shih W. K.","year":"1999","unstructured":"Shih, W. K., Hsu, W. L. (1999). A new planarity test. Theor. Comput. Sci. 223(1): 179\u2013192.","journal-title":"Theor. Comput. Sci"},{"key":"e_1_3_1_162_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2011.01956.x"},{"key":"e_1_3_1_163_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1951-0041425-5"},{"key":"e_1_3_1_164_1","doi-asserted-by":"publisher","DOI":"10.1142\/4902"},{"key":"e_1_3_1_165_1","doi-asserted-by":"publisher","DOI":"10.1109\/31.34669"},{"key":"e_1_3_1_166_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216030"},{"key":"e_1_3_1_167_1","doi-asserted-by":"publisher","DOI":"10.1201\/b15385"},{"key":"e_1_3_1_168_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-10.1.304"},{"key":"e_1_3_1_169_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"e_1_3_1_170_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2020.103149"},{"key":"e_1_3_1_171_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.6312176"},{"key":"e_1_3_1_172_1","first-page":"26","article-title":"Bemerkungen zum vierfarbenproblem","volume":"46","author":"Wagner K.","year":"1936","unstructured":"Wagner, K. (1936). Bemerkungen zum vierfarbenproblem. Jahresbericht Der Deutschen Mathematiker-Vereinigung 46: 26\u201332.","journal-title":"Jahresbericht Der Deutschen Mathematiker-Vereinigung"},{"key":"e_1_3_1_173_1","volume-title":"Uber eine Erweiterung eines Satzes von Kuratowski","author":"Wagner K.","year":"1937","unstructured":"Wagner, K. (1937). Uber eine Erweiterung eines Satzes von Kuratowski, Deutsche Math."},{"key":"e_1_3_1_174_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"},{"key":"e_1_3_1_175_1","unstructured":"Wikipedia Flowchart-Wikipedia the Free Encyclopedia (2021). Available at: http:\/\/en.wikipedia.org\/w\/index.php?title=Flowchart{\/&}oldid=1009218979. [Online; accessed 08-March-2021]."},{"key":"e_1_3_1_176_1","unstructured":"Wolfram S. (2009). Wolfram Mathematica Online: Bring Mathematica to Life in the Cloud. Available at: https:\/\/www.wolfram.com\/mathematica\/online\/?src=google{\/&}amp;420\/"},{"key":"e_1_3_1_177_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2018\/6208509","article-title":"A force-directed algorithm for drawing directed graphs symmetrically","author":"Xu T.","year":"2018","unstructured":"Xu, T., Yang, J., Gou, G. (2018). A force-directed algorithm for drawing directed graphs symmetrically. Math. Probl. Eng. 2018: 1\u201324.","journal-title":"Math. Probl. Eng."},{"key":"e_1_3_1_178_1","unstructured":"yEd Graph Editor yWorks the diagramming experts. Available at: https:\/\/www.yworks.com\/products\/yed"},{"key":"e_1_3_1_179_1","unstructured":"Zeijlemaker S. Keijsper J. C. M. (2018). Planarity testing."}],"container-title":["AKCE International Journal of Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09728600.2023.2218459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T17:42:29Z","timestamp":1703007749000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/09728600.2023.2218459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,11]]},"references-count":178,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,2]]}},"alternative-id":["10.1080\/09728600.2023.2218459"],"URL":"https:\/\/doi.org\/10.1080\/09728600.2023.2218459","relation":{},"ISSN":["0972-8600","2543-3474"],"issn-type":[{"value":"0972-8600","type":"print"},{"value":"2543-3474","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,11]]},"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=uakc20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uakc20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-05-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-22","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}