{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:11:07Z","timestamp":1742634667474},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_20","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"206-217","source":"Crossref","is-referenced-by-count":33,"title":["Efficient Node Overlap Removal Using a Proximity Stress Model"],"prefix":"10.1007","author":[{"given":"Emden R.","family":"Gansner","sequence":"first","affiliation":[]},{"given":"Yifan","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","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":"20_CR2","series-title":"Lecture Notes in Computer Science","first-page":"460","volume-title":"Selected Areas in Cryptography","author":"J.H. Chuang","year":"2001","unstructured":"Chuang, J.H., Lin, C.C., Yen, H.C.: Drawing graphs with nonuniform nodes using potential fields. In: Stinson, D.R., Tavares, S. (eds.) SAC 2000. LNCS, vol.\u00a02012, pp. 460\u2013465. Springer, Heidelberg (2001)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11618058_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 153\u2013164. Springer, Heidelberg (2006)"},{"key":"20_CR4","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"20_CR5","first-page":"108","volume-title":"Proc. 8th Workshop Algorithm Engineering and Experiments (ALENEX)","author":"C. Erten","year":"2006","unstructured":"Erten, C., Efrat, A., Forrester, D., Iyer, A., Kobourov, S.G.: Force-directed approaches to sensor network localization. In: Raman, R., Sedgewick, R., Stallmann, M.F. (eds.) Proc. 8th Workshop Algorithm Engineering and Experiments (ALENEX), pp. 108\u2013118. SIAM, Philadelphia (2006)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01840357","volume":"2","author":"S. Fortune","year":"1987","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a02, 153\u2013174 (1987)","journal-title":"Algorithmica"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force directed placement. Software - Practice and Experience\u00a021, 1129\u20131164 (1991)","journal-title":"Software - Practice and Experience"},{"key":"20_CR8","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.R. Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1002\/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N","volume":"30","author":"E.R. Gansner","year":"2000","unstructured":"Gansner, E.R., North, S.: An open graph visualization system and its applications to software engineering. Software - Practice & Experience\u00a030, 1203\u20131233 (2000)","journal-title":"Software - Practice & Experience"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"1999","unstructured":"Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 364\u2013373. Springer, Heidelberg (1999)"},{"key":"20_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198510581.001.0001","volume-title":"Procrustes Problems","author":"J.C. Gower","year":"2004","unstructured":"Gower, J.C., Dijksterhuis, G.B.: Procrustes Problems. Oxford University Press, Oxford (2004)"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. Guibas","year":"1985","unstructured":"Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of voronoi. ACM Trans. Graph.\u00a04(2), 74\u2013123 (1985)","journal-title":"ACM Trans. Graph."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.7155\/jgaa.00051","volume":"6","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. J. Graph Algorithms and Applications\u00a06, 179\u2013202 (2002)","journal-title":"J. Graph Algorithms and Applications"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-37623-2_14","volume-title":"Graph Drawing","author":"K. Hayashi","year":"1999","unstructured":"Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 183\u2013197. Springer, Heidelberg (1999)"},{"key":"20_CR15","unstructured":"Hu, Y.F.: Drawings of the mathematics genealogy project graphs, \n                    \n                      http:\/\/www.research.att.com\/~yifanhu\/GALLERY\/MATH_GENEALOGY"},{"key":"20_CR16","first-page":"37","volume":"10","author":"Y.F. Hu","year":"2005","unstructured":"Hu, Y.F.: Efficient and high quality force-directed graph drawing. Mathematica Journal\u00a010, 37\u201371 (2005)","journal-title":"Mathematica Journal"},{"key":"20_CR17","unstructured":"Huang, X., Lai, W.: Force-transfer: A new approach to removing overlapping nodes in graph layout. In: Proc. 25th Australian Computer Science Conference, pp. 349\u2013358 (2003), \n                    \n                      citeseer.ist.psu.edu\/564050.html"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J.W. Jaromczyk","year":"1992","unstructured":"Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE\u00a080, 1502\u20131517 (1992)","journal-title":"Proc. IEEE"},{"key":"20_CR19","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, 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"key":"20_CR20","unstructured":"Leach, G.: Improving worst-case optimal Delaunay triangulation algorithms. In: 4th Canadian Conference on Computational Geometry. pp. 340\u2013346 (1992), \n                    \n                      citeseer.ist.psu.edu\/leach92improving.html"},{"key":"20_CR21","unstructured":"Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proc. Asia-Pacific Symp. on Information Visualisation, pp. 131\u2013140 (2005)"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Lyons, K.A., Meijer, H., Rappaport, D.: Algorithms for cluster busting in anchored graph drawing. J. Graph Algorithms and Applications\u00a02(1) (1998)","DOI":"10.7155\/jgaa.00004"},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1022371615202","volume":"8","author":"K. Marriott","year":"2003","unstructured":"Marriott, K., Stuckey, P.J., Tam, V., He, W.: Removing node overlapping in graph layout using constrained optimization. Constraints\u00a08(2), 143\u2013171 (2003)","journal-title":"Constraints"},{"key":"20_CR24","unstructured":"Department of mathematics at North Dekota State University: The mathematics genealogy project, \n                    \n                      http:\/\/genealogy.math.ndsu.nodak.edu\/"},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. J. Vis. Lang. Comput.\u00a06(2), 183\u2013210 (1995)","journal-title":"J. Vis. Lang. Comput."},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/BFb0021835","volume-title":"Graph Drawing","author":"X. Wang","year":"1996","unstructured":"Wang, X., Miyamoto, I.: Generating customized layouts. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 504\u2013515. Springer, Heidelberg (1996)"}],"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_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T23:53:34Z","timestamp":1551743614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}