{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:10Z","timestamp":1740099190567,"version":"3.37.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030011284"},{"type":"electronic","value":"9783030011291"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01129-1_13","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T03:26:43Z","timestamp":1537327603000},"page":"212-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Generalized Force-Directed Layout for Multiplex Sociograms"],"prefix":"10.1007","author":[{"given":"Zahra","family":"Fatemi","sequence":"first","affiliation":[]},{"given":"Mostafa","family":"Salehi","sequence":"additional","affiliation":[]},{"given":"Matteo","family":"Magnani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-642-36763-2_37","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2013","unstructured":"Bannister, M.J., Eppstein, D., Goodrich, M.T., Trott, L.: Force-directed graph drawing using social gravity and scaling. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 414\u2013425. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_37"},{"key":"13_CR2","volume-title":"Crossings and Planarization","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., Chimani, M., Gutwenger, C., Jnger, M., Mutzel, P.: Crossings and Planarization. CRC Press, Hoboken (2013)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1038\/srep01344","volume":"3","author":"A Cardillo","year":"2013","unstructured":"Cardillo, A., G\u00f3mez-Garde\u00f1es, J., Zanin, M., Romance, M., Papo, D., del Pozo, F., Boccaletti, S.: Emergence of network features from multiplexity. Sci. Rep. 3, 1344 (2013)","journal-title":"Sci. Rep."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/comnet\/cnu038","volume":"3","author":"M Domenico De","year":"2014","unstructured":"De Domenico, M., Porter, M.A., Arenas, A.: MuxViz: a tool for multilayer analysis and visualization of networks. J. Complex Netw. 3, 159\u2013176 (2014)","journal-title":"J. Complex Netw."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"8351","DOI":"10.1073\/pnas.1318469111","volume":"111","author":"M Domenico De","year":"2014","unstructured":"De Domenico, M., Sol\u00e9-Ribalta, A., G\u00f2mez, S., Arenas, A.: Navigability of interconnected networks under random failures. PNAS 111, 8351\u20138356 (2014)","journal-title":"PNAS"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"13_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1057\/palgrave.ivs.9500081","volume":"4","author":"T Dwyer","year":"2004","unstructured":"Dwyer, T., Gallagher, D.R.: Visualising changes in fund manager holdings in two and a half-dimensions. Inf. Vis. 4(3), 227\u2013244 (2004)","journal-title":"Inf. Vis."},{"key":"13_CR8","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"},{"issue":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/TVCG.2008.130","volume":"14","author":"T Dwyer","year":"2008","unstructured":"Dwyer, T., Marriott, K., Schreiber, F., Stuckey, P., Woodward, M., Wybrow, M.: Exploration of networks using overview+detail with constraint-based cooperative layout. IEEE Trans. Vis. Comput. Graph. 14(6), 1293\u2013300 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"11","key":"13_CR10","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)","journal-title":"Softw. Pract. Exp."},{"key":"13_CR11","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":"14","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2821","DOI":"10.1016\/j.ins.2007.02.016","volume":"177","author":"X Huang","year":"2007","unstructured":"Huang, X., Lai, W., Sajeev, A.S.M., Gao, J.: A new algorithm for removing node overlapping in graph visualization. Inf. Sci. 177(14), 2821\u20132844 (2007)","journal-title":"Inf. Sci."},{"issue":"4","key":"13_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.2307\/2785979","volume":"20","author":"HMJ Coleman","year":"1957","unstructured":"Coleman, H.M.J., Katz, E.: The diffusion of an innovation among physicians. Sociometry 20(4), 253\u2013270 (1957)","journal-title":"Sociometry"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1086\/421509","volume":"110","author":"J Moody","year":"2005","unstructured":"Moody, J., McFarland, D., Bender deMoll, S.: Dynamic network visualization. Am. J. Sociol. 110(4), 1206\u20131241 (2005)","journal-title":"Am. J. Sociol."},{"issue":"1","key":"13_CR15","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":"13_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A.: Multilayer networks. J. Complex Netw. 2(3), 203\u2013271 (2014)","journal-title":"J. Complex Netw."},{"key":"13_CR17","unstructured":"Koren, Y., Carmel, L., Harel, D.: ACE: a fast multiscale eigenvectors computation for drawing huge graphs. In: IEEE Symposium on Information Visualization, INFOVIS 2002, pp. 137\u2013144 (2002)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Kumar, P., Zhang, K.: Visualization of clustered directed acyclic graphs with node interleaving. In: Proceedings of the 2009 ACM Symposium on Applied Computing, SAC 2009, New York, NY, USA, pp. 1800\u20131805. ACM (2009)","DOI":"10.1145\/1529282.1529685"},{"issue":"13","key":"13_CR19","doi-asserted-by":"publisher","first-page":"138701","DOI":"10.1103\/PhysRevLett.96.138701","volume":"96","author":"M Kurant","year":"2006","unstructured":"Kurant, M., Thiran, P.: Layered complex networks. Phys. Rev. Lett. 96(13), 138701 (2006)","journal-title":"Phys. Rev. Lett."},{"key":"13_CR20","unstructured":"Ma, D.: Visualization of social media data: mapping changing social networks. Master\u2019s thesis, the Faculty of Geo-Information Science and Earth Observation of the University of Twent (2012)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Magnani, M., Rossi, L.: The ML-model for multi-layer social networks. In: Proceedings of the International Conference on Social Network Analysis and Mining (ASONAM), pp. 5\u201312. IEEE Computer Society (2011)","DOI":"10.1109\/ASONAM.2011.114"},{"key":"13_CR22","doi-asserted-by":"publisher","DOI":"10.1037\/10648-000","volume-title":"Who Shall Survive?: A New Approach to the Problem of Human Interrelations","author":"J Moreno","year":"1934","unstructured":"Moreno, J.: Who Shall Survive?: A New Approach to the Problem of Human Interrelations. Nervous and Mental Disease Publishing Co., Washington, D.C. (1934)"},{"issue":"5","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1086\/498470","volume":"111","author":"JF Padgett","year":"2006","unstructured":"Padgett, J.F., McLean, P.D.: Organizational invention and elite transformation: the birth of partnership systems in renaissance florence. Am. J. Sociol. 111(5), 1463\u20131568 (2006)","journal-title":"Am. J. Sociol."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Redondo, D., Sallaberry, A., Ienco, D., Zaidi, F., Poncelet, P.: Layer-centered approach for multigraphs visualization. In: Proceedings of the International Conference on Information Visualisation (iV), pp. 50\u201355 (2015)","DOI":"10.1109\/iV.2015.20"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1111\/cgf.12644","volume":"34","author":"B Renoust","year":"2015","unstructured":"Renoust, B., Melanon, G., Munzner, T.: Detangler: visual analytics for multiplex networks. Comput. Graph. Forum 34(3), 321\u2013330 (2015)","journal-title":"Comput. Graph. Forum"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.chaos.2014.12.022","volume":"72","author":"L Rossi","year":"2015","unstructured":"Rossi, L., Magnani, M.: Towards effective visual analytics on multiplex and multilayer networks. Chaos Solitons Fractals 72, 68\u201376 (2015)","journal-title":"Chaos Solitons Fractals"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Comb. 1000, DS21 (2013)","DOI":"10.37236\/2713"},{"key":"13_CR28","unstructured":"Shabbeer, A., Ozcaglar, C., Gonzalez, M., Bennett, KP.: Optimal embedding of heterogeneous graph data with edge crossing constraints. In: Presented at NIPS Workshop on Challenges of Data Visualization, p. 1 (2010)"},{"issue":"6","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1111\/j.1467-8659.2011.01898.x","volume":"30","author":"T Landesberger von","year":"2011","unstructured":"von Landesberger, T., et al.: Visual analysis of large graphs: state-of-the-art and future research challenges. Comput. Graph. Forum 30(6), 1719\u20131749 (2011)","journal-title":"Comput. Graph. Forum"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-540-24595-7_41","volume-title":"Graph Drawing","author":"C Erten","year":"2004","unstructured":"Erten, C., Kobourov, S.G., Le, V., Navabi, A.: Simultaneous graph drawing: layout algorithms and visualization schemes. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 437\u2013449. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24595-7_41"},{"issue":"1","key":"13_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P Gajer","year":"2004","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. 29(1), 3\u201318 (2004)","journal-title":"Comput. Geom."},{"issue":"7","key":"13_CR32","first-page":"3","volume":"6","author":"W Peng","year":"2011","unstructured":"Peng, W., SiKun, L.: Social network analysis layout algorithm under ontology model. SOFTWARE 6(7), 3\u201318 (2011)","journal-title":"SOFTWARE"},{"issue":"5","key":"13_CR33","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 Algorithms Appl. 21(5), 791\u2013821 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"13_CR34","unstructured":"Ma, N., Lu, Y., Gan, H., Li, Z.: 2013 10th Web Information System and Application Conference - Trust Network Visualization Based on Force-Directed Layout, (wisa), yangzhou, china, 10 November 2013\u201315 November 2013 (2013)"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-31843-9_6","volume-title":"Graph Drawing","author":"M Baur","year":"2005","unstructured":"Baur, M., Brandes, U., Gaertler, M., Wagner, D.: Drawing the AS graph in 2.5 dimensions. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 43\u201348. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_6"}],"container-title":["Lecture Notes in Computer Science","Social Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01129-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T05:38:12Z","timestamp":1604986692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01129-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030011284","9783030011291"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01129-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SocInfo","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Social Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint-Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socinfo2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/socinfo2018.hse.ru\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"110","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"27% - 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"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2,54","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}