{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:37Z","timestamp":1740099217253,"version":"3.37.3"},"publisher-location":"Cham","reference-count":107,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961927"},{"type":"electronic","value":"9783319961934"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96193-4_2","type":"book-chapter","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T10:32:53Z","timestamp":1540981973000},"page":"33-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph Visualization"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,1]]},"reference":[{"key":"2_CR1","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-03841-4_26","volume-title":"Graph drawing. In: 21st international symposium, GD 2013, Bordeaux, September 23\u201325, 2013. Revised selected papers","author":"P Angelini","year":"2013","unstructured":"Angelini P, Binucci C, Lozzo GD, Didimo W, Grilli L, Montecchiani F, Patrignani M, Tollis IG (2013) Drawing non-planar graphs with crossing-free subgraphs. In: Wismath SK, Wolff A (eds) Graph drawing. In: 21st international symposium, GD 2013, Bordeaux, September 23\u201325, 2013. Revised selected papers. Lecture notes in computer science, vol 8242. Springer, Berlin, pp 292\u2013303. http:\/\/dx.doi.org\/10.1007\/978-3-319-03841-4_26"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00282","volume":"17","author":"EN Argyriou","year":"2013","unstructured":"Argyriou EN, Bekos MA, Kaufmann M, Symvonis A (2013) Geometric RAC simultaneous drawings of graphs. J Graph Algorithms Appl 17(1):11\u201334. http:\/\/dx.doi.org\/10.7155\/jgaa.00282","journal-title":"J Graph Algorithms Appl"},{"issue":"4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.comgeo.2011.11.008","volume":"45","author":"K Arikushi","year":"2012","unstructured":"Arikushi K, Fulek R, Keszegh B, Moric F, T\u00f3th CD (2012) Graphs that admit right angle crossing drawings. Comput Geom 45(4):169\u2013177. http:\/\/dx.doi.org\/10.1016\/j.comgeo.2011.11.008","journal-title":"Comput Geom"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.7155\/jgaa.00347","volume":"19","author":"C Auer","year":"2015","unstructured":"Auer C, Brandenburg FJ, Glei\u00dfner A, Reislhuber J (2015) 1-Planarity of graphs with a rotation system. J Graph Algorithms Appl 19(1):67\u201386. http:\/\/dx.doi.org\/10.7155\/jgaa.00347","journal-title":"J Graph Algorithms Appl"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"ST Barnard","year":"1994","unstructured":"Barnard ST, Simon HD (1994) Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency Pract Experience 6(2):101\u2013117. http:\/\/dx.doi.org\/10.1002\/cpe.4330060203","journal-title":"Concurrency Pract Experience"},{"doi-asserted-by":"crossref","unstructured":"Bartel G, Gutwenger C, Klein K, Mutzel P (2010) An experimental evaluation of multilevel layout methods. In: Brandes U, Cornelsen S (eds) Graph drawing - 18th international symposium, GD 2010, Konstanz, September 21\u201324, 2010. Revised selected papers. Lecture notes in computer science, vol 6502, Springer, Berlin, pp 80\u201391. http:\/\/dx.doi.org\/10.1007\/978-3-642-18469-7_8","key":"2_CR6","DOI":"10.1007\/978-3-642-18469-7_8"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"12","author":"C Batini","year":"1986","unstructured":"Batini C, Nardelli E, Tamassia R (1986) A layout algorithm for data flow diagrams. IEEE Trans Softw Eng 12(4):538\u2013546. http:\/\/doi.ieeecomputersociety.org\/10.1109\/TSE.1986.6312901","journal-title":"IEEE Trans Softw Eng"},{"key":"2_CR8","volume-title":"Graph drawing: algorithms for the visualization of graphs","author":"GD Battista","year":"1999","unstructured":"Battista GD, Eades P, Tamassia R, Tollis IG (1999) Graph drawing: algorithms for the visualization of graphs. Prentice-Hall, Upper Saddle River"},{"key":"2_CR9","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-63938-1_84","volume-title":"(1997) Graph drawing. In: 5th international symposium, GD \u201997, Rome, September 18\u201320, 1997, Proceedings","author":"TC Biedl","year":"1997","unstructured":"Biedl TC, Madden B, Tollis IG (1997) The three-phase method: a unified approach to orthogonal graph drawing. In: Battista GD (ed) (1997) Graph drawing. In: 5th international symposium, GD \u201997, Rome, September 18\u201320, 1997, Proceedings. Lecture notes in computer science, vol 1353. Springer, Berlin, pp 391\u2013402. http:\/\/dx.doi.org\/10.1007\/3-540-63938-1_84"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3389\/fnins.2014.00015","volume":"8","author":"J B\u00f6ttger","year":"2014","unstructured":"B\u00f6ttger J, Schurade R, Jakobsen E, Sch\u00e4fer A, Margulies D (2014) Connexel visualization: a software implementation of glyphs and edge-bundling for dense connectivity data using brainGL. Front Neurosci 8:15. https:\/\/doi.org\/10.3389\/fnins.2014.00015","journal-title":"Front Neurosci"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer JM, Myrvold WJ (2004a) On the cutting edge: simplified o (n) planarity by edge addition. J Graph Algorithms Appl 8(2):241\u2013273","journal-title":"J Graph Algorithms Appl"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer JM, Myrvold WJ (2004b) On the cutting edge: simplified o(n) planarity by edge addition. J Graph Algorithms Appl 8(2):241\u2013273. http:\/\/jgaa.info\/accepted\/2004\/BoyerMyrvold2004.8.3.pdf","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.7155\/jgaa.00330","volume":"18","author":"FJ Brandenburg","year":"2014","unstructured":"Brandenburg FJ (2014) 1-visibility representations of 1-planar graphs. J Graph Algorithms Appl 18(3):421\u2013438. http:\/\/dx.doi.org\/10.7155\/jgaa.00330","journal-title":"J Graph Algorithms Appl"},{"key":"2_CR14","series-title":"Lecture notes in computer science, vol","first-page":"67","volume-title":"Graph drawing - 20th international symposium, GD 2012, Redmond, September 19\u201321, 2012. Revised selected papers","author":"T Bruckdorfer","year":"2012","unstructured":"Bruckdorfer T, Cornelsen S, Gutwenger C, Kaufmann M, Montecchiani F, N\u00f6llenburg M, Wolff A (2012) Progress on partial edge drawings. In: Didimo W, Patrignani M (eds) Graph drawing - 20th international symposium, GD 2012, Redmond, September 19\u201321, 2012. Revised selected papers. Lecture notes in computer science, vol 7704. Springer, Berlin, pp 67\u201378. http:\/\/dx.doi.org\/10.1007\/978-3-642-36763-2_7"},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/spe.713","volume":"36","author":"C Buchheim","year":"2006","unstructured":"Buchheim C, J\u00fcnger M, Leipert S (2006) Drawing rooted trees in linear time. Softw Pract Exper 36(6):651\u2013665. http:\/\/dx.doi.org\/10.1002\/spe.713","journal-title":"Softw Pract Exper"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-25878-7_22","volume-title":"Graph drawing","author":"M Burch","year":"2012","unstructured":"Burch M, Vehlow C, Konevtsova N, Weiskopf D (2012) Evaluating partially drawn links for directed graph edges. In: Graph drawing, Springer, Berlin, pp 226\u2013237"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-36763-2_9","volume-title":"Graph drawing","author":"M Chimani","year":"2013","unstructured":"Chimani M, Klein K (2013) Shrinking the search space for clustered planarity. In: Graph drawing, Springer, Berlin, pp 90\u2013101"},{"unstructured":"Chimani M, Gutwenger C, J\u00fcnger M, Klau GW, Klein K, Mutzel P (2013) The open graph drawing framework (OGDF). In: Tamassia R (ed) (2013) Handbook on graph drawing and visualization. Chapman and Hall\/CRC, Boca Raton, pp 543\u2013569. https:\/\/www.crcpress.com\/Handbook-of-Graph-Drawing-and-Visualization\/Tamassia\/9781584884125","key":"2_CR18"},{"key":"2_CR19","first-page":"416","volume-title":"Graph drawing","author":"M Chimani","year":"2014","unstructured":"Chimani M, Di Battista G, Frati F, Klein K (2014) Advances on testing c-planarity of embedded flat clustered graphs. In: Graph drawing, Springer Berlin, Heidelberg, pp 416\u2013427"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M Chrobak","year":"1991","unstructured":"Chrobak M, Eppstein D (1991) Planar orientations with low out-degree and compaction of adjacency matrices. Theor Comput Sci 86(2):243\u2013266","journal-title":"Theor Comput Sci"},{"unstructured":"Cortese PF, Di Battista G (2005) Clustered planarity. In: Proceedings of the twenty-first annual symposium on computational geometry. ACM, New York SCG \u201905, pp 32\u201334. http:\/\/doi.acm.org\/10.1145\/1064092.1064093","key":"2_CR21"},{"issue":"18","key":"2_CR22","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1093\/bioinformatics\/btq407","volume":"26","author":"T Czauderna","year":"2010","unstructured":"Czauderna T, Klukas C, Schreiber F (2010) Editing, validating, and translating of SBGN maps. Bioinformatics 26(18):2340\u20132341","journal-title":"Bioinformatics"},{"key":"2_CR23","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BFb0054325","volume-title":"LATIN \u201998: theoretical Informatics. Third Latin American symposium, Campinas, April, 20\u201324, 1998, Proceedings","author":"E Dahlhaus","year":"1998","unstructured":"Dahlhaus E (1998) A linear time algorithm to recognize clustered graphs and its parallelization. In: Lucchesi CL, Moura AV (eds) LATIN \u201998: theoretical Informatics. Third Latin American symposium, Campinas, April, 20\u201324, 1998, Proceedings. Lecture notes in computer science, vol 1380. Springer, Berlin, pp 239\u2013248. http:\/\/dx.doi.org\/10.1007\/BFb0054325"},{"key":"2_CR24","first-page":"206","volume-title":"Lecture Notes in Computer Science","author":"Walter Didimo","year":"2009","unstructured":"Didimo W, Eades P, Liotta G (2009) Drawing graphs with right angle crossings. In: Dehne FKHA, Gavrilova ML, Sack J, T\u00f3th CD (eds) Algorithms and data structures. 11th International Symposium, WADS 2009, Banff, August 21\u201323, 2009. Proceedings. Lecture notes in computer science, vol 5664, Springer, Berlin, pp 206\u2013217. http:\/\/dx.doi.org\/10.1007\/978-3-642-03367-4_19"},{"issue":"3","key":"2_CR25","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1111\/j.1467-8659.2009.01449.x","volume":"28","author":"T Dwyer","year":"2009","unstructured":"Dwyer T (2009) Scalable, versatile and simple constrained graph layout. Comput Graph Forum 28(3):991\u2013998","journal-title":"Comput Graph Forum"},{"key":"2_CR26","first-page":"105","volume-title":"IEEE pacific visualization symposium, PacificVis 2014, Yokohama, March 4\u20137, 2014","author":"T Dwyer","year":"2014","unstructured":"Dwyer T, Mears C, Morgan K, Niven T, Marriott K, Wallace M (2014) Improved optimal and approximate power graph compression for clearer visualisation of dense graphs. In: Fujishiro I, Brandes U, Hagen H, Takahashi S (eds) IEEE pacific visualization symposium, PacificVis 2014, Yokohama, March 4\u20137, 2014. IEEE Computer Society, New York, pp 105\u2013112. http:\/\/dx.doi.org\/10.1109\/PacificVis.2014.46"},{"key":"2_CR27","first-page":"146","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades P (1984) A heuristics for graph drawing. Congressus numerantium 42:146\u2013160","journal-title":"Congressus numerantium"},{"issue":"7\u20138","key":"2_CR28","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.dam.2012.11.019","volume":"161","author":"P Eades","year":"2013","unstructured":"Eades P, Liotta G (2013) Right angle crossing graphs and 1-planarity. Discrete Appl Math 161(7\u20138):961\u2013969. http:\/\/dx.doi.org\/10.1016\/j.dam.2012.11.019","journal-title":"Discrete Appl Math"},{"key":"2_CR29","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-63938-1_77","volume-title":"(1997) Graph drawing. In: 5th international symposium, GD \u201997, Rome, September 18\u201320, 1997, Proceedings","author":"P Eades","year":"1997","unstructured":"Eades P, Cohen RF, Huang ML (1997) Online animated graph drawing for web navigation. In: Battista GD (ed) (1997) Graph drawing. In: 5th international symposium, GD \u201997, Rome, September 18\u201320, 1997, Proceedings. Lecture notes in computer science, vol 1353. Springer, Berlin, pp 330\u2013335. http:\/\/dx.doi.org\/10.1007\/3-540-63938-1_77"},{"issue":"4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"Peter Eades","year":"1999","unstructured":"Eades P, Feng Q, Nagamochi H (1999) Drawing clustered graphs on an orthogonal grid. J Graph Algorithms Appl 3(4):3\u201329. http:\/\/www.cs.brown.edu\/publications\/jgaa\/accepted\/99\/EadesFengNagamochi99.3.4.pdf","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2013.09.029","volume":"513","author":"P Eades","year":"2013","unstructured":"Eades P, Hong S, Katoh N, Liotta G, Schweitzer P, Suzuki Y (2013) A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system. Theor Comput Sci 513:65\u201376. http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.09.029","journal-title":"Theor Comput Sci"},{"key":"2_CR32","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/978-3-319-27261-0_41","volume-title":"Graph drawing and network visualization - 23rd international symposium, GD 2015, Los Angeles, September 24\u201326, 2015. Revised selected papers","author":"P Eades","year":"2015","unstructured":"Eades P, Hong S, Klein K, Nguyen A (2015) Shape-based quality metrics for large graph visualization. In: Giacomo ED, Lubiw A (eds) Graph drawing and network visualization - 23rd international symposium, GD 2015, Los Angeles, September 24\u201326, 2015. Revised selected papers. Lecture notes in computer science, vol 9411. Springer, Berlin, pp 502\u2013514. http:\/\/dx.doi.org\/10.1007\/978-3-319-27261-0_41"},{"key":"2_CR33","first-page":"213","volume-title":"Lecture Notes in Computer Science","author":"Qing-Wen Feng","year":"1995","unstructured":"Feng Q, Cohen RF, Eades P (1995) Planarity for clustered graphs. In: Spirakis PG (ed) Algorithms - ESA \u201995, Third annual European symposium, Corfu, September 25\u201327, 1995, Proceedings. Lecture notes in computer science, Springer, Berlin, vol 979, pp 213\u2013226. http:\/\/dx.doi.org\/10.1007\/3-540-60313-1_145"},{"key":"2_CR34","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"(1996) Graph drawing. In: Symposium on graph drawing, GD \u201995, Passau, September 20\u201322, 1995, Proceedings","author":"U F\u00f6\u00dfmeier","year":"1995","unstructured":"F\u00f6\u00dfmeier U, Kaufmann M (1995) Drawing high degree graphs with low bend numbers. In: Brandenburg F (ed) (1996) Graph drawing. In: Symposium on graph drawing, GD \u201995, Passau, September 20\u201322, 1995, Proceedings. Lecture notes in computer science, vol 1027. Springer, Berlin, pp 254\u2013266. http:\/\/dx.doi.org\/10.1007\/BFb0021809"},{"issue":"11","key":"2_CR35","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw Pract Exper 21(11):1129\u20131164. http:\/\/dx.doi.org\/10.1002\/spe.4380211102","journal-title":"Softw Pract Exper"},{"key":"2_CR36","first-page":"999","volume-title":"Proceedings of the 2006 conference on human factors in computing systems, CHI 2006, Montr\u00e9al, Qu\u00e9bec, April 22\u201327, 2006","author":"GW Furnas","year":"2006","unstructured":"Furnas GW (2006) A fisheye follow-up: further reflections on focus + context. In: Grinter RE, Rodden T, Aoki PM, Cutrell E, Jeffries R, Olson GM (eds) Proceedings of the 2006 conference on human factors in computing systems, CHI 2006, Montr\u00e9al, Qu\u00e9bec, April 22\u201327, 2006. ACM, New York, pp 999\u20131008. http:\/\/doi.acm.org\/10.1145\/1124772.1124921"},{"issue":"1","key":"2_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P Gajer","year":"2004","unstructured":"Gajer P, Goodrich MT, Kobourov SG (2004) A multi-dimensional approach to force-directed layouts of large graphs. Comput Geom 29(1):3\u201318. http:\/\/dx.doi.org\/10.1016\/j.comgeo.2004.03.014","journal-title":"Comput Geom"},{"issue":"3","key":"2_CR38","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner ER, Koutsofios E, North SC, Vo K (1993) A technique for drawing directed graphs. IEEE Trans Softw Eng 19(3):214\u2013230. http:\/\/dx.doi.org\/10.1109\/32.221135","journal-title":"IEEE Trans Softw Eng"},{"key":"2_CR39","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"(2004) Graph drawing. In: 12th international symposium, GD 2004, New York, September 29 - October 2, 2004. Revised selected papers","author":"ER Gansner","year":"2004","unstructured":"Gansner ER, Koren Y, North SC (2004) Graph drawing by stress majorization. In: Pach J (ed) (2004) Graph drawing. In: 12th international symposium, GD 2004, New York, September 29 - October 2, 2004. Revised selected papers. Lecture notes in computer science, vol 3383. Springer, Berlin, pp 239\u2013250. http:\/\/dx.doi.org\/10.1007\/978-3-540-31843-9_25"},{"doi-asserted-by":"crossref","unstructured":"Gansner ER, Hu Y, Kobourov SG (2010) Gmap: visualizing graphs and clusters as maps. In: IEEE pacific visualization symposium pacificVis 2010, Taipei, March 2\u20135, 2010. IEEE, New York, pp 201\u2013208. http:\/\/dx.doi.org\/10.1109\/PACIFICVIS.2010.5429590","key":"2_CR40","DOI":"10.1109\/PACIFICVIS.2010.5429590"},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-03841-4_24","volume-title":"Graph Drawing","author":"Emden R. Gansner","year":"2013","unstructured":"Gansner ER, Hu Y, Krishnan S (2013a) Coast: a convex optimization approach to stress-based embedding. In: Wismath SK, Wolff A (eds) Graph drawing. In: 21st international symposium, GD 2013, Bordeaux, September 23\u201325, 2013. Revised selected papers. Lecture notes in computer science, vol 8242. Springer, Berlin. http:\/\/dx.doi.org\/10.1007\/978-3-319-03841-4 pp 268\u2013279. http:\/\/dx.doi.org\/10.1007\/978-3-319-03841-4"},{"issue":"6","key":"2_CR42","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner ER, Hu Y, North SC (2013b) A maxent-stress model for graph layout. IEEE Trans Vis Comput Graph 19(6):927\u2013940. http:\/\/doi.ieeecomputersociety.org\/10.1109\/TVCG.2012.299","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"6","key":"2_CR43","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner ER, Hu Y, North SC (2013c) A maxent-stress model for graph layout. IEEE Trans Vis Comput Graph 19(6):927\u2013940. http:\/\/doi.ieeecomputersociety.org\/10.1109\/TVCG.2012.299","journal-title":"IEEE Trans Vis Comput Graph"},{"unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York","key":"2_CR44"},{"key":"2_CR45","series-title":"Lecture notes in computer science","first-page":"201","volume-title":"Graph drawing, Symposium on graph drawing, GD \u201996, Berkeley, September 18\u201320, Proceedings","author":"A Garg","year":"1996","unstructured":"Garg A, Tamassia R (1996) A new minimum cost flow algorithm with applications to graph drawing. In: North SC (ed) Graph drawing, Symposium on graph drawing, GD \u201996, Berkeley, September 18\u201320, Proceedings. Lecture notes in computer science, vol 1190. Springer, Berlin, pp 201\u2013216. http:\/\/dx.doi.org\/10.1007\/3-540-62495-3_49"},{"issue":"2","key":"2_CR46","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1057\/palgrave.ivs.9500092","volume":"4","author":"M Ghoniem","year":"2005","unstructured":"Ghoniem M, Fekete J, Castagliola P (2005) On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Inform Vis 4(2):114\u2013135. http:\/\/dx.doi.org\/10.1057\/palgrave.ivs.9500092","journal-title":"Inform Vis"},{"key":"2_CR47","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-662-45803-7_15","volume-title":"Graph drawing - 22nd international symposium, GD 2014, W\u00fcrzburg, September 24\u201326, 2014. Revised selected papers","author":"ED Giacomo","year":"2014","unstructured":"Giacomo ED, Liotta G, Montecchiani F (2014) Drawing outer 1-planar graphs with few slopes. In: Duncan CA, Symvonis A (eds) Graph drawing - 22nd international symposium, GD 2014, W\u00fcrzburg, September 24\u201326, 2014. Revised selected papers. Lecture notes in computer science, vol 8871. Springer, Berlin, pp 174\u2013185. http:\/\/dx.doi.org\/10.1007\/978-3-662-45803-7_15"},{"key":"2_CR48","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-36151-0_21","volume-title":"Graph drawing","author":"C Gutwenger","year":"2002","unstructured":"Gutwenger C, J\u00fcnger M, Leipert S, Mutzel P, Percan M, Weiskircher R (2002) Advances in c-planarity testing of clustered graphs. In: Goodrich M, Kobourov S (eds) Graph drawing. Lecture notes in computer science, vol 2528. Springer, Berlin, Heidelberg, pp 220\u2013236. http:\/\/dx.doi.org\/10.1007\/3-540-36151-0_21"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/774833.774859","volume-title":"Proceedings of the 2003 ACM symposium on software visualization","author":"C Gutwenger","year":"2003","unstructured":"Gutwenger C, J\u00fcnger M, Klein K, Kupke J, Leipert S, Mutzel P (2003) A new approach for visualizing uml class diagrams. In: Proceedings of the 2003 ACM symposium on software visualization. ACM, New York, pp 179\u2013188"},{"key":"2_CR50","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"(2004) Graph drawing. In: 12th international symposium, GD 2004, New York, September 29 - October 2, 2004. Revised selected papers","author":"S Hachul","year":"2004","unstructured":"Hachul S, J\u00fcnger M (2004) Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach J (ed) (2004) Graph drawing. In: 12th international symposium, GD 2004, New York, September 29 - October 2, 2004. Revised selected papers. Lecture notes in computer science, vol 3383. Springer, Berlin, pp 285\u2013295"},{"issue":"2","key":"2_CR51","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00150","volume":"11","author":"S Hachul","year":"2007","unstructured":"Hachul S, J\u00fcnger M (2007) Large-graph layout algorithms at work: an experimental study. J Graph Algorithms Appl 11(2):345\u2013369","journal-title":"J Graph Algorithms Appl"},{"issue":"1","key":"2_CR52","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(00)00389-9","volume":"113","author":"Ronny Hadany","year":"2001","unstructured":"Hadany R, Harel D (2001) A multi-scale algorithm for drawing graphs nicely. Discrete Applied Mathematics 113(1):3\u201321. http:\/\/dx.doi.org\/10.1016\/S0166-218X(00)00389-9","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR53","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K Hall","year":"1970","unstructured":"Hall K (1970) An r-dimensional quadratic placement algorithm. Management Science 17:219\u2013229","journal-title":"Management Science"},{"issue":"3","key":"2_CR54","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"David Harel","year":"2002","unstructured":"Harel D, Koren Y (2002) A fast multi-scale method for drawing large graphs. J Graph Algorithms Appl 6(3):179\u2013202, http:\/\/www.cs.brown.edu\/publications\/jgaa\/accepted\/2002\/HarelKoren2002.6.3.pdf","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"2_CR55","doi-asserted-by":"publisher","first-page":"195","DOI":"10.7155\/jgaa.00089","volume":"8","author":"D Harel","year":"2004","unstructured":"Harel D, Koren Y (2004) Graph drawing by high-dimensional embedding. J Graph Algorithms Appl 8(2):195\u2013214, http:\/\/jgaa.info\/accepted\/2004\/HarelKoren2004.8.2.pdf","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"2_CR56","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D Holten","year":"2009","unstructured":"Holten D, van Wijk JJ (2009) Force-directed edge bundling for graph visualization. Comput Graph Forum 28(3):983\u2013990. http:\/\/dx.doi.org\/10.1111\/j.1467-8659.2009.01450.x","journal-title":"Comput Graph Forum"},{"issue":"4","key":"2_CR57","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"JE Hopcroft","year":"1974","unstructured":"Hopcroft JE, Tarjan RE (1974) Efficient planarity testing. J ACM 21(4):549\u2013568. http:\/\/doi.acm.org\/10.1145\/321850.321852","journal-title":"J ACM"},{"issue":"2","key":"2_CR58","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/wics.1343","volume":"7","author":"Y Hu","year":"2015","unstructured":"Hu Y, Shi L (2015) Visualizing large graphs. Wiley Interdisciplinary Reviews: Computational Statistics 7(2):115\u2013136. http:\/\/dx.doi.org\/10.1002\/wics.1343","journal-title":"Wiley Interdisciplinary Reviews: Computational Statistics"},{"issue":"4","key":"2_CR59","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.jvlc.2014.03.001","volume":"25","author":"W Huang","year":"2014","unstructured":"Huang W, Eades P, Hong S (2014) Larger crossing angles make graphs easier to read. J Vis Lang Comput 25(4):452\u2013465. http:\/\/dx.doi.org\/10.1016\/j.jvlc.2014.03.001","journal-title":"J Vis Lang Comput"},{"issue":"3","key":"2_CR60","doi-asserted-by":"publisher","first-page":"379","DOI":"10.7155\/jgaa.00192","volume":"13","author":"E Jel\u00ednkov\u00e1","year":"2009","unstructured":"Jel\u00ednkov\u00e1 E, K\u00e1ra J, Kratochv\u00edl J, Pergel M, Such\u00fd O, Vyskocil T (2009) Clustered planarity: Small clusters in cycles and Eulerian graphs. J Graph Algorithms Appl 13(3):379\u2013422, http:\/\/jgaa.info\/accepted\/2009\/Jelinkova+2009.13.3.pdf","journal-title":"J Graph Algorithms Appl"},{"issue":"6","key":"2_CR61","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1109\/TVCG.2008.151","volume":"14","author":"Y Jia","year":"2008","unstructured":"Jia Y, Hoberock J, Garland M, Hart J (2008) On the visualization of social and other scale-free networks. IEEE Transactions on Visualization and Computer Graphics 14(6):1285\u20131292. https:\/\/doi.org\/10.1109\/TVCG.2008.151","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"doi-asserted-by":"crossref","unstructured":"Johnson B, Shneiderman B (1991) Tree maps: A space-filling approach to the visualization of hierarchical information structures. In: IEEE Visualization, pp 284\u2013291. http:\/\/dx.doi.org\/10.1109\/VISUAL.1991.175815","key":"2_CR62","DOI":"10.1109\/VISUAL.1991.175815"},{"key":"2_CR63","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-58950-3_363","volume-title":"(1995) Graph drawing. In: DIMACS international workshop, GD \u201994, Princeton, October 10\u201312, 1994, Proceedings","author":"M J\u00fcnger","year":"1994","unstructured":"J\u00fcnger M, Mutzel P (1994) The polyhedral approach to the maximum planar subgraph problem: New chances for related problems. In: Tamassia R, Tollis IG (eds) (1995) Graph drawing. In: DIMACS international workshop, GD \u201994, Princeton, October 10\u201312, 1994, Proceedings. Lecture notes in computer science, vol 894. Springer, Berlin, pp 119\u2013130. http:\/\/dx.doi.org\/10.1007\/3-540-58950-3_363"},{"issue":"1","key":"2_CR64","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M J\u00fcnger","year":"1996","unstructured":"J\u00fcnger M, Mutzel P (1996) Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16(1):33\u201359. http:\/\/dx.doi.org\/10.1007\/BF02086607","journal-title":"Algorithmica"},{"issue":"7","key":"2_CR65","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/43.709399","volume":"17","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger M, Leipert S, Mutzel P (1998) A note on computing a maximal planar subgraph using pq-trees. IEEE Trans on CAD of Integrated Circuits and Systems 17(7):609\u2013612. http:\/\/doi.ieeecomputersociety.org\/10.1109\/43.709399","journal-title":"IEEE Trans on CAD of Integrated Circuits and Systems"},{"issue":"1","key":"2_CR66","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"Tomihisa Kamada","year":"1989","unstructured":"Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Inf Process Lett 31(1):7\u201315. http:\/\/dx.doi.org\/10.1016\/0020-0190(89)90102-6","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1995) Analysis of multilevel graph partitioning. In: Karin S (ed) Proceedings supercomputing \u201995, San Diego, December 4-8, 1995. IEEE Computer Society\/ACM, New York, p 29. http:\/\/doi.acm.org\/10.1145\/224170.224229","key":"2_CR67","DOI":"10.1145\/224170.224229"},{"issue":"3","key":"2_CR68","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1111\/j.1467-8659.2012.03090.x","volume":"31","author":"M Khoury","year":"2012","unstructured":"Khoury M, Hu Y, Krishnan S, Scheidegger CE (2012) Drawing large graphs by low-rank stress majorization. Comput Graph Forum 31(3):975\u2013984. http:\/\/dx.doi.org\/10.1111\/j.1467-8659.2012.03090.x","journal-title":"Comput Graph Forum"},{"unstructured":"Kobourov SG (2013) Force-directed drawing algorithms. Handbook of graph drawing and visualization, pp 383\u2013408","key":"2_CR69"},{"key":"2_CR70","first-page":"234","volume-title":"Graph drawing","author":"SG Kobourov","year":"2014","unstructured":"Kobourov SG, Pupyrev S, Saket B (2014) Are crossings important for drawing large graphs? In: Graph drawing. Springer, Berlin, pp 234\u2013245"},{"key":"2_CR71","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/INFVIS.2002.1173159","volume-title":"2002 IEEE symposium on information visualization (InfoVis 2002), 27 October\u20131 November 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: Wong PC, Andrews K (eds) 2002 IEEE symposium on information visualization (InfoVis 2002), 27 October\u20131 November 2002, Boston. IEEE Computer Society, New York, pp 137\u2013144. http:\/\/dx.doi.org\/10.1109\/INFVIS.2002.1173159"},{"key":"2_CR72","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski K (1930) Sur le probl\u00e8me des courbes gauches en topologie. Fund Math 15:271\u2013283","journal-title":"Fund Math"},{"key":"2_CR73","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1145\/223904.223956","volume-title":"Proceedings of the SIGCHI conference on human factors in computing systems, CHI \u201995","author":"J Lamping","year":"1995","unstructured":"Lamping J, Rao R, Pirolli P (1995) A focus+context technique based on hyperbolic geometry for visualizing large hierarchies. In: Proceedings of the SIGCHI conference on human factors in computing systems, CHI \u201995. ACM Press\/Addison-Wesley, New York, pp 401\u2013408. http:\/\/dx.doi.org\/10.1145\/223904.223956"},{"key":"2_CR74","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1038\/nbt.1558","volume":"27","author":"N Nov\u00e8re Le","year":"2009","unstructured":"Le Nov\u00e8re N, Hucka M, Mi H, Moodie S, Schreiber F, Sorokin A, Demir E, Wegner K, Aladjem M, Wimalaratne SM, Bergman FT, Gauges R, Ghazal P, Kawaji H, Li L, Matsuoka Y, Vill\u00e9ger A, Boyd SE, Calzone L, Courtot M, Dogrusoz U, Freeman T, Funahashi A, Ghosh S, Jouraku A, Kim S, Kolpakov F, Luna A, Sahle S, Schmidt E, Watterson S, Wu G, Goryanin I, Kell DB, Sander C, Sauro H, Snoep JL, Kohn K, Kitano H (2009) The systems biology graphical notation. Nat Biotechnol 27:735\u2013741","journal-title":"Nat Biotechnol"},{"key":"2_CR75","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-58950-3_392","volume-title":"(1995) Graph drawing. In: DIMACS international workshop, GD \u201994, Princeton, October 10\u201312, 1994, Proceedings","author":"T Lin","year":"1994","unstructured":"Lin T, Eades P (1994) Integration of declarative and algorithmic approaches for layout creation. In: Tamassia R, Tollis IG (eds) (1995) Graph drawing. In: DIMACS international workshop, GD \u201994, Princeton, October 10\u201312, 1994, Proceedings. Lecture notes in computer science, vol 894. Springer, Berlin, pp 376\u2013387. http:\/\/dx.doi.org\/10.1007\/3-540-58950-3_392"},{"issue":"2","key":"2_CR76","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01940648","volume":"16","author":"K Mehlhorn","year":"1996","unstructured":"Mehlhorn K, Mutzel P (1996) On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Algorithmica 16(2):233\u2013242. http:\/\/dx.doi.org\/10.1007\/BF01940648","journal-title":"Algorithmica"},{"issue":"2","key":"2_CR77","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K Misue","year":"1995","unstructured":"Misue K, Eades P, Lai W, Sugiyama K (1995) Layout adjustment and the mental map. J Vis Lang Comput 6(2):183\u2013210. http:\/\/dx.doi.org\/10.1006\/jvlc.1995.1010","journal-title":"J Vis Lang Comput"},{"unstructured":"Monash University (2015) WebCoLa \u2013 constraint-based layout in the browser. http:\/\/marvl.infotech.monash.edu\/webcola\/","key":"2_CR78"},{"doi-asserted-by":"crossref","unstructured":"Newbery FJ (1989) Edge concentration: a method for clustering directed graphs. In: SCM, pp 76\u201385","key":"2_CR79","DOI":"10.1145\/72910.73350"},{"key":"2_CR80","first-page":"209","volume-title":"IEEE pacific visualization symposium, PacificVis 2013, February 27 2013-March 1, 2013","author":"QH Nguyen","year":"2013","unstructured":"Nguyen QH, Eades P, Hong S (2013) On the faithfulness of graph visualizations. In: Carpendale S, Chen W, Hong S (eds) IEEE pacific visualization symposium, PacificVis 2013, February 27 2013-March 1, 2013, Sydney. IEEE, New York, pp 209\u2013216. http:\/\/dx.doi.org\/10.1109\/PacificVis.2013.6596147"},{"doi-asserted-by":"crossref","unstructured":"Nocaj A, Ortmann M, Brandes U (2016) Adaptive disentanglement based on local clustering in small-world network visualization. IEEE Trans Vis Comput Graph. http:\/\/dx.doi.org\/10.1109\/TVCG.2016.2534559","key":"2_CR81","DOI":"10.1109\/TVCG.2016.2534559"},{"unstructured":"OGDF (2015) The open graph drawing framework. http:\/\/www.ogdf.net","key":"2_CR82"},{"issue":"5","key":"2_CR83","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","volume":"13","author":"HC Purchase","year":"2002","unstructured":"Purchase HC (2002) Metrics for graph drawing aesthetics. J Vis Lang Comput 13(5):501\u2013516. http:\/\/dx.doi.org\/10.1006\/jvlc.2002.0232","journal-title":"J Vis Lang Comput"},{"key":"2_CR84","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"(1996) Graph drawing. In: Symposium on graph drawing, GD \u201995, Passau, September 20\u201322, 1995, Proceedings","author":"HC Purchase","year":"1995","unstructured":"Purchase HC, Cohen RF, James MI (1995) Validating graph drawing aesthetics. In: Brandenburg F (ed) (1996) Graph drawing. In: Symposium on graph drawing, GD \u201995, Passau, September 20\u201322, 1995, Proceedings. Lecture notes in computer science, vol 1027. Springer, Berlin, pp 435\u2013446. http:\/\/dx.doi.org\/10.1007\/BFb0021827"},{"key":"2_CR85","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph drawing","author":"A Quigley","year":"2001","unstructured":"Quigley A, Eades P (2001) Fade: graph drawing, clustering, and visual abstraction. In: Graph drawing. Springer, Berlin, Heidelberg, pp 197\u2013210"},{"issue":"2","key":"2_CR86","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"EM Reingold","year":"1981","unstructured":"Reingold EM, Tilford JS (1981) Tidier drawings of trees. IEEE Trans Softw Eng 7(2):223\u2013228. http:\/\/dx.doi.org\/10.1109\/TSE.1981.234519","journal-title":"IEEE Trans Softw Eng"},{"key":"2_CR87","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1186\/1752-0509-6-139","volume":"6","author":"H Rohn","year":"2012","unstructured":"Rohn H, Junker A, Hartmann A, Grafahrend-Belau E, Treutler H, Klapperstuck M, Czauderna T, Klukas C, Schreiber F (2012) Vanted v2: a framework for systems biology applications. BMC Syst Biol 6:139","journal-title":"BMC Syst Biol"},{"key":"2_CR88","first-page":"319","volume-title":"Graph drawing","author":"U R\u00fcegg","year":"2014","unstructured":"R\u00fcegg U, Kieffer S, Dwyer T, Marriott K, Wybrow M (2014) Stress-minimizing orthogonal layout of data flow diagrams with ports. In: Graph drawing. Springer, Berlin, pp 319\u2013330"},{"unstructured":"Rusu A (2013) Three drawing algorithms. In: Tamassia R (ed) (2013) Handbook on graph drawing and visualization. Chapman and Hall\/CRC, Boca Raton, pp 155\u2013192. https:\/\/www.crcpress.com\/Handbook-of-Graph-Drawing-and-Visualization\/Tamassia\/9781584884125","key":"2_CR89"},{"key":"2_CR90","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1186\/1471-2105-10-375","volume":"10","author":"F Schreiber","year":"2009","unstructured":"Schreiber F, Dwyer T, Marriott K, Wybrow M (2009) A generic algorithm for layout of biological networks. BMC Bioinform 10:375","journal-title":"BMC Bioinform"},{"doi-asserted-by":"crossref","unstructured":"Shih W, Hsu W (1999) A new planarity test. Theor Comput Sci 223(1\u20132):179\u2013191. http:\/\/dx.doi.org\/10.1016\/S0304-3975(98)00120-0","key":"2_CR91","DOI":"10.1016\/S0304-3975(98)00120-0"},{"issue":"2","key":"2_CR92","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama K, Tagawa S, Toda M (1981) Methods for visual understanding of hierarchical system structures. IEEE Trans Syst Man Cybern 11(2):109\u2013125. http:\/\/dx.doi.org\/10.1109\/TSMC.1981.4308636","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"2_CR93","series-title":"Lecture notes in computer science, vol","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-319-04126-1_6","volume-title":"Applied algorithms - first international conference, ICAA 2014, Kolkata, January 13\u201315, 2014. Proceedings","author":"S Sultana","year":"2014","unstructured":"Sultana S, Rahman MS, Roy A, Tairin S (2014) Bar 1-visibility drawings of 1-planar graphs. In: Gupta P, Zaroliagis CD (eds) Applied algorithms - first international conference, ICAA 2014, Kolkata, January 13\u201315, 2014. Proceedings. Lecture notes in computer science, vol 8321. Springer, Berlin, pp 62\u201376. http:\/\/dx.doi.org\/10.1007\/978-3-319-04126-1_6"},{"issue":"3","key":"2_CR94","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia R (1987) On embedding a graph in the grid with the minimum number of bends. SIAM J Comput 16(3):421\u2013444. http:\/\/dx.doi.org\/10.1137\/0216030","journal-title":"SIAM J Comput"},{"key":"2_CR95","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-16078-7_71","volume-title":"STACS 86, 3rd annual symposium on theoretical aspects of computer science, Orsay, January 16\u201318, 1986, Proceedings","author":"R Tamassia","year":"1986","unstructured":"Tamassia R, Tollis IG (1986) Algorithms for visibility representations of planar graphs. In: Monien B, Vidal-Naquet G (eds) STACS 86, 3rd annual symposium on theoretical aspects of computer science, Orsay, January 16\u201318, 1986, Proceedings. Lecture notes in computer science, vol 210. Springer, Berlin, pp 130\u2013141. http:\/\/dx.doi.org\/10.1007\/3-540-16078-7_71"},{"issue":"1","key":"2_CR96","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R Tamassia","year":"1988","unstructured":"Tamassia R, Battista GD, Batini C (1988) Automatic graph drawing and readability of diagrams. IEEE Trans Syst Man Cybern 18(1):61\u201379. http:\/\/dx.doi.org\/10.1109\/21.87055","journal-title":"IEEE Trans Syst Man Cybern"},{"unstructured":"Tom Sawyer Software (2015) Tom sawyer toolkit. https:\/\/www.tomsawyer.com\/","key":"2_CR97"},{"issue":"4","key":"2_CR98","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"WS Torgerson","year":"1952","unstructured":"Torgerson WS (1952) Multidimensional scaling: I. theory and method. Psychometrika 17(4):401\u2013419. http:\/\/dx.doi.org\/10.1007\/BF02288916","journal-title":"Psychometrika"},{"key":"2_CR99","volume-title":"The visual display of quantitative information","author":"ER Tufte","year":"1992","unstructured":"Tufte ER (1992) The visual display of quantitative information. Graphics Press, Cheshire"},{"unstructured":"TULIP (2015) The Tulip framework. tulip.labri.fr","key":"2_CR100"},{"key":"2_CR101","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"WT Tutte","year":"1960","unstructured":"Tutte WT (1960) Convex representations of graphs. Proc Lond Math Soc 10:304\u2013320","journal-title":"Proc Lond Math Soc"},{"key":"2_CR102","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte WT (1963) How to draw a graph. Proc Lond Math Soc 13:743\u2013767","journal-title":"Proc Lond Math Soc"},{"unstructured":"University of Florida (2015) The university of Florida sparse matrix collection. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/","key":"2_CR103"},{"issue":"3","key":"2_CR104","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"Chris Walshaw","year":"2003","unstructured":"Walshaw C (2003) A multilevel algorithm for force-directed graph-drawing. J Graph Algorithms Appl 7(3):253\u2013285. http:\/\/www.cs.brown.edu\/publications\/jgaa\/accepted\/2003\/Walshaw2003.7.3.pdf","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"2_CR105","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C Ware","year":"2002","unstructured":"Ware C, Purchase HC, Colpoys L, McGill M (2002) Cognitive measurements of graph aesthetics. Inf. Vis. 1(2):103\u2013110. http:\/\/dx.doi.org\/10.1057\/palgrave.ivs.9500013","journal-title":"Inf. Vis."},{"issue":"1","key":"2_CR106","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1109\/TVCG.2015.2467251","volume":"22","author":"Vahan Yoghourdjian","year":"2016","unstructured":"Yoghourdjian V, Dwyer T, Gange G, Kieffer S, Klein K, Marriott K (2016) High-quality ultra-compact grid layout of grouped networks. IEEE Trans Vis Comput Graph 22(1):339\u2013348. http:\/\/doi.ieeecomputersociety.org\/10.1109\/TVCG.2015.2467251","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"2_CR107","first-page":"180","volume-title":"11th international symposium on parallel and distributed computing, ISPDC 2012, Munich, June 25\u201329, 2012","author":"E Yunis","year":"2012","unstructured":"Yunis E, Yokota R, Ahmadia AJ (2012) Scalable force directed graph layout algorithms using fast multipole methods. In: Bader M, Bungartz H, Grigoras D, Mehl M, Mundani R, Potolea R (eds) 11th international symposium on parallel and distributed computing, ISPDC 2012, Munich, June 25\u201329, 2012. IEEE Computer Society, New York, pp 180\u2013187. http:\/\/dx.doi.org\/10.1109\/ISPDC.2012.32"}],"container-title":["Data-Centric Systems and Applications","Graph Data Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96193-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T01:23:06Z","timestamp":1572398586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96193-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961927","9783319961934"],"references-count":107,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96193-4_2","relation":{},"ISSN":["2197-9723","2197-974X"],"issn-type":[{"type":"print","value":"2197-9723"},{"type":"electronic","value":"2197-974X"}],"subject":[],"published":{"date-parts":[[2018]]}}}