{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:40:34Z","timestamp":1742992834767,"version":"3.40.3"},"publisher-location":"Cham","reference-count":87,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319919072"},{"type":"electronic","value":"9783319919089"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-319-91908-9_6","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:05:00Z","timestamp":1570165500000},"page":"85-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["10 Reasons to Get Interested in Graph Drawing"],"prefix":"10.1007","author":[{"given":"Carla","family":"Binucci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Dwyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"von Hanxleden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"Schreiber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,5]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"M Alam","year":"2013","unstructured":"Alam, M., Biedl, T., Felsner, S., Kaufmann, M., Kobourov, S., Ueckerdt, T.: Computing cartograms with optimal complexity. Discret. Comput. Geom. 50(3), 784\u2013810 (2013)","journal-title":"Discret. Comput. Geom."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-11805-0_25","volume-title":"Graph Drawing","author":"M Albrecht","year":"2010","unstructured":"Albrecht, M., Kerren, A., Klein, K., Kohlbacher, O., Mutzel, P., Paul, W., Schreiber, F., Wybrow, M.: On open problems in biological network visualization. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 256\u2013267. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-11805-0_25"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TVCG.2016.2598958","volume":"23","author":"B Bach","year":"2017","unstructured":"Bach, B., Riche, N.H., Hurter, C., Marriott, K., Dwyer, T.: Towards unambiguous edge bundling: investigating confluent drawings for network visualization. IEEE Trans. Vis. Comput. Graph. 23(1), 541\u2013550 (2017)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR4","unstructured":"Bachmaier, C., Brandes, U., Schreiber, F.: Biological networks. In: Handbook of Graph Drawing and Visualization, pp. 621\u2013651. Chapman and Hall\/CRC, Boco Raton (2014)"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.7155\/jgaa.00219","volume":"15","author":"M Badent","year":"2011","unstructured":"Badent, M., Brandes, U., Cornelsen, S.: More canonical ordering. J. Graph Algorithms Appl. 15(1), 97\u2013126 (2011)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C Batini","year":"1984","unstructured":"Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity relationship diagrams. J. Syst. Softw. 4(2), 163\u2013173 (1984)","journal-title":"J. Syst. Softw."},{"issue":"4","key":"6_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.: A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng. 12(4), 538\u2013546 (1986)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"7","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1016\/j.disc.2007.12.087","volume":"309","author":"M Berg de","year":"2009","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discret. Math. 309(7), 1794\u20131812 (2009)","journal-title":"Discret. Math."},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02574701","volume":"6","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D.: Some provably hard crossing number problems. Discret. Comput. Geom. 6(5), 443\u2013459 (1991)","journal-title":"Discret. Comput. Geom."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5, 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-36763-2_45","volume-title":"Graph Drawing","author":"S Bies","year":"2013","unstructured":"Bies, S., van Kreveld, M.: Time-space maps from triangulations. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 511\u2013516. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36763-2_45"},{"issue":"1","key":"6_CR12","first-page":"133","volume":"59","author":"C Binucci","year":"2016","unstructured":"Binucci, C., Didimo, W.: Computing quasi-upward planar drawings of mixed graphs. Comput. J. 59(1), 133\u2013150 (2016)","journal-title":"Comput. J."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.comgeo.2005.02.001","volume":"32","author":"C Binucci","year":"2005","unstructured":"Binucci, C., Didimo, W., Liotta, G., Nonato, M.: Orthogonal drawings of graphs with vertex and edge labels. Comput. Geom. 32(2), 71\u2013114 (2005)","journal-title":"Comput. Geom."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2014.01.015","volume":"526","author":"C Binucci","year":"2014","unstructured":"Binucci, C., Didimo, W., Patrignani, M.: Upward and quasi-upward planarity testing of embedded mixed graphs. Theoret. Comput. Sci. 526, 75\u201389 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"12","key":"6_CR15","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1109\/TVCG.2011.185","volume":"17","author":"M Bostock","year":"2011","unstructured":"Bostock, M., Ogievetsky, V., Heer, J.: D\n                      \n                        \n                      \n                      $$^3$$\n                     data-driven documents. IEEE Trans. Vis. Comput. Graph. 17(12), 2301\u20132309 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-540-24595-7_55","volume-title":"Graph Drawing","author":"F Brandenburg","year":"2004","unstructured":"Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P.: Selected open problems in graph drawing. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 515\u2013539. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24595-7_55"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-37623-2_4","volume-title":"Graph Drawing","author":"U Brandes","year":"1998","unstructured":"Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 44\u201356. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/3-540-37623-2_4"},{"key":"6_CR18","unstructured":"Brandes, U., Freeman, L.C., Wagner, D.: Social networks. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 805\u2013839. Chapman and Hall\/CRC, Boca Raton (2013)"},{"key":"6_CR19","first-page":"18","volume":"2014","author":"K Buchin","year":"2014","unstructured":"Buchin, K., van Goethem, A., Hoffmann, M., van Kreveld, M., Speckmann, B.: Travel-time maps: linear cartograms with fixed vertex locations. Geograph. Inf. Sci. (GIScience) 2014, 18\u201333 (2014)","journal-title":"Geograph. Inf. Sci. (GIScience)"},{"issue":"2","key":"6_CR20","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/s00453-013-9867-z","volume":"72","author":"K Buchin","year":"2015","unstructured":"Buchin, K., Speckmann, B., Verbeek, K.: Angle-restricted Steiner arborescences for flow map layout. Algorithmica 72(2), 656\u2013685 (2015)","journal-title":"Algorithmica"},{"key":"6_CR21","first-page":"29","volume":"2012","author":"K Buchin","year":"2012","unstructured":"Buchin, K., Speckmann, B., Verdonschot, S.: Evolution strategies for optimizing rectangular cartograms. GIScience 2012, 29\u201342 (2012)","journal-title":"GIScience"},{"issue":"3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.comgeo.2004.11.002","volume":"30","author":"S Cabello","year":"2005","unstructured":"Cabello, S., de Berg, M., van Kreveld, M.: Schematization of networks. Comput. Geom. 30(3), 223\u2013228 (2005)","journal-title":"Comput. Geom."},{"key":"6_CR23","unstructured":"Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications to graph encoding and graph drawing. In: SODA 2001, pp. 506\u2013515. SIAM (2001)"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. Appl. 7(3), 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"6_CR25","first-page":"150","volume":"5","author":"J Delitsch","year":"1900","unstructured":"Delitsch, J.: \u00dcber Sch\u00fclerfreundschaften in einer Volksschulklasse. Zeitschrift f\u00fcr Kinderforschung 5(4), 150\u2013163 (1900)","journal-title":"Zeitschrift f\u00fcr Kinderforschung"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/BFb0032061","volume-title":"Automata, Languages and Programming","author":"G Battista Di","year":"1990","unstructured":"Di Battista, G., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 598\u2013611. Springer, Heidelberg (1990). \n                      https:\/\/doi.org\/10.1007\/BFb0032061"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45848-4_5","volume-title":"Graph Drawing","author":"G Battista Di","year":"2002","unstructured":"Di Battista, G., Didimo, W., Marcandalli, A.: Planarization of clustered graphs. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 60\u201374. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-45848-4_5"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24595-7_1","volume-title":"Graph Drawing","author":"M Dickerson","year":"2004","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: visualizing non-planar diagrams in a planar way. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 1\u201312. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24595-7_1"},{"issue":"39","key":"6_CR29","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theoret. Comput. Sci. 412(39), 5156\u20135166 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR30","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"CA Duncan","year":"2012","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi drawings of graphs. J. Graph Algorithms Appl. 16(1), 85\u2013108 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-63938-1_77","volume-title":"Graph Drawing","author":"P Eades","year":"1997","unstructured":"Eades, P., Cohen, R.F., Huang, M.L.: Online animated graph drawing for web navigation. In: Di Battista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 330\u2013335. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/3-540-63938-1_77"},{"issue":"3","key":"6_CR32","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1057\/palgrave.ivs.9500078","volume":"3","author":"M Eiglsperger","year":"2004","unstructured":"Eiglsperger, M., Gutwenger, C., Kaufmann, M., Kupke, J., J\u00fcnger, M., Leipert, S., Klein, K., Mutzel, P., Siebenhaller, M.: Automatic layout of UML class diagrams in orthogonal style. Inf. Visual. 3(3), 189\u2013208 (2004)","journal-title":"Inf. Visual."},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-319-03841-4_31","volume-title":"Graph Drawing","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., Holten, D., L\u00f6ffler, M., N\u00f6llenburg, M., Speckmann, B., Verbeek, K.: Strict confluent drawing. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 352\u2013363. Springer, Cham (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-319-03841-4_31"},{"issue":"3","key":"6_CR34","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/TCSI.2004.843056","volume":"52","author":"D Franken","year":"2005","unstructured":"Franken, D., Ochs, J., Ochs, K.: Generation of wave digital structures for networks containing multiport elements. Trans. Circuits Syst. 52(3), 586\u2013596 (2005)","journal-title":"Trans. Circuits Syst."},{"issue":"1","key":"6_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-16145-2_14","volume-title":"Model Driven Engineering Languages and Systems","author":"H Fuhrmann","year":"2010","unstructured":"Fuhrmann, H., von Hanxleden, R.: Taming graphical modeling. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 196\u2013210. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16145-2_14"},{"issue":"3","key":"6_CR37","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"ED Giacomo","year":"2011","unstructured":"Giacomo, E.D., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. Theory Comput. Syst. 49(3), 565\u2013575 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"6_CR38","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1561\/2200000005","volume":"2","author":"A Goldenberg","year":"2010","unstructured":"Goldenberg, A., Zheng, A.X., Fienberg, S.E., Airoldi, E.M.: A survey of statistical network models. Found. Trends Mach. Learn. 2(2), 129\u2013233 (2010)","journal-title":"Found. Trends Mach. Learn."},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-50106-2_18","volume-title":"Graph Drawing and Network Visualization","author":"M Gronemann","year":"2016","unstructured":"Gronemann, M.: Bitonic st-orderings for upward planar graphs. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 222\u2013235. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-50106-2_18"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77\u201390. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44541-2_8"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., J\u00fcnger, M., Klein, K., Kupke, J., Leipert, S., Mutzel, P.: A new approach for visualizing UML class diagrams. In: Diehl, S., Stasko, J.T., Spencer, S.N. (eds.) Symposium on Software Visualization 2003, pp. 179\u2013188. ACM (2003)","DOI":"10.1145\/774833.774859"},{"key":"6_CR42","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.: Advances in C-planarity testing of clustered graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 220\u2013236. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-36151-0_21"},{"key":"6_CR43","volume-title":"Studying Social Networks - A Guide to Empirical Research","author":"M Hennig","year":"2012","unstructured":"Hennig, M., Brandes, U., Pfeffer, J., Mergel, I.: Studying Social Networks - A Guide to Empirical Research. Campus Frankfurt, New York (2012)"},{"key":"6_CR44","unstructured":"Hoffmann, M., van Kreveld, M.J., Kusters, V., Rote, G.: Quality ratios of measures for graph drawing styles. In: 26th Canadian Conference on Computational Geometry, CCCG (2014)"},{"key":"6_CR45","unstructured":"Hoffmann, U.: Intersection graphs and geometric objects in the plane. Ph.D. thesis, Technische Universit\u00e4t Berlin, Berlin (2016)"},{"key":"6_CR46","series-title":"Wiley Series on Bioinformatics, Computational Techniques and Engineering","doi-asserted-by":"publisher","DOI":"10.1002\/9780470253489","volume-title":"Analysis of Biological Networks","author":"BH Junker","year":"2008","unstructured":"Junker, B.H., Schreiber, F.: Analysis of Biological Networks. Wiley Series on Bioinformatics, Computational Techniques and Engineering. Wiley, New York (2008)"},{"key":"6_CR47","first-page":"85","volume":"2010","author":"C Kaiser","year":"2010","unstructured":"Kaiser, C., Walsh, F., Farmer, C., Pozdnoukhov, A.: User-centric time-distance representation of road networks. GIScience 2010, 85\u201399 (2010)","journal-title":"GIScience"},{"key":"6_CR48","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"6_CR49","unstructured":"Karp, P.D., Paley, S.M.: Automated drawing of metabolic pathways. In: Lim, H., Cantor, C., Bobbins, R. (eds.) International Conference on Bioinformatics and Genome Research, pp. 225\u2013238 (1994)"},{"key":"6_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-46648-7_3","volume-title":"Graph Drawing","author":"GW Klau","year":"1999","unstructured":"Klau, G.W., Mutzel, P.: Combining graph labeling and compaction. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 27\u201337. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-46648-7_3"},{"key":"6_CR51","unstructured":"Klauske, L.K., Dziobek, C.: Improving modeling usability: Automated layout generation for Simulink. In: Proc. MathWorks Automotive Conference (2010)"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-06793-3_4","volume-title":"Multivariate Network Visualization","author":"O Kohlbacher","year":"2014","unstructured":"Kohlbacher, O., Schreiber, F., Ward, M.O.: Multivariate networks in the life sciences. In: Kerren, A., Purchase, H.C., Ward, M.O. (eds.) Multivariate Network Visualization. LNCS, vol. 8380, pp. 61\u201373. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-06793-3_4"},{"issue":"2","key":"6_CR53","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Combin. Theory Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"6_CR54","unstructured":"van Kreveld, M.: Geographic information systems (Chap. 59). In: Goodmann, J., O\u2019Rourke, J., Toth, C. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn. Chapman & Hall\/CRC, Boca Raton (2017)"},{"issue":"3","key":"6_CR55","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"M Kreveld van","year":"2007","unstructured":"van Kreveld, M., Speckmann, B.: On rectangular cartograms. Comput. Geom. 37(3), 175\u2013187 (2007)","journal-title":"Comput. Geom."},{"key":"6_CR56","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1093\/bib\/bbr069","volume":"13","author":"M Krzywinski","year":"2012","unstructured":"Krzywinski, M., Birol, I., Jones, S.J., Marra, M.A.: Hive plots - rational approach to visualizing networks. Brief. Bioinform. 13, 627\u2013644 (2012)","journal-title":"Brief. Bioinform."},{"key":"6_CR57","unstructured":"Linnaei, C.: Species Plantarum. Holmiae (1735)"},{"key":"6_CR58","unstructured":"von Manteuffel, A., Studerus, C.: Reduze 2\u2013distributed Feynman integral reduction. CoRR (2012)"},{"key":"6_CR59","unstructured":"Matousek, J.: Intersection graphs of segments and \n                      \n                        \n                      \n                      $$\\exists \\mathbb{R}$$\n                    . \n                      arXiv:1406.2636\n                      \n                     (2014)"},{"key":"6_CR60","doi-asserted-by":"crossref","unstructured":"Mi, H., Schreiber, F., Moodie, S., Czauderna, T., Demir, E., Haw, R., Luna, A., Nov\u00e8re, N.L., Sorokin, A., Vill\u00e9ger, A.: Systems biology graphical notation: activity flow language level 1 version 1.2. J. Integr. Bioinform. 12(2), e265 (2015)","DOI":"10.1515\/jib-2015-265"},{"key":"6_CR61","unstructured":"Moreno, J.L.: Who Shall Survive? Foundations of Sociometry, Group Psychotherapy and Sociodrama. Beacon House, New York (1953). (First published in 1934)"},{"issue":"3","key":"6_CR62","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/882262.882291","volume":"22","author":"T Munzner","year":"2003","unstructured":"Munzner, T., Guimbreti\u00e8re, F., Tasiran, S., Zhang, L., Zhou, Y.: TreeJuxtaposer: scalable tree comparison using focus+ context with guaranteed visibility. ACM Trans. Graph. (TOG) 22(3), 453\u2013462 (2003)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"6_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/3-540-45061-0_4","volume-title":"Automata, Languages and Programming","author":"P Mutzel","year":"2003","unstructured":"Mutzel, P.: The SPQR-tree data structure in graph drawing. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 34\u201346. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/3-540-45061-0_4"},{"key":"6_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48447-7_2","volume-title":"Algorithms and Data Structures","author":"G Neyer","year":"1999","unstructured":"Neyer, G.: Line simplification with restricted orientations. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 13\u201324. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48447-7_2"},{"issue":"2","key":"6_CR65","doi-asserted-by":"publisher","first-page":"595","DOI":"10.7155\/jgaa.00370","volume":"19","author":"A Nocaj","year":"2016","unstructured":"Nocaj, A., Ortmann, M., Brandes, U.: Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Algorithms Appl. 19(2), 595\u2013618 (2016)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"6_CR66","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/TVCG.2010.81","volume":"17","author":"M N\u00f6llenburg","year":"2011","unstructured":"N\u00f6llenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer programming. IEEE Trans. Vis. Comp. Graph. 17(5), 626\u2013641 (2011)","journal-title":"IEEE Trans. Vis. Comp. Graph."},{"issue":"6","key":"6_CR67","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/203241.203251","volume":"38","author":"M Petre","year":"1995","unstructured":"Petre, M.: Why looking isn\u2019t always seeing: readership skills and graphical programming. Commun. ACM 38(6), 33\u201344 (1995)","journal-title":"Commun. ACM"},{"key":"6_CR68","doi-asserted-by":"crossref","unstructured":"R\u00fcegg, U., Lakkundi, R., Prasad, A., Kodaganur, A., Schulze, C.D., von Hanxleden, R.: Incremental diagram layout for automated model migration. In: ACM\/IEEE 19th International Conference on Model Driven Engineering Languages and Systems, MODELS 2016, pp. 185\u2013195. ACM, New York (2016)","DOI":"10.1145\/2976767.2976805"},{"key":"6_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-46105-1_34","volume-title":"Advances in Object-Oriented Information Systems","author":"B Sch\u00e4tz","year":"2002","unstructured":"Sch\u00e4tz, B., Pretschner, A., Huber, F., Philipps, J.: Model-based development of embedded systems. In: Bruel, J.-M., Bellahsene, Z. (eds.) OOIS 2002. LNCS, vol. 2426, pp. 298\u2013311. Springer, Heidelberg (2002). \n                      https:\/\/doi.org\/10.1007\/3-540-46105-1_34"},{"key":"6_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1007\/978-3-662-43948-7_80","volume-title":"Automata, Languages, and Programming","author":"JM Schmidt","year":"2014","unstructured":"Schmidt, J.M.: The Mondshein sequence. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 967\u2013978. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-662-43948-7_80"},{"key":"6_CR71","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138\u2013148 (1990)"},{"issue":"2","key":"6_CR72","first-page":"59","volume":"2","author":"F Schreiber","year":"2002","unstructured":"Schreiber, F.: High quality visualization of biochemical pathways in BioPath. Silico Biol. 2(2), 59\u201373 (2002)","journal-title":"Silico Biol."},{"key":"6_CR73","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.: A generic algorithm for layout of biological networks. BMC Bioinform. 10, 375 (2009)","journal-title":"BMC Bioinform."},{"key":"6_CR74","unstructured":"Schulze, C.D., von Hanxleden, R.: Automatic layout in the face of unattached comments. In: Proceedings of Symposium on Visual Languages and Human-Centric Computing (2014)"},{"key":"6_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-63938-1_86","volume-title":"Graph Drawing","author":"J Seemann","year":"1997","unstructured":"Seemann, J.: Extending the Sugiyama algorithm for drawing UML class diagrams: towards automatic layout of object-oriented software diagrams. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 415\u2013424. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/3-540-63938-1_86"},{"issue":"1","key":"6_CR76","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/102377.115768","volume":"11","author":"B Shneiderman","year":"1992","unstructured":"Shneiderman, B.: Tree visualization with tree-maps: 2-D space-filling approach. ACM Trans. Graph. 11(1), 92\u201399 (1992)","journal-title":"ACM Trans. Graph."},{"key":"6_CR77","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/1221972","volume":"32","author":"P Stevens","year":"1983","unstructured":"Stevens, P.: Augustin Augier\u2019s \u201cArbre Botanique\u201d (1801), a remarkable early botanical representation of the natural system. Taxon 32, 203\u2013211 (1983)","journal-title":"Taxon"},{"issue":"2","key":"6_CR78","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.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man. Cybern. 11(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man. Cybern."},{"issue":"3","key":"6_CR79","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"volume-title":"Handbook of Graph Drawing and Visualization","year":"2013","key":"6_CR80","unstructured":"Tamassia, R. (ed.): Handbook of Graph Drawing and Visualization. Chapman and Hall\/CRC, Boca Raton (2013)"},{"key":"6_CR81","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-77537-9_37","volume-title":"Graph Drawing","author":"V Tsiaras","year":"2008","unstructured":"Tsiaras, V., Triantafilou, S., Tollis, I.G.: Treemaps for directed acyclic graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 377\u2013388. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-77537-9_37"},{"key":"6_CR82","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-37623-2_33","volume-title":"Graph Drawing","author":"D Tunkelang","year":"1998","unstructured":"Tunkelang, D.: JIGGLE: Java interactive graph layout environment. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 413\u2013422. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/3-540-37623-2_33"},{"issue":"9","key":"6_CR83","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.datak.2009.02.015","volume":"68","author":"J Vanhatalo","year":"2009","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Koehler, J.: The refined process structure tree. Data Knowl.Eng. 68(9), 793\u2013818 (2009)","journal-title":"Data Knowl.Eng."},{"issue":"12","key":"6_CR84","doi-asserted-by":"publisher","first-page":"2536","DOI":"10.1109\/TVCG.2011.202","volume":"17","author":"K Verbeek","year":"2011","unstructured":"Verbeek, K., Buchin, K., Speckmann, B.: Flow map layout via spiral trees. IEEE Trans. Vis. Comput. Graph. 17(12), 2536\u20132544 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"6_CR85","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Aanalysis. Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Aanalysis. Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"6_CR86","first-page":"45","volume":"5","author":"A Wohl","year":"1907","unstructured":"Wohl, A.: Die neueren Ansichten \u00fcber den chemischen Verlauf der G\u00e4rung. Biochemische Zeitschrift 5, 45\u201364 (1907)","journal-title":"Biochemische Zeitschrift"},{"key":"6_CR87","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Luk, W.S., Zhou, H., Yan, C., Zeng, X.: Layout decomposition with pairwise coloring for multiple patterning lithography. In: Proceedings of International Conference on Computer-Aided Design, pp. 170\u2013177. IEEE Press (2013)","DOI":"10.1109\/ICCAD.2013.6691115"}],"container-title":["Lecture Notes in Computer Science","Computing and Software Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-91908-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T12:14:33Z","timestamp":1579608873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-91908-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783319919072","9783319919089"],"references-count":87,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-91908-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}