{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:16:26Z","timestamp":1782317786264,"version":"3.54.5"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030687656","type":"print"},{"value":"9783030687663","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-68766-3_1","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Graph Drawing via Gradient Descent, $$(GD)^2$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6830-9053","authenticated-orcid":false,"given":"Reyan","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5937-7636","authenticated-orcid":false,"given":"Felice","family":"De Luca","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0610-6573","authenticated-orcid":false,"given":"Sabin","family":"Devkota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0457-8091","authenticated-orcid":false,"given":"Mingwei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"1_CR1","unstructured":"Abadi, M., et al.: TensorFlow: a system for large-scale machine learning. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2016), pp. 265\u2013283 (2016)"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0_2","volume-title":"Thirty Essays on Geometric Graph Theory","author":"BM \u00c1brego","year":"2012","unstructured":"\u00c1brego, B.M., Fern\u00e1ndez-Merchant, S., Salazar, G.: The rectilinear crossing number of $$k_n$$: closing in (or are we?). In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_2"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, R., De Luca, F., Devkota, S., Kobourov, S., Li, M.: Graph drawing via gradient descent, $$(GD)^2$$. arXiv preprint arXiv:2008.05584 (2020)","DOI":"10.1007\/978-3-030-68766-3_1"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-18469-7_6","volume-title":"Graph Drawing","author":"EN Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: Maximizing the total resolution of graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 62\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_6"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-030-04414-5_19","volume-title":"Graph Drawing and Network Visualization","author":"MA Bekos","year":"2018","unstructured":"Bekos, M.A., et al.: A heuristic approach towards drawings of graphs with high crossing resolution. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 271\u2013285. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_19"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Berman, M., Rannen Triki, A., Blaschko, M.B.: The Lov\u00e1sz-softmax loss: a tractable surrogate for the optimization of the intersection-over-union measure in neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 4413\u20134421 (2018)","DOI":"10.1109\/CVPR.2018.00464"},{"issue":"12","key":"1_CR7","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.: D3: data-driven documents. IEEE Trans. Vis. Comput. Graph. 17(12), 2301\u20132309 (2011)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"1_CR8","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., J\u00fcnger, M., Mutzel, P.: Crossings and planarization. In: Handbook of Graph Drawing and Visualization, pp. 43\u201385 (2013)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chen, K.T., Dwyer, T., Marriott, K., Bach, B.: DoughNets: visualising networks using torus wrapping. In: Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems, pp. 1\u201311 (2020)","DOI":"10.1145\/3313831.3376180"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: Proceedings of the 12th Annual Symposium on Computational Geometry, pp. 319\u2013328 (1996)","DOI":"10.1145\/237218.237401"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. (TOG) 15(4), 301\u2013331 (1996)","journal-title":"ACM Trans. Graph. (TOG)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-030-04414-5_20","volume-title":"Graph Drawing and Network Visualization","author":"A Demel","year":"2018","unstructured":"Demel, A., D\u00fcrrschnabel, D., Mchedlidze, T., Radermacher, M., Wulf, L.: A Greedy heuristic for crossing-angle maximization. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 286\u2013299. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_20"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-31843-9_56","volume-title":"Graph Drawing","author":"FJ Brandenburg","year":"2005","unstructured":"Brandenburg, F.J., Duncan, C.A., Gansner, E., Kobourov, S.G.: Graph-drawing contest report. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 512\u2013516. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_56"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-35802-0_23","volume-title":"Graph Drawing and Network Visualization","author":"S Devkota","year":"2019","unstructured":"Devkota, S., Ahmed, R., De Luca, F., Isaacs, K.E., Kobourov, S.: Stress-plus-X (SPX) graph layout. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 291\u2013304. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_23"},{"key":"1_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0","volume-title":"Thirty essays on geometric graph theory","author":"W Didimo","year":"2014","unstructured":"Didimo, W., Liotta, G.: The Crossing-angle Resolution in Graph Drawing. In: Pach, J. (ed.) Thirty essays on geometric graph theory. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-37623-2_9","volume-title":"Graph Drawing","author":"CA Duncan","year":"1998","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Balanced aspect ratio trees and their use for drawing very large graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 111\u2013124. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_9"},{"key":"1_CR17","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.: Scalable, versatile and simple constrained graph layout. Comput. Graph. Forum 28, 991\u2013998 (2009)","journal-title":"Comput. Graph. Forum"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TVCG.2006.156","volume":"12","author":"T Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: an incremental procedure for separation constraint layout of graphs. IEEE Trans. Vis. Comput. Graph. 12, 821\u20138 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-27261-0_41","volume-title":"Graph Drawing and Network Visualization","author":"P Eades","year":"2015","unstructured":"Eades, P., Hong, S.-H., Klein, K., Nguyen, A.: Shape-based quality metrics for large graph visualization. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 502\u2013514. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_41"},{"key":"1_CR20","unstructured":"Eades, P., Huang, W., Hong, S.H.: A force-directed method for large crossing angle graph drawing. arXiv preprint arXiv:1012.4559 (2010)"},{"key":"1_CR21","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., Koutsofios, L., North, S.C., Woodhull, G.: Graphviz\u2014 open source graph drawing tools. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 483\u2013484. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45848-4_57"},{"key":"1_CR22","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":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_25"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Griewank, A., Walther, A.: Evaluating derivatives: principles and techniques of algorithmic differentiation, vol. 105. SIAM (2008)","DOI":"10.1137\/1.9780898717761"},{"issue":"4","key":"1_CR24","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.H.: Larger crossing angles make graphs easier to read. J. Vis. Lang. Comput. 25(4), 452\u2013465 (2014)","journal-title":"J. Vis. Lang. Comput."},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/j.jvlc.2011.12.002","volume":"24","author":"W Huang","year":"2013","unstructured":"Huang, W., Eades, P., Hong, S.H., Lin, C.C.: Improving multiple aesthetics produces better graph drawings. J. Vis. Lang. Comput. 24(4), 262\u2013272 (2013)","journal-title":"J. Vis. Lang. Comput."},{"issue":"1","key":"1_CR26","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. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/cgf.13187","volume":"36","author":"JF Kruiger","year":"2017","unstructured":"Kruiger, J.F., Rauber, P.E., Martins, R.M., Kerren, A., Kobourov, S., Telea, A.C.: Graph layouts by t-SNE. Comput. Graph. Forum 36(3), 283\u2013294 (2017)","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"1_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289565","volume":"29","author":"JB Kruskal","year":"1964","unstructured":"Kruskal, J.B.: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika 29(1), 1\u201327 (1964)","journal-title":"Psychometrika"},{"key":"1_CR29","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems, pp. 8024\u20138035 (2019)"},{"key":"1_CR30","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 Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248\u2013261. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63938-1_67"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Radermacher, M., Reichard, K., Rutter, I., Wagner, D.: A geometric heuristic for rectilinear crossing minimization. In: The 20th Workshop on Algorithm Engineering and Experiments, pp. 129\u2013138 (2018)","DOI":"10.1137\/1.9781611975055.12"},{"issue":"1","key":"1_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.7155\/jgaa.00216","volume":"15","author":"A Schulz","year":"2011","unstructured":"Schulz, A.: Drawing 3-polytopes with good vertex resolution. J. Graph Algorithms Appl. 15(1), 33\u201352 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"1_CR33","unstructured":"Shabbeer, A., Ozcaglar, C., Gonzalez, M., Bennett, K.P.: Optimal embedding of heterogeneous graph data with edge crossing constraints. In: NIPS Workshop on Challenges of Data Visualization (2010)"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02289630","volume":"27","author":"RN Shepard","year":"1962","unstructured":"Shepard, R.N.: The analysis of proximities: multidimensional scaling with an unknown distance function. Psychometrika 27(2), 125\u2013140 (1962)","journal-title":"Psychometrika"},{"key":"1_CR35","unstructured":"Smilkov, D., et al.: Tensorflow.js: machine learning for the web and beyond. In: Proceedings of Machine Learning and Systems 2019, pp. 309\u2013321 (2019)"},{"issue":"1","key":"1_CR36","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TVCG.2017.2745919","volume":"24","author":"Y Wang","year":"2017","unstructured":"Wang, Y., et al.: Revisiting stress majorization as a unified framework for interactive constrained graph visualization. IEEE Trans. Vis. Comput. Graph. 24(1), 489\u2013499 (2017)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"2","key":"1_CR37","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., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103\u2013110 (2002)","journal-title":"Inf. Vis."},{"issue":"9","key":"1_CR38","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1109\/TVCG.2018.2859997","volume":"25","author":"JX Zheng","year":"2018","unstructured":"Zheng, J.X., Pawar, S., Goodman, D.F.: Graph drawing by stochastic gradient descent. IEEE Trans. Vis. Comput. Graph. 25(9), 2738\u20132748 (2018)","journal-title":"IEEE Trans. Vis. Comput. Graph."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68766-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:22Z","timestamp":1739401402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vancouver, BC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2020.cs.ubc.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"82","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,02","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}