{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:04:56Z","timestamp":1781798696607,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001584","type":"print"},{"value":"9783540361510","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_3","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:14:14Z","timestamp":1195233254000},"page":"23-31","source":"Crossref","is-referenced-by-count":82,"title":["Graphs, They Are Changing"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Diehl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carsten","family":"G\u00f6rg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. A Bayesian paradigm for dynamic graph layout. In Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Computer Science. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_66"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ulrik Brandes. Drawing on physical analogies. In Drawing Graphs [11]. 2001.","DOI":"10.1007\/3-540-44969-8_4"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Branke. Dynamic graph drawing. In Drawing Graphs [11]. 2001.","DOI":"10.1007\/3-540-44969-8_9"},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Difference metrics for interactive orthogonal graph drawing algorithms","author":"S. Bridgeman","year":"1998","unstructured":"S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In Proceedings of 6th International Symposium on Graph Drawing GD\u201998. Springer LNCS 1457, 1998."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and st-digraphs. SIAM Journal on Computing, 24(5), 1995.","DOI":"10.1137\/S0097539792235724"},{"key":"3_CR6","unstructured":"S. Diehl, C. G\u00f6rg, and A. Kerren. Foresighted Graphlayout. Technical Report A\/02\/2000, FR 6.2-Informatik, University of Saarland, December 2000. \n                    http:\/\/www.cs.uni-sb.de\/tr\/FB14\n                    \n                  ."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Stephan Diehl, Carsten G\u00f6rg, and Andreas Kerren. Preserving the Mental Map using Foresighted Layout. In Proceedings of Joint Eurographics-IEEE TCVG Symposium on Visualization VisSym\u201901. Springer Verlag, 2001.","DOI":"10.1007\/978-3-7091-6215-6_19"},{"key":"3_CR8","unstructured":"P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42, 1984."},{"key":"3_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45848-4_18","volume-title":"Graph Drawing in Motion II","author":"C. Friedrich","year":"2002","unstructured":"C. Friedrich and M. E. Houle. Graph Drawing in Motion II. In Proceedings of Graph Drawing 2001. Springer LNCS (to appear), 2001."},{"key":"3_CR10","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman and Company, 1979."},{"key":"3_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Drawing Graphs \u2014 Methods and Models","year":"2001","unstructured":"M. Kaufmann and D. Wagner, editors. Drawing Graphs \u2014 Methods and Models, volume 2025 of Lecture Notes in Computer Science. Springer-Verlag, 2001."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"K.A. Lyons, H. Meijer, and D. Rappaport. Cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications, 2(1), 1998.","DOI":"10.7155\/jgaa.00004"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout Adjustment and the Mental Map. Journal of Visual Languages and Computing, 6(2):183\u2013210, 1995.","journal-title":"Journal of Visual Languages and Computing"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"A. Papakostas and I.G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11), 1998.","DOI":"10.1109\/12.736444"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"H.C. Purchase, R.F. Cohen, and M. James. Validating graph drawing aesthetics. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Computer Science. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021827"},{"key":"3_CR16","unstructured":"G. Sander. Visualization Techniques for Compiler Construction. Dissertation (in german), University of Saarland, Saarbr\u00fccken (Germany), 1996."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T17:12:05Z","timestamp":1551114725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}