{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:19:59Z","timestamp":1742915999636,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319072326"},{"type":"electronic","value":"9783319072333"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07233-3_59","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:58:45Z","timestamp":1402405125000},"page":"643-651","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Local Layouts through High-Dimensional Layout Stitching"],"prefix":"10.1007","author":[{"given":"Martin","family":"Steiger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"L\u00fccke-Tieke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"May","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjan","family":"Kuijper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"Kohlhammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.3115\/1654758.1654774","volume-title":"Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing, TextGraphs-1","author":"C. Biemann","year":"2006","unstructured":"Biemann, C.: Chinese Whispers: an Efficient Graph Clustering Algorithm and its Application to Natural Language Processing Problems. In: Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing, TextGraphs-1, pp. 73\u201380. Association for Computational Linguistics, Stroudsburg (2006)"},{"key":"59_CR2","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s11263-006-0002-3","volume":"74","author":"M. Brown","year":"2007","unstructured":"Brown, M., Lowe, D.G.: Automatic Panoramic Image Stitching using Invariant Features. International Journal of Computer Vision\u00a074, 59\u201373 (2007)","journal-title":"International Journal of Computer Vision"},{"issue":"9","key":"59_CR3","first-page":"24","volume":"91","author":"P. Eades","year":"1991","unstructured":"Eades, P., Lai, W., Misue, K., Sugiyama, K.: Preserving the mental map of a diagram. Proceedings of Compugraphics\u00a091(9), 24\u201333 (1991)","journal-title":"Proceedings of Compugraphics"},{"key":"59_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0021808","volume-title":"Graph Drawing","author":"A. Formella","year":"1996","unstructured":"Formella, A., Keller, J.: Generalized fisheye views of graphs. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 242\u2013253. Springer, Heidelberg (1996)"},{"issue":"4","key":"59_CR5","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1109\/TVCG.2008.11","volume":"14","author":"Y. Frishman","year":"2008","unstructured":"Frishman, Y., Tal, A.: Online Dynamic Graph Drawing. IEEE Transactions on Visualization and Computer Graphics\u00a014(4), 727\u2013740 (2008)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"59_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44541-2_20","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","unstructured":"Gajer, P., Goodrich, M., Kobourov, S.: A multi-dimensional approach to force-directed layouts of large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 211\u2013221. Springer, Heidelberg (2001)"},{"key":"59_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-44541-2_18","volume-title":"Graph Drawing","author":"D. Harel","year":"2001","unstructured":"Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 183\u2013196. Springer, Heidelberg (2001)"},{"key":"59_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-37623-2_29","volume-title":"Graph Drawing","author":"M.L. Huang","year":"1999","unstructured":"Huang, M.L., Eades, P.: A Fully Animated Interactive System for Clustering and Navigating Huge Graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 374\u2013383. Springer, Heidelberg (1999)"},{"issue":"12","key":"59_CR9","doi-asserted-by":"publisher","first-page":"2563","DOI":"10.1109\/TVCG.2011.220","volume":"17","author":"P. Joia","year":"2011","unstructured":"Joia, P., Paulovich, F., Coimbra, D., Cuminato, J., Nonato, L.: Local affine multidimensional projection. IEEE Transactions on Visualization and Computer Graphics\u00a017(12), 2563\u20132571 (2011)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"59_CR10","first-page":"1","volume-title":"Proceedings of the 2006 AVI Workshop on Beyond Time and Errors, BELIV 2006","author":"B. Lee","year":"2006","unstructured":"Lee, B., Plaisant, C., Parr, C.S., Fekete, J.D., Henry, N.: Task taxonomy for graph visualization. In: Proceedings of the 2006 AVI Workshop on Beyond Time and Errors, BELIV 2006, pp. 1\u20135. ACM, New York (2006)"},{"issue":"12","key":"59_CR11","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.1109\/TVCG.2012.245","volume":"18","author":"K. Marriott","year":"2012","unstructured":"Marriott, K., Purchase, H., Wybrow, M., Goncu, C.: Memorability of Visual Features in Network Diagrams. IEEE Transactions on Visualization and Computer Graphics\u00a018(12), 2477\u20132485 (2012)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"3 pt. 2","key":"59_CR12","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1111\/j.1467-8659.2012.03091.x","volume":"31","author":"T. May","year":"2012","unstructured":"May, T., Steiger, M., Davey, J., Kohlhammer, J.: Using Signposts for Navigation in Large Graphs. Computer Graphics Forum\u00a031(3 pt. 2), 985\u2013994 (2012)","journal-title":"Computer Graphics Forum"},{"key":"59_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0021824","volume-title":"Graph Drawing","author":"S.C. North","year":"1996","unstructured":"North, S.C.: Incremental layout in dynadag. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 409\u2013418. Springer, Heidelberg (1996)"},{"key":"59_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/11618058_31","volume-title":"Graph Drawing","author":"C. Papadopoulos","year":"2006","unstructured":"Papadopoulos, C., Voglis, C.: Drawing graphs using modular decomposition. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 343\u2013354. Springer, Heidelberg (2006)"},{"key":"59_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-87730-1_9","volume-title":"Diagrammatic Representation and Inference","author":"H.C. Purchase","year":"2008","unstructured":"Purchase, H.C., Samra, A.: Extremes are better: Investigating mental map preservation in dynamic graphs. In: Stapleton, G., Howse, J., Lee, J. (eds.) Diagrams 2008. LNCS (LNAI), vol.\u00a05223, pp. 60\u201373. Springer, Heidelberg (2008)"},{"key":"59_CR16","unstructured":"Steiger, M., L\u00fccke-Tieke, H., May, T., Kuijper, A., Kohlhammer, J.: Using layout stitching to create deterministic local graph layouts. In: WSCG 2013, pp. 1\u20139 (June 2013)"},{"issue":"4","key":"59_CR17","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"W.S. Torgerson","year":"1952","unstructured":"Torgerson, W.S.: Multidimensional scaling: I. Theory and Method. Psychometrika\u00a017(4), 401\u2013419 (1952)","journal-title":"Theory and Method. Psychometrika"},{"issue":"12","key":"59_CR18","doi-asserted-by":"publisher","first-page":"2699","DOI":"10.1109\/TVCG.2012.236","volume":"18","author":"X. Yuan","year":"2012","unstructured":"Yuan, X., Che, L., Hu, Y., Zhang, X.: Intelligent graph layout using many users\u2019 input. IEEE Transactions on Visualization and Computer Graphics\u00a018(12), 2699\u20132708 (2012)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"}],"container-title":["Lecture Notes in Computer Science","Human-Computer Interaction. Theories, Methods, and Tools"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07233-3_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T23:03:14Z","timestamp":1582412594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07233-3_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319072326","9783319072333"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07233-3_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}