{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:44:25Z","timestamp":1743003865238,"version":"3.40.3"},"publisher-location":"London","reference-count":48,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447128038"},{"type":"electronic","value":"9781447128045"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-1-4471-2804-5_7","type":"book-chapter","created":{"date-parts":[[2012,4,16]],"date-time":"2012-04-16T13:06:03Z","timestamp":1334581563000},"page":"111-126","source":"Crossref","is-referenced-by-count":1,"title":["How to Draw a Graph, Revisited"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Adachi, N., Kananaka, S., Matsumoto, Y., & Rudy, R. (2009). Apparatus and method for supporting document data search. US Patent US2009\/03272779 A1."},{"key":"7_CR2","series-title":"LNCS tutorial","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-44969-8_4","volume-title":"Drawing graphs: methods and models","author":"U. Brandes","year":"2001","unstructured":"Brandes, U. (2001). Drawing on physical analogies. In Kaufmann, & Wagner (Eds.), LNCS tutorial: Vol.\u00a02025. Drawing graphs: methods and models (pp.\u00a071\u201386). Berlin: Springer."},{"key":"7_CR3","first-page":"153","volume-title":"Progress in graph theory","author":"N. Chiba","year":"1984","unstructured":"Chiba, N., Yamanouchi, T., & Nishizeki, T. (1984). Linear algorithms for convex drawings of planar graphs. In Bondy (Ed.), Progress in graph theory (pp. 153\u2013173). San Diego: Academic Press."},{"key":"7_CR4","unstructured":"Chimani, M., Gutwenger, C., Juenger, M., Klau, G., Klein, K., & Mutzel, P. (2011). The open graph drawing framework (OGDF). http:\/\/www.cs.brown.edu\/~rt\/gdhandbook\/chapters\/ogdf.pdf."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M. Chrobak","year":"1995","unstructured":"Chrobak, M., & Payne, T. (1995). A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters, 54, 241\u2013246.","journal-title":"Information Processing Letters"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-46648-7_29","volume-title":"Graph drawing 1999","author":"H. de Fraysseix","year":"1999","unstructured":"de Fraysseix, H. (1999). An heuristic for graph symmetry detection. In Graph drawing 1999 (pp.\u00a0276\u2013285)."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., & Pollack, R. (1990). How to draw a planar graph on a grid. Combinatorica, 10(1), 41\u201351.","journal-title":"Combinatorica"},{"key":"7_CR8","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"G. di Battista","year":"1999","unstructured":"di Battista, G., Eades, P., Tamassia, R., & Tollis, I. (1999). Graph drawing: algorithms for the visualization of graphs. New York: Prentice-Hall."},{"key":"7_CR9","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P. (1984). A heuristic for graph drawing. Congressus Numerantium, 42, 149\u2013160.","journal-title":"Congressus Numerantium"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(99)00239-X","volume":"240","author":"P. Eades","year":"1999","unstructured":"Eades, P., & Lin, X. (1999). Spring algorithms and symmetry. Theoretical Computer Science, 240, 379\u2013405.","journal-title":"Theoretical Computer Science"},{"key":"7_CR11","unstructured":"Eades, P., Hong, S., & Liotta, G. (2011). Straight-line drawings of 1-planar graphs. Submitted."},{"key":"7_CR12","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I. (1948). On straight line representations of planar graphs. Acta Scientiarum Mathematicarum Szeged, 11, 229\u2013233.","journal-title":"Acta Scientiarum Mathematicarum Szeged"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/PACIFICVIS.2010.5429590","volume-title":"Pacific Vis 2010","author":"E. Gansner","year":"2010","unstructured":"Gansner, E., Hu, Y., & Kobourov, S. (2010). GMap: visualizing graphs and clusters as maps. In Pacific Vis 2010 (pp.\u00a0201\u2013208)."},{"key":"7_CR14","series-title":"Lecture notes in computer science","first-page":"285","volume-title":"GD2004","author":"S. Hachul","year":"2004","unstructured":"Hachul, S., & Juenger, M. (2004). Drawing large graphs with a potential-field-based multilevel algorithm. In Lecture notes in computer science: Vol.\u00a03383. GD2004 (pp.\u00a0285\u2013295)."},{"key":"7_CR15","unstructured":"Han, K., & Byun, Y. (2004). Method for partitioned layout of protein interaction networks. US Patent US2004\/0059522 A1."},{"issue":"3","key":"7_CR16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D. Harel","year":"2002","unstructured":"Harel, D., & Koren, Y. (2002). A fast multi-scale method for drawing large graphs. Journal of Graph Algorithms and Applications, 6(3), 179\u2013202.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"7_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-540-69733-6_40","volume-title":"Proc. of COCOON 2008","author":"S. Hong","year":"2008","unstructured":"Hong, S., & Nagamochi, H. (2008). Star-shaped drawings of graphs with fixed embedding and concave corner constraints. In Lecture notes in computer science: Vol.\u00a05092. Proc. of COCOON 2008 (pp.\u00a0405\u2013414)."},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.comgeo.2009.06.008","volume":"43","author":"S. Hong","year":"2010","unstructured":"Hong, S., & Nagamochi, H. (2010a). An algorithm for constructing star-shaped drawings of plane graphs. Computational Geometry, 43(2), 191\u2013206.","journal-title":"Computational Geometry"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Hong, S., & Nagamochi, H. (2010b). A linear time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners. Algorithmica. To appear.","DOI":"10.1007\/s00453-011-9513-6"},{"key":"7_CR20","doi-asserted-by":"crossref","DOI":"10.1142\/0922","volume-title":"Visualizing abstract objects and relations","author":"T. Kamada","year":"1989","unstructured":"Kamada, T. (1989). Visualizing abstract objects and relations. Singapore: World Scientific."},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G. (1996). Drawing planar graphs using the canonical ordering. Algorithmica, 16(1), 4\u201332.","journal-title":"Algorithmica"},{"key":"7_CR22","unstructured":"Kobourov, S. (2011). Force directed drawing algorithms. www.cs.brown.edu\/~rt\/gdhandbook\/chapters\/force-directed.pdf."},{"key":"7_CR23","first-page":"137","volume-title":"INFOVIS 2002","author":"Y. Koren","year":"2002","unstructured":"Koren, Y., Carmel, L., & Harel, D. (2002). ACE: A fast multiscale eigenvectors computation for drawing huge graphs. In INFOVIS 2002 (pp.\u00a0137\u2013144)."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-00219-9_29","volume-title":"Proc. of graph drawing 2008","author":"V. Korzhik","year":"2009","unstructured":"Korzhik, V., & Mohar, B. (2009). Minimal obstructions for 1-immersions and hardness of 1-planarity testing. In Proc. of graph drawing 2008 (pp. 302\u2013312)."},{"key":"7_CR25","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/3-540-45848-4_22","volume-title":"Graph drawing","author":"E. Kruja","year":"2002","unstructured":"Kruja, E., Marks, J., Blair, A., & Waters, R. (2002). A short note on the history of graph drawing. In S. Kobourov, & M. Goodrich (Eds.), Lecture notes in computer science: Vol.\u00a02265. Graph drawing (pp.\u00a0602\u2013606)."},{"key":"7_CR26","unstructured":"Lauther, U., Stubinger, A., Malisch, F., & Dostert, P. (2002). Method for producing diagrammatic network plans. US Patent US2004\/0199759."},{"issue":"2","key":"7_CR27","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. Lipton","year":"1979","unstructured":"Lipton, R., Rose, D., & Tarjan, R. (1979). Generalized nested dissection. SIAM Journal on Numerical Analysis, 16(2), 346\u2013358.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"7_CR28","unstructured":"Liu, H. (2011). Dynamic concept cartography for social networks. Masters thesis, University of Sydney."},{"key":"7_CR29","unstructured":"Misue, K., & Sugiyama, K. (1995). Automatic graph layout apparatus and methods determining and using a stable state of a physical model. US Patent US005764239."},{"key":"7_CR30","series-title":"London mathematical society lecture notes","first-page":"167","volume-title":"Surveys in combinatorics","author":"J. Pach","year":"1999","unstructured":"Pach, J. (1999). Geometric graph theory. In Lamb, & Preece (Eds.), London mathematical society lecture notes: Vol.\u00a0267. Surveys in combinatorics (pp. 167\u2013200). Cambridge: Cambridge University Press."},{"issue":"3","key":"7_CR31","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., & Toth, G. (1997). Graphs drawn with few crossings per edge. Combinatorica, 17(3), 427\u2013439.","journal-title":"Combinatorica"},{"key":"7_CR32","series-title":"Texts in applied mathematics","volume-title":"Multiscale methods: averaging and homogenization","author":"G. Pavliotis","year":"2008","unstructured":"Pavliotis, G., & Stuart, A. (2008.) Multiscale methods: averaging and homogenization. Texts in applied mathematics: Vol.\u00a053. Berlin: Springer."},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume":"1997","author":"H. Purchase","year":"1997","unstructured":"Purchase, H. (1997). Which aesthetic has the greatest effect on human understanding? Graph Drawing, 1997, 248\u2013261.","journal-title":"Graph Drawing"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Quigley, A., & Eades, P. (2000). FADE: graph drawing, clustering, and visual abstraction. In GD2000 (pp. 197\u2013210).","DOI":"10.1007\/3-540-44541-2_19"},{"key":"7_CR35","first-page":"417","volume-title":"Selected topics in graph theory","author":"R. Read","year":"1978","unstructured":"Read, R. (1978). Some applications of computers in graph theory. In Beineke, & Wilson (Eds.), Selected topics in graph theory (pp. 417\u2013444). San Diego: Academic Press."},{"key":"7_CR36","first-page":"31","volume":"56","author":"R. Read","year":"1987","unstructured":"Read, R. (1987). A new method for drawing a planar graph given the cyclic order of the edges at each vertex. Congressus Numerantium, 56, 31\u201344.","journal-title":"Congressus Numerantium"},{"key":"7_CR37","first-page":"138","volume-title":"Proc. of SODA","author":"W. Schnyder","year":"1990","unstructured":"Schnyder, W. (1990). Embedding planar graphs on the grid. In Proc. of SODA (pp.\u00a0138\u2013148)."},{"key":"7_CR38","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"K. Stein","year":"1951","unstructured":"Stein, K. (1951). Convex maps. Proceedings of the American Mathematical Society, 2, 464\u2013466.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"7_CR39","first-page":"43","volume-title":"Progress in graph theory","author":"C. Thomassen","year":"1984","unstructured":"Thomassen, C. (1984). Plane representations of graphs. In Bondy, & Murty (Eds.), Progress in graph theory (pp. 43\u201369). San Diego: Academic Press."},{"key":"7_CR40","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.10163","volume":"45","author":"C. Tomassen","year":"2004","unstructured":"Tomassen, C. (2004). Tutte\u2019s spring theorem. Journal of Graph Theory, 45, 275\u2013280.","journal-title":"Journal of Graph Theory"},{"key":"7_CR41","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. Tutte","year":"1963","unstructured":"Tutte, W. (1963). How to draw a graph. Proceedings of the London Mathematical Society, 13, 743\u2013767.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"7_CR42","unstructured":"Tunkelang, D. (1999). A numerical optimization approach to general graph drawing. PhD thesis, Carnegie Mellon University."},{"issue":"2","key":"7_CR43","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L. Valiant","year":"1981","unstructured":"Valiant, L. (1981). Universality considerations in VLSI circuits. IEEE Transactions on Computers, 30(2), 135\u2013140.","journal-title":"IEEE Transactions on Computers"},{"key":"7_CR44","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"Wagner, K. (1936). Bemerkungen zum Vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46, 26\u201332.","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"issue":"3","key":"7_CR45","doi-asserted-by":"crossref","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C. Walshaw","year":"2003","unstructured":"Walshaw, C. (2003). A multilevel algorithm for force-directed graph drawing. Journal of Graph Algorithms and Applications, 7(3), 253\u2013285.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"7_CR46","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"Whitney, H. (1932). Non-separable and planar graphs. Transactions of the American Mathematical Society, 34, 339\u2013362.","journal-title":"Transactions of the American Mathematical Society"},{"key":"7_CR47","unstructured":"Yworks (2012). http:\/\/www.yworks.com\/en\/index.html."},{"key":"7_CR48","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. Discrete & Computational Geometry, 33, 321\u2013344.","journal-title":"Discrete & Computational Geometry"}],"container-title":["Expanding the Frontiers of Visual Analytics and Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-2804-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T15:06:31Z","timestamp":1714748791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-2804-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9781447128038","9781447128045"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-2804-5_7","relation":{},"subject":[],"published":{"date-parts":[[2012]]}}}