{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:19:43Z","timestamp":1761988783039},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_20","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"234-245","source":"Crossref","is-referenced-by-count":30,"title":["Are Crossings Important for Drawing Large Graphs?"],"prefix":"10.1007","author":[{"given":"Stephen G.","family":"Kobourov","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Pupyrev","sequence":"additional","affiliation":[]},{"given":"Bahador","family":"Saket","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","first-page":"1173","volume":"29","author":"D. Archambault","year":"2010","unstructured":"Archambault, D., Purchase, C.H., Pinadu, B.: The readability of path-preserving clustering of graphs. EuroVis\u00a029(3), 1173\u20131182 (2010)","journal-title":"EuroVis"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bateman, S., Mandryk, R.L., Gutwin, C., Genest, A., McDine, D., Brooks, C.: Useful junk? The effects of visual embellishment on comprehension and memorability of charts. In: CHI, pp. 2573\u20132582 (2010)","DOI":"10.1145\/1753326.1753716"},{"key":"20_CR3","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"issue":"5","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/120872310","volume":"42","author":"S. Cabello","year":"2013","unstructured":"Cabello, S., Mohar, B.: Adding one edge to planar graphs makes crossing number and 1-planarity hard. SIAM Journal on Computing\u00a042(5), 1803\u20131829 (2013)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"20_CR5","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1109\/TVCG.2009.109","volume":"15","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Lee, B., Fisher, D., Quinn, K.I., Isenberg, P., Robertson, G., North, C.: A comparison of user-generated and automatic graph layouts. IEEE Trans. Vis. Comput. Graphics\u00a015(6), 961\u2013968 (2009)","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-45848-4_57","volume-title":"Graph Drawing","author":"J. Ellson","year":"2002","unstructured":"Ellson, J., Gansner, E.R., Koutsofios, L., North, S.C., Woodhull, G.: Graphviz - open source graph drawing tools. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 483\u2013484. Springer, Heidelberg (2002)"},{"issue":"11","key":"20_CR7","first-page":"1129","volume":"21","author":"T.M. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software: Practice and Experience"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. J. Graph Algorithms Appl.\u00a06(3), 179\u2013202 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.jctb.2005.09.009","volume":"96","author":"P. Hlin\u011bn\u1ef3","year":"2006","unstructured":"Hlin\u011bn\u1ef3, P.: Crossing number is hard for cubic graphs. J. Comb. Theory B\u00a096(4), 455\u2013471 (2006)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"20_CR12","first-page":"37","volume":"10","author":"Y. Hu","year":"2005","unstructured":"Hu, Y.: Efficient, high-quality force-directed graph drawing. Mathematica Journal\u00a010(1), 37\u201371 (2005)","journal-title":"Mathematica Journal"},{"issue":"1","key":"20_CR13","first-page":"25","volume":"3","author":"W. Huang","year":"2014","unstructured":"Huang, W., Huang, M.: Exploring the relative importance of number of edge crossings and size of crossing angles: A quantitative perspective. Advanced Intelligence\u00a03(1), 25\u201342 (2014)","journal-title":"Advanced Intelligence"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Huang, W., Eades, P., Hong, S.H.: Larger crossing angles make graphs easier to read. Visual Languages & Computing 1 (2014)","DOI":"10.1016\/j.jvlc.2014.03.001"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11618058_24","volume-title":"Graph Drawing","author":"W. Huang","year":"2006","unstructured":"Huang, W., Hong, S.H., Eades, P.: Layout effects on sociogram perception. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 262\u2013273. Springer, Heidelberg (2006)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Jianu, R., Rusu, A., Hu, Y., Taggart, D.: How to display group information on node\u2013link diagrams: an evaluation. IEEE Trans. Vis. Comput. Graphics (to appear, 2014)","DOI":"10.1109\/TVCG.2014.2315995"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Proc. Let.\u00a031(1), 7\u201315 (1989)","journal-title":"Inf. Proc. Let."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-00219-9_19","volume-title":"Graph Drawing","author":"Y. Koren","year":"2009","unstructured":"Koren, Y., \u00c7ivril, A.: The binary stress model for graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 193\u2013205. Springer, Heidelberg (2009)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Lee, B., Plaisant, C., Parr, C., Fekete, J.D., Henry, N.: Task taxonomy for graph visualization. In: BELIV, pp. 81\u201385. ACM Press (2006)","DOI":"10.1145\/1168149.1168168"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Graph Drawing","author":"H. Purchase","year":"1996","unstructured":"Purchase, H., Cohen, R., James, M.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 435\u2013446. Springer, Heidelberg (1996)"},{"key":"20_CR22","unstructured":"Saket, B., Simonetto, P., Kobourov, S., B\u00f6rner, K.: Node, node-link, and node-link-group diagrams: An evaluation. In: IEEE InfoVis (to appear, 2014)"},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1057\/palgrave.ivs.9500013","volume":"1","author":"C. Ware","year":"2002","unstructured":"Ware, C., Purchase, H.C., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization\u00a01(2), 103\u2013110 (2002)","journal-title":"Information Visualization"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:02:12Z","timestamp":1559077332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}