{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:02:46Z","timestamp":1781798566327,"version":"3.54.5"},"publisher-location":"Cham","reference-count":18,"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_2","type":"book-chapter","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T09:11:53Z","timestamp":1613293913000},"page":"18-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Stochastic Gradient Descent Works Really Well for Stress Minimization"],"prefix":"10.1007","author":[{"given":"Katharina","family":"B\u00f6rsig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1520-0430","authenticated-orcid":false,"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barna","family":"Pasztor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,14]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-27848-8_648-1","volume-title":"Encyclopedia of Algorithms","author":"U Brandes","year":"2014","unstructured":"Brandes, U.: Force-directed graph drawing. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20136. Springer, New York (2014). https:\/\/doi.org\/10.1007\/978-3-642-27848-8_648-1"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-25878-7_11","volume-title":"Graph Drawing","author":"U Brandes","year":"2012","unstructured":"Brandes, U., Mader, M.: A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 99\u2013110. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-25878-7_11"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-70904-6_6","volume-title":"Graph Drawing","author":"U Brandes","year":"2007","unstructured":"Brandes, U., Pich, C.: Eigensolver methods for progressive multidimensional scaling of large data. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 42\u201353. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70904-6_6"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-00219-9_21","volume-title":"Graph Drawing","author":"U Brandes","year":"2009","unstructured":"Brandes, U., Pich, C.: An experimental study on distance-based graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 218\u2013229. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_21"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.7155\/jgaa.00221","volume":"15","author":"U Brandes","year":"2011","unstructured":"Brandes, U., Pich, C.: More flexible radial layout. J. Graph Alg. Appl. 15(1), 157\u2013173 (2011). https:\/\/doi.org\/10.7155\/jgaa.00221","journal-title":"J. Graph Alg. Appl."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049663","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1 (2011). https:\/\/doi.org\/10.1145\/2049662.2049663","journal-title":"ACM Trans. Math. Softw."},{"key":"2_CR7","unstructured":"De Leeuw, J.: Applications of convex analysis to multidimensional scaling. In: Barra, J.R., Brodeau, F., Romier, G., Van Cutsem, B. (eds.) Recent Developments in Statistics, pp. 133\u2013145. North Holland Publishing Company (1977). http:\/\/www.stat.ucla.edu\/~deleeuw\/janspubs\/1977\/chapters\/deleeuw_C_77.pdf"},{"issue":"7","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1016\/j.disc.2007.12.103","volume":"309","author":"T Dwyer","year":"2009","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: Constrained graph layout by stress majorization and gradient projection. Discrete Math. 309(7), 1895\u20131908 (2009). https:\/\/doi.org\/10.1016\/j.disc.2007.12.103","journal-title":"Discrete Math."},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1109\/TVCG.2012.299","volume":"19","author":"ER Gansner","year":"2013","unstructured":"Gansner, E.R., Hu, Y., North, S.C.: A maxent-stress model for graph layout. IEEE Trans. Vis. Comput. Graph. 19(6), 927\u2013940 (2013). https:\/\/doi.org\/10.1109\/TVCG.2012.299","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR10","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"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1109\/TVCG.2008.85","volume":"15","author":"S Ingram","year":"2009","unstructured":"Ingram, S., Munzner, T., Olano, M.: Glimmer: multilevel MDS on the GPU. IEEE Trans. Vis. Comput. Graph. 15(2), 249\u2013261 (2009). https:\/\/doi.org\/10.1109\/TVCG.2008.85","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2_CR12","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, 7\u201315 (1989). https:\/\/doi.org\/10.1016\/0020-0190(89)90102-6","journal-title":"Inf. Process. Lett."},{"key":"2_CR13","first-page":"383","volume-title":"Handbook of Graph Drawing and Visualization","author":"SG Kobourov","year":"2013","unstructured":"Kobourov, S.G.: Force-directed drawing algorithms. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 383\u2013408. CRC Press, Oxford (2013)"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1111\/j.2044-8317.1966.tb00367.x","volume":"19","author":"VE McGee","year":"1966","unstructured":"McGee, V.E.: The multidimensional scaling of \u2018elastic\u2019 distances. Br. J. Math. Stat. Psychol. 19(2), 181\u2013196 (1966). https:\/\/doi.org\/10.1111\/j.2044-8317.1966.tb00367.x","journal-title":"Br. J. Math. Stat. Psychol."},{"issue":"5","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1109\/TVCG.2017.2689016","volume":"24","author":"H Meyerhenke","year":"2018","unstructured":"Meyerhenke, H., N\u00f6llenburg, M., Schulz, C.: Drawing large graphs by multilevel maxent-stress optimization. IEEE Trans. Visual Comput. Graphics 24(5), 1814\u20131827 (2018). https:\/\/doi.org\/10.1109\/TVCG.2017.2689016","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"595","DOI":"10.7155\/jgaa.00370","volume":"19","author":"A Nocaj","year":"2015","unstructured":"Nocaj, A., Ortmann, M., Brandes, U.: Untangling the hairballs of multi-centered, small-world online social media networks. J. Graph Alg. Appl. 19(2), 595\u2013618 (2015). https:\/\/doi.org\/10.7155\/jgaa.00370","journal-title":"J. Graph Alg. Appl."},{"issue":"5","key":"2_CR17","doi-asserted-by":"publisher","first-page":"791","DOI":"10.7155\/jgaa.00440","volume":"21","author":"M Ortmann","year":"2017","unstructured":"Ortmann, M., Klimenta, M., Brandes, U.: A sparse stress model. J. Graph Alg. Appl. 21(5), 791\u2013821 (2017). https:\/\/doi.org\/10.7155\/jgaa.00440","journal-title":"J. Graph Alg. Appl."},{"issue":"9","key":"2_CR18","doi-asserted-by":"publisher","first-page":"2738","DOI":"10.1109\/TVCG.2018.2859997","volume":"25","author":"JX Zheng","year":"2019","unstructured":"Zheng, J.X., Pawar, S., Goodman, D.F.M.: Graph drawing by stochastic gradient descent. IEEE Trans. Visual Comput. Graphics 25(9), 2738\u20132748 (2019). https:\/\/doi.org\/10.1109\/TVCG.2018.2859997","journal-title":"IEEE Trans. Visual Comput. Graphics"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T23:03:20Z","timestamp":1739401400000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68766-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030687656","9783030687663"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68766-3_2","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)"}}]}}