{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:40:02Z","timestamp":1745962802633,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_5","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T03:17:33Z","timestamp":1360811853000},"page":"43-54","source":"Crossref","is-referenced-by-count":4,"title":["Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Ohrimenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. Symp. on Principles of Database Systems, pp. 1\u201316 (2002)","DOI":"10.1145\/543613.543615"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-63938-1_78","volume-title":"Graph Drawing","author":"N. Barghouti","year":"1997","unstructured":"Barghouti, N., Mocenigo, J., Lee, W.: Grappa: A GRAPh PAckage in Java. In: Di Battista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 336\u2013343. Springer, Heidelberg (1997)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: How to draw a series-parallel digraph. Internat. J. Comput. Geom. Appl.\u00a04, 385\u2013402 (1994)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-11805-0_28","volume-title":"Graph Drawing","author":"C. Binucci","year":"2010","unstructured":"Binucci, C., Brandes, U., Di Battista, G., Didimo, W., Gaertler, M., Palladino, P., Patrignani, M., Symvonis, A., Zweig, K.: Drawing Trees in a Streaming Model. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 292\u2013303. Springer, Heidelberg (2010)"},{"issue":"4-5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1142\/S021819599900025X","volume":"9","author":"S. Bridgeman","year":"1999","unstructured":"Bridgeman, S., Garg, A., Tamassia, R.: A graph drawing and translation service on the World Wide Web. Int. J. Comp. Geom. Appl.\u00a09(4-5), 419\u2013446 (1999)","journal-title":"Int. J. Comp. Geom. Appl."},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"R.F. Cohen","year":"1995","unstructured":"Cohen, R.F., Di Battista, G., Tamassia, R., Tollis, I.G.: Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput.\u00a024(5), 970\u20131001 (1995)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom.\u00a07(4), 381\u2013401 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"5_CR9","unstructured":"Eppstein, D., Goodrich, M.T., Tamassia, R.: Privacy-preserving data-oblivious geometric algorithms for geographic data. In: 18th ACM Adv. in Geographic Information Systems, ACM GIS, pp. 13\u201322 (2010), http:\/\/doi.acm.org\/10.1145\/1869790.1869796"},{"issue":"4","key":"5_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1824777.1824786","volume":"6","author":"J. Feldman","year":"2010","unstructured":"Feldman, J., Muthukrishnan, S., Sidiropoulos, A., Stein, C., Svitkina, Z.: On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4), 66:1\u201366:19 (2010), http:\/\/doi.acm.org\/10.1145\/1824777.1824786","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a0II. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Randomized Shellsort: A simple oblivious sorting algorithm. In: Symposium on Discrete Algorithms, SODA, pp. 1\u201316 (2010)","DOI":"10.1137\/1.9781611973075.101"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-642-22012-8_46","volume-title":"Automata, Languages and Programming","author":"M.T. Goodrich","year":"2011","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 576\u2013587. Springer, Heidelberg (2011)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Oblivious RAM simulation with efficient worst-case access overhead. In: Proc. ACM Workshop on Cloud Computing Security, CCSW, pp. 95\u2013100 (2011)","DOI":"10.1145\/2046660.2046680"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Practical oblivious storage. In: Proc. ACM Conference on Data and Application Security and Privacy, CODASPY (2012)","DOI":"10.1145\/2133601.2133604"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Mitzenmacher, M., Ohrimenko, O., Tamassia, R.: Privacy-preserving group data access via stateless oblivious RAM simulation. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA (2012)","DOI":"10.1137\/1.9781611973099.14"},{"key":"5_CR18","unstructured":"Goodrich, M.T., Ohrimenko, O., Tamassia, R.: Data-oblivious graph drawing model and algorithms. CoRR abs\/1209.0756 (2012)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External Memory Algorithms. Discrete Mathematics and Theoretical Computer Science, vol.\u00a050, pp. 107\u2013118. AMS (1999)","DOI":"10.1090\/dimacs\/050\/05"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, B., Shneiderman, B.: Tree-maps: A space-filling approach to the visualization of hierarchical information structures. In: IEEE Visualization, pp. 284\u2013291 (1991)","DOI":"10.1109\/VISUAL.1991.175815"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data Streams: Algorithms and Applications. In: Foundations and Trends in Theoretical Computer Science, vol.\u00a01. Now Publishers (2005)","DOI":"10.1561\/0400000002"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences\u00a026(3), 362\u2013381 (1983)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"5_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete Comput. Geom.\u00a01(4), 321\u2013341 (1986)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T21:16:15Z","timestamp":1745961375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}