{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:31:01Z","timestamp":1762032661335},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_3","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"8-19","source":"Crossref","is-referenced-by-count":26,"title":["Integrating Edge Routing into Force-Directed Layout"],"prefix":"10.1007","author":[{"given":"Tim","family":"Dwyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wybrow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"1","volume-title":"DAC\u201965: Proceedings of the SHARE design automation project","author":"C.J. Fisk","year":"1965","unstructured":"Fisk, C.J., Isett, D.D.: ACCEL: automated circuit card etching layout. In: DAC\u201965: Proceedings of the SHARE design automation project, pp. 1\u20139. ACM Press, New York (1965)"},{"key":"3_CR2","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":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-46648-7_36","volume-title":"Graph Drawing","author":"F. Bertault","year":"1999","unstructured":"Bertault, F.: A force-directed algorithm that preserves edge crossing properties. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 351\u2013358. Springer, Heidelberg (1999)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-37623-2_4","volume-title":"Graph Drawing","author":"U. Brandes","year":"1999","unstructured":"Brandes, U., Wagner, D.: Using graph layout to visualize train interconnection data. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 44\u201356. Springer, Heidelberg (1999)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/978-3-540-31843-9_46","volume-title":"Graph Drawing","author":"B. Finkel","year":"2005","unstructured":"Finkel, B., Tamassia, R.: Curvilinear graph drawing using the force-directed method. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 448\u2013453. Springer, Heidelberg (2005)"},{"key":"3_CR6","volume-title":"Proc. IEEE Symp. on Information Visualisation (Infovis\u201906)","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. In: Proc. IEEE Symp. on Information Visualisation (Infovis\u201906), IEEE Computer Society Press, Los Alamitos (To appear, 2006)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"Fruchterman, T., Reingold, E.M.: Graph drawing by force-directed placement. Software - Practice and Experience\u00a021, 1129\u20131164 (1991)","journal-title":"Software - Practice and Experience"},{"key":"3_CR9","first-page":"246","volume-title":"SODA \u201901: Proc. of the 12th Annual ACM-SIAM Symp. on Discrete Algorithms","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. In: SODA \u201901: Proc. of the 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 246\u2013255. ACM Press, New York (2001)"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. Journal of Algebraic Discrete Methods\u00a04(3), 312\u2013316 (1983)","journal-title":"Journal of Algebraic Discrete Methods"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/192309.192319","volume-title":"AVI \u201994: Proceedings of the Workshop on Advanced Visual Interfaces","author":"D. Harel","year":"1994","unstructured":"Harel, D., Sardas, M.: Randomized graph drawing with heavy-duty preprocessing. In: AVI \u201994: Proceedings of the Workshop on Advanced Visual Interfaces, Bari, Italy, pp. 19\u201333. ACM Press, New York (1994), doi:10.1145\/192309.192319"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/11618058_40","volume-title":"Graph Drawing","author":"M. Wybrow","year":"2006","unstructured":"Wybrow, M., Marriott, K., Stuckey, P.J.: Incremental connector routing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 446\u2013457. Springer, Heidelberg (2006)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","first-page":"435","volume-title":"Graph Drawing","author":"H.C. Purchase","year":"1997","unstructured":"Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 435\u2013446. Springer, Heidelberg (1997)"},{"issue":"2","key":"3_CR14","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. Information Visualization\u00a01(2), 103\u2013110 (2002)","journal-title":"Information Visualization"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-63938-1_68","volume-title":"Graph Drawing","author":"D.P. Dobkin","year":"1997","unstructured":"Dobkin, D.P., Gansner, E.R., Koutsofios, E., North, S.C.: Implementing a general-purpose edge router. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 262\u2013271. Springer, Heidelberg (1997)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44669-9_14","volume-title":"Fundamentals of Computation Theory","author":"K. Freivalds","year":"2001","unstructured":"Freivalds, K.: Curved edge routing. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 126\u2013137. Springer, Heidelberg (2001)"},{"key":"3_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry, pp. 359\u2013365. Springer, Heidelberg (1985)"},{"key":"3_CR18","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.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 153\u2013164. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:11:31Z","timestamp":1605762691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_3","relation":{},"subject":[]}}