{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:23Z","timestamp":1725487283884},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_3","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:01:32Z","timestamp":1184587292000},"page":"19-30","source":"Crossref","is-referenced-by-count":5,"title":["A User Study in Similarity Measures for Graph Drawing"],"prefix":"10.1007","author":[{"given":"Stina","family":"Bridgeman","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-37623-2_26","volume-title":"GD\u2019 98","author":"T. Biedl","year":"1998","unstructured":"T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. In GD\u2019 98, volume 1547 of LNCS, pages 347\u2013355. Springer-Verlag, 1998."},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"ESA\u2019 97","author":"T. C. Biedl","year":"1997","unstructured":"T. C. Biedl and M. Kaufmann. Area-efficient static and incremental graph darwings. In ESA\u2019 97, volume 1284 of LNCS, pages 37\u201352. Springer-Verlag, 1997."},{"key":"3_CR3","unstructured":"S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal drawing. J. Graph Alg. Appl. to appear."},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-63938-1_73","volume-title":"GD\u2019 97","author":"S. S. Bridgeman","year":"1997","unstructured":"S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In GD\u2019 97, volume 1353 of LNCS, pages 303\u2013308. Springer-Verlag, 1997."},{"key":"3_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-37623-2_37","volume-title":"GD\u2019 98","author":"E. Dengler","year":"1998","unstructured":"E. Dengler and W. Cowan. Human perception of laid-out graphs. In GD\u2019 98, volume 1547 of LNCS, pages 441\u2013443. Springer-Verlag, 1998."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"E. Dengler, M. Friedell, and J. Marks. Constraint-driven diagram layout. In Proc. IEEE Sympos. on Visual Languages, pages 330\u2013335, 1993.","DOI":"10.1109\/VL.1993.269619"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7: 303\u2013325, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"3_CR8","series-title":"Lect Notes Comput Sci","first-page":"111","volume-title":"GD\u2019 97","author":"U. F\u00f6\u00dfmeier","year":"1998","unstructured":"U. F\u00f6\u00dfmeier. Interactive orthogonal graph drawing: Algorithms and bounds. In GD\u2019 97, volume 1353 of LNCS, pages 111\u2013123. Springer-Verlag, 1998."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/0212032","volume":"12","author":"J. E. Goodman","year":"1983","unstructured":"J. E. Goodman and R. Pollack. Multidimensional sorting. SIAM J. Comput., 12(3):484\u2013507, Aug. 1983.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00004","volume":"2","author":"K. A. Lyons","year":"1998","unstructured":"K. A. Lyons, H. Meijer, and D. Rappaport. Algorithms for cluster busting in anchored graph drawing. J. Graph Algorithms Appl., 2(1):1\u201324, 1998.","journal-title":"J. Graph Algorithms Appl."},{"issue":"9","key":"3_CR11","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/34.232078","volume":"15","author":"A. Marzal","year":"1993","unstructured":"A. Marzal and E. Vidal. Computation of normalized edit distance and applications. IEEE Trans. on Pattern Analysis and Machine Intelligence, 15(9):926\u2013932, Sept. 1993.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"3_CR12","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. J. Visual Lang. Comput., 6(2):183\u2013210, 1995.","journal-title":"J. Visual Lang. Comput."},{"key":"3_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BFb0021824","volume-title":"GD\u2019 95","author":"S. North","year":"1996","unstructured":"S. North. Incremental layout in DynaDAG. In GD\u2019 95, volume 1027 of LNCS, pages 409\u2013418. Springer-Verlag, 1996."},{"key":"3_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/3-540-62495-3_61","volume-title":"GD\u2019 96","author":"A. Papakostas","year":"1997","unstructured":"A. Papakostas, J. M. Six, and I. G. Tollis. Experimental and theoretical results in interactive graph drawing. In GD\u2019 96, volume 1190 of LNCS, pages 371\u2013386. Springer-Verlag, 1997."},{"issue":"11","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/12.736444","volume":"C-47","author":"A. Papakostas","year":"1998","unstructured":"A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. IEEE Trans. Comput., C-47(11):1297\u20131309, 1998.","journal-title":"IEEE Trans. Comput."},{"key":"3_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-62495-3_62","volume-title":"GD\u2019 96","author":"K. Ryall","year":"1997","unstructured":"K. Ryall, J. Marks, and S. Shieber. An interactive system for drawing graphs. In GD\u2019 96, volume 1190 of LNCS, pages 387\u2013393. Springer-Verlag, 1997."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"3_CR18","unstructured":"W. A. Wickelgren. Cognitive Psychology. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1979."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T19:58:27Z","timestamp":1550433507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}