{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:15:03Z","timestamp":1769577303885,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030358013","type":"print"},{"value":"9783030358020","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_23","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"291-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Stress-Plus-X (SPX) Graph Layout"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0610-6573","authenticated-orcid":false,"given":"Sabin","family":"Devkota","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6830-9053","authenticated-orcid":false,"given":"Reyan","family":"Ahmed","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5937-7636","authenticated-orcid":false,"given":"Felice","family":"De Luca","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9947-928X","authenticated-orcid":false,"given":"Katherine E.","family":"Isaacs","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0_2","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?). Thirty Essays Geom. Gr. Theory (2012). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_2","journal-title":"Thirty Essays Geom. Gr. Theory"},{"key":"23_CR2","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":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., F\u00f6rster, H., Geckeler, C., Holl\u00e4nder, L., Kaufmann, M., Spallek, A.M., Splett, J.: A heuristic approach towards drawings of graphs with high crossing resolution. CoRR abs\/1808.10519 (2018). http:\/\/arxiv.org\/abs\/1808.10519","DOI":"10.1007\/978-3-030-04414-5_19"},{"key":"23_CR4","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)"},{"issue":"485","key":"23_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1198\/jasa.2009.0111","volume":"104","author":"L Chen","year":"2009","unstructured":"Chen, L., Buja, A.: Local multidimensional scaling for nonlinear dimension reduction, graph drawing, and proximity analysis. J. Am. Stat. Assoc. 104(485), 209\u2013219 (2009)","journal-title":"J. Am. Stat. Assoc."},{"key":"23_CR6","unstructured":"Dagrejs: dagrejs\/dagre. https:\/\/github.com\/dagrejs\/dagre\/wiki"},{"key":"23_CR7","unstructured":"De Luca, F.: graphmetrics library (2019). https:\/\/github.com\/felicedeluca\/graphmetrics"},{"key":"23_CR8","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":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-319-73915-1_44","volume-title":"Graph Drawing and Network Visualization","author":"W Devanny","year":"2018","unstructured":"Devanny, W., Kindermann, P., L\u00f6ffler, M., Rutter, I.: Graph drawing contest report. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 575\u2013582. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73915-1_44"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-030-04414-5_43","volume-title":"Graph Drawing and Network Visualization","author":"W Devanny","year":"2018","unstructured":"Devanny, W., Kindermann, P., L\u00f6ffler, M., Rutter, I.: Graph drawing contest report. In: Biedl, T., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 609\u2013617. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_43"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Devkota, S., Ahmed, R., De Luca, F., Isaacs, K., Kobourov, S.: Stress-Plus-X (SPX) graph layout (2019)","DOI":"10.1007\/978-3-030-35802-0_23"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-642-36763-2_58","volume-title":"Graph Drawing","author":"CA Duncan","year":"2013","unstructured":"Duncan, C.A., Gutwenger, C., Nachmanson, L., Sander, G.: Graph drawing contest report. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 575\u2013579. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_58"},{"key":"23_CR13","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":"23_CR14","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. Gr. 12, 821\u2013828 (2006). https:\/\/doi.org\/10.1109\/TVCG.2006.156","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"key":"23_CR15","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"},{"issue":"11","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","journal-title":"Softw. Pract. Exp."},{"key":"23_CR17","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":"23_CR18","unstructured":"Gansner, E.R., North, S.C., Vo, K.P.: Technique for drawing directed graphs (1990). uS Patent 4,953,106"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-662-45803-7_42","volume-title":"Graph Drawing","author":"C Gutwenger","year":"2014","unstructured":"Gutwenger, C., L\u00f6ffler, M., Nachmanson, L., Rutter, I.: Graph drawing contest report. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 501\u2013506. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_42"},{"issue":"4","key":"23_CR20","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). https:\/\/doi.org\/10.1016\/j.jvlc.2014.03.001","journal-title":"J. Vis. Lang. Comput."},{"issue":"4","key":"23_CR21","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). https:\/\/doi.org\/10.1016\/j.jvlc.2011.12.002. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1045926X11000814","journal-title":"J. Vis. Lang. Comput."},{"issue":"1","key":"23_CR22","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). https:\/\/doi.org\/10.1016\/0020-0190(89)90102-6. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0020019089901026","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"23_CR23","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). https:\/\/doi.org\/10.1111\/cgf.13187","journal-title":"Comput. Graph. Forum"},{"issue":"1","key":"23_CR24","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"},{"issue":"Nov","key":"23_CR25","first-page":"2579","volume":"9","author":"LVD Maaten","year":"2008","unstructured":"Maaten, L.V.D., Hinton, G.: Visualizing data using t-sne. J. Mach. Learn. Res. 9(Nov), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J., Melville, J.: Umap: uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018)","DOI":"10.21105\/joss.00861"},{"key":"23_CR27","doi-asserted-by":"publisher","unstructured":"Mutzel, P., Chimani, M., Gutwenger, C., Klein, K.: OGDF an open graph drawing framework. In: 15th International Symposium on Graph Drawing (2007). https:\/\/doi.org\/10.17877\/DE290R-7670","DOI":"10.17877\/DE290R-7670"},{"key":"23_CR28","unstructured":"Pich, C.: Applications of multidimensional scaling to graph drawing. Ph.D. thesis (2009)"},{"key":"23_CR29","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":"23_CR30","doi-asserted-by":"publisher","unstructured":"Radermacher, M., Reichard, K., Rutter, I., Wagner, D.: A geometric heuristic for rectilinear crossing minimization. In: Pagh, R., Venkatasubramanian, S. (eds.) The 20th Workshop on Algorithm Engineering and Experiments (ALENEX 2018), pp. 129\u2013138 (2018). https:\/\/doi.org\/10.1137\/1.9781611975055.12","DOI":"10.1137\/1.9781611975055.12"},{"key":"23_CR31","unstructured":"Ruder, S.: An overview of gradient descent optimization algorithms. CoRR abs\/1609.04747 (2016). http:\/\/arxiv.org\/abs\/1609.04747"},{"key":"23_CR32","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). https:\/\/doi.org\/10.1007\/3-540-63938-1_86"},{"key":"23_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":"23_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"},{"issue":"2","key":"23_CR35","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":"1","key":"23_CR36","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1109\/TVCG.2017.2745919","volume":"24","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Wang, Y., Sun, Y., Zhu, L., Lu, K., Fu, C., Sedlmair, M., Deussen, O., Chen, B.: Revisiting stress majorization as a unified framework for interactive constrained graph visualization. IEEE Trans. Vis. Comput. Gr. 24(1), 489\u2013499 (2018). https:\/\/doi.org\/10.1109\/TVCG.2017.2745919","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"issue":"2","key":"23_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."}],"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-35802-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:04:31Z","timestamp":1701133471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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":"12.55","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}