{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:02:46Z","timestamp":1781798566344,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642002182","type":"print"},{"value":"9783642002199","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_22","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"230-241","source":"Crossref","is-referenced-by-count":26,"title":["Topology Preserving Constrained Graph Layout"],"prefix":"10.1007","author":[{"given":"Tim","family":"Dwyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Wybrow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","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":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-63938-1_73","volume-title":"Graph Drawing","author":"S.S. Bridgeman","year":"1997","unstructured":"Bridgeman, S.S., Fanto, J., Garg, A., Tamassia, R., Vismara, L.: InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 303\u2013308. Springer, Heidelberg (1997)"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TVCG.2006.67","volume":"12","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: Drawing directed graphs using quadratic programming. IEEE Transactions on Visualization and Computer Graphics\u00a012(4), 536\u2013548 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"5","key":"22_CR4","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 Transactions on Visualization and Computer Graphics\u00a012(5), 821\u2013828 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"GD 2008","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Dunnart: A constraint-based network diagram authoring tool. In: GD 2008. LNCS, vol.\u00a05417. Springer, Heidelberg (to appear, 2009)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Exploration of networks using overview+detail with constraint-based cooperative layout. IEEE Transactions on Visualization and Computer Graphics (InfoVis 2008) (to appear 2008)","DOI":"10.1109\/TVCG.2008.130"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-70904-6_3","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2007","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 8\u201319. Springer, Heidelberg (2007)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44969-8_6","volume-title":"Drawing Graphs: Methods and Models, chap. Orthogonal graph drawing","author":"M. Eiglsperger","year":"2001","unstructured":"Eiglsperger, M., Fekete, S.P., Klau, G.W.: Drawing Graphs: Methods and Models, chap. Orthogonal graph drawing, pp. 121\u2013171. Springer, London (2001)"},{"key":"22_CR9","unstructured":"Frishman, Y., Tal, A.: Online dynamic graph drawing. In: Eurographics\/IEEE-VGTC Symp. on Visualization. Eurographics Association (2007)"},{"key":"22_CR10","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)"},{"key":"22_CR11","unstructured":"Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. In: SODA 2001: Proc. of the 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 246\u2013255. Society for Industrial and Applied Mathematics (2001)"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1009771921595","volume":"3","author":"W. He","year":"1998","unstructured":"He, W., Marriott, K.: Constrained graph layout. Constraints\u00a03, 289\u2013314 (1998)","journal-title":"Constraints"},{"key":"22_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, 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"issue":"2","key":"22_CR14","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. Journal of Visual Languages and Computing\u00a06(2), 183\u2013210 (1995)","journal-title":"Journal of Visual Languages and Computing"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-45848-4_19","volume-title":"Graph Drawing","author":"S.C. North","year":"2002","unstructured":"North, S.C., Woodhull, G.: Online hierarchical graph drawing. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 232\u2013246. Springer, Heidelberg (2002)"},{"key":"22_CR16","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)"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:06:43Z","timestamp":1558109203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}