{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:06:23Z","timestamp":1748577983879,"version":"3.41.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213828"},{"type":"electronic","value":"9783319213835"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21383-5_107","type":"book-chapter","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T02:42:15Z","timestamp":1437360135000},"page":"643-647","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["User Exploration of Search Space Using Tradeoffs"],"prefix":"10.1007","author":[{"given":"Zachi","family":"Baharav","sequence":"first","affiliation":[]},{"given":"David S.","family":"Gladstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"issue":"1","key":"107_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"key":"107_CR2","unstructured":"Page, L., Brin, S., Rajeev, M., Terry, W.: The PageRank Citation Ranking: Bringing Order to the Web. Stanford University, Technical report (1998)"},{"key":"107_CR3","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":"ER Gansner","year":"2005","unstructured":"Gansner, E.R., Koren, Y., North, S.C.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"issue":"5","key":"107_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 Trans. Vis. Comput. Graph. 12(5), 821\u2013828 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"107_CR5","doi-asserted-by":"crossref","unstructured":"Hearst, M.A.: Search User Interfaces. Cambridge University Press, (2009). Also available on the web http:\/\/searchuserinterfaces.com\/book\/","DOI":"10.1017\/CBO9781139644082"},{"issue":"5","key":"107_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.14778\/1952376.1952377","volume":"4","author":"A Parameswaran","year":"2011","unstructured":"Parameswaran, A., et al.: Human-assisted graph search: it\u2019s okay to ask questions. Proc. VLDB Endowment 4(5), 267\u2013278 (2011)","journal-title":"Proc. VLDB Endowment"},{"issue":"12","key":"107_CR7","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 Trans. Vis. Comput. Graph. 18(12), 2477\u20132485 (2012)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"107_CR8","doi-asserted-by":"crossref","unstructured":"Stolper, C.D., Kahng, M., Lin, Z., Foerster, F., Goel, A., Horng, D.: GLOs: Graph-level operations for exploratory network visualization. In: CHI 2014 Extended Abstracts on Human Factors in Computing Systems, pp. 1375\u20131380. ACM (2014)","DOI":"10.1145\/2559206.2581239"},{"key":"107_CR9","doi-asserted-by":"crossref","unstructured":"Dwyer, T., Mears, C., Morgan, K., Niven, T., Marriott, K., Wallace, M.: Improved optimal and approximate power graph compression for clearer visualization of dense graphs. In: Pacific Visualization Symposium (PacificVis), pp. 105\u2013112. IEEE (2014)","DOI":"10.1109\/PacificVis.2014.46"}],"container-title":["Communications in Computer and Information Science","HCI International 2015 - Posters\u2019 Extended Abstracts"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21383-5_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T12:14:58Z","timestamp":1748520898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21383-5_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213828","9783319213835"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21383-5_107","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"21 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}