{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:46Z","timestamp":1725524626979},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_19","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"193-205","source":"Crossref","is-referenced-by-count":12,"title":["The Binary Stress Model for Graph Drawing"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Koren","sequence":"first","affiliation":[]},{"given":"Ali","family":"\u00c7ivril","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J.E. Barnes","year":"1986","unstructured":"Barnes, J.E., Hut, P.: A hierarchical O(N\n                  log\n                  N) force calculation algorithm. Nature\u00a0324(4), 446\u2013449 (1986)","journal-title":"Nature"},{"key":"19_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2711-1","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"I. Borg","year":"1997","unstructured":"Borg, I., Groenen, P.: Modern Multidimensional Scaling: Theory and Applications. Springer, Heidelberg (1997)"},{"key":"19_CR3","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"19_CR4","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Cong. Numer.\u00a042, 149\u2013160 (1984)","journal-title":"Cong. Numer."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-45848-4_30","volume-title":"Graph Drawing","author":"K. Freivalds","year":"2002","unstructured":"Freivalds, K., Dogrusoz, U., Kikusts, P.: Disconnected graph layout and the polyomino packing approach. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 378\u2013391. Springer, Heidelberg (2002)"},{"issue":"11","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.G. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.G., Reingold, E.: Graph drawing by force-directed placement. Software-Practice Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software-Practice Experience"},{"key":"19_CR7","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. Gansner","year":"2005","unstructured":"Gansner, E., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1109\/TVCG.2005.66","volume":"11","author":"E. Gansner","year":"2005","unstructured":"Gansner, E., Koren, Y., North, S.: Topological fisheye views for visualizing large graphs. IEEE Trans. Vis. Comput. Graph.\u00a011(4), 457\u2013468 (2005)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S. Hachul","year":"2005","unstructured":"Hachul, S., Junger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","volume":"17","author":"K.M. Hall","year":"1970","unstructured":"Hall, K.M.: An r-dimensional quadratic placement algorithm. Management Science\u00a017(3), 219\u2013229 (1970)","journal-title":"Management Science"},{"issue":"1","key":"19_CR11","first-page":"37","volume":"10","author":"Y.F. Hu","year":"2005","unstructured":"Hu, Y.F.: Efficient high quality force-directed graph drawing. The Mathematica Journal\u00a010(1), 37\u201371 (2005)","journal-title":"The Mathematica Journal"},{"key":"19_CR12","unstructured":"Hu, Y.F.: A gallery of large graphs, \n                    \n                      http:\/\/www.research.att.com\/~yifanhu\/GALLERY\/GRAPHS"},{"issue":"1","key":"19_CR13","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. Information Processing Letters\u00a031(1), 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"key":"19_CR15","unstructured":"Koren, Y.: Graph drawing by subspace optimization. In: Eurographics \/ IEEE TCVG Symposium on Visualization, pp. 65\u201374 (2004)"},{"key":"19_CR16","unstructured":"Kruskal, J., Seery, J.: Designing network diagrams. In: First General Conference on Social Graphics, pp. 22\u201350 (1980)"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph Drawing","author":"A. Quigley","year":"2001","unstructured":"Quigley, A., Eades, P.: FADE: Graph drawing, clustering and visual abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 197\u2013210. Springer, Heidelberg (2001)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to Draw a Graph. Proc. London Math. Soc.\u00a0s3-13(1), 743\u2013767 (1963)","journal-title":"Proc. London Math. Soc."},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume-title":"Graph Drawing","author":"C. Walshaw","year":"2001","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 171\u2013182. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T00:15:38Z","timestamp":1551744938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}