{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:29:18Z","timestamp":1765355358454},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_2","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"5-18","source":"Crossref","is-referenced-by-count":25,"title":["User Preference of Graph Layout Aesthetics: A UML Study"],"prefix":"10.1007","author":[{"given":"Helen C.","family":"Purchase","sequence":"first","affiliation":[]},{"given":"Jo-Anne","family":"Allder","sequence":"additional","affiliation":[]},{"given":"David","family":"Carrington","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"2_CR1","unstructured":"G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 1998."},{"issue":"12","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1415::AID-SPE69>3.0.CO;2-P","volume":"26","author":"M.K. Coleman","year":"1996","unstructured":"M.K. Coleman and D. Stott Parker. Aesthetics-based graph layout for human consumption. Software-Practice and Experience, 26(12):1415\u20131438, 1996.","journal-title":"Software-Practice and Experience"},{"issue":"4","key":"2_CR3","first-page":"424","volume":"13","author":"P. Eades","year":"1990","unstructured":"P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424\u2013437, 1990.","journal-title":"Journal of Information Processing"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s004539910006","volume":"26","author":"A. Papakostas","year":"2000","unstructured":"A. Papakostas and I.G. Tollis. Efficient orthogonal drawings of high degree graphs. Algorithmica, 26(1):100\u2013125, 2000.","journal-title":"Algorithmica"},{"issue":"6","key":"2_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/203241.203251","volume":"38","author":"M. Petre","year":"1995","unstructured":"M. Petre. Why looking isn\u2019t always seeing: Readership skills and graphical programming. CACM, 38(6):33\u201344, June 1995.","journal-title":"CACM"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Which aesthetic has the greatest e_ect on human understanding?","author":"H. C. Purchase","year":"1997","unstructured":"H. C. Purchase. Which aesthetic has the greatest e_ect on human understanding? In G. Di Battista, editor, Proceedings of Graph Drawing Symposium 1997, pages 248\u2013259. Springer-Verlag, Rome, Italy, 1997. LNCS, 1353."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1006\/jvlc.1998.0093","volume":"9","author":"H. C. Purchase","year":"1998","unstructured":"H. C. Purchase. Performance of layout algorithms: Comprehension, not computation. Journal of Visual Languages and Computing, 9:647\u2013657, 1998.","journal-title":"Journal of Visual Languages and Computing"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. Reingold","year":"1981","unstructured":"E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Transactions on Software Engineering, SE-7(2):223\u2013228, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3): 421\u2013444, 1987.","journal-title":"SIAM J. Computing"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T15:10:56Z","timestamp":1548342656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}