{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:33:40Z","timestamp":1725561220879},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208310"},{"type":"electronic","value":"9783540245957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_41","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:46:01Z","timestamp":1280378761000},"page":"437-449","source":"Crossref","is-referenced-by-count":18,"title":["Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes"],"prefix":"10.1007","author":[{"given":"Cesim","family":"Erten","sequence":"first","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Vu","family":"Le","sequence":"additional","affiliation":[]},{"given":"Armand","family":"Navabi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Brandes, U., Corman, S.R.: Visual unrolling of network evolution and the analysis of dynamic discourse. In: IEEE Symposium on Information Visualization (INFOVIS 2002), pp. 145\u2013151 (2002)","key":"41_CR1","DOI":"10.1109\/INFVIS.2002.1173160"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-63938-1_66","volume-title":"Graph Drawing","author":"U. Brandes","year":"1998","unstructured":"Brandes, U., Wagner, D.: A bayesian paradigm for dynamic graph layout. In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 236\u2013247. Springer, Heidelberg (1998)"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/3-540-44969-8_9","volume-title":"Drawing Graphs","author":"J. Branke","year":"2001","unstructured":"Branke, J.: Dynamic graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, pp. 228\u2013246. Springer, Heidelberg (2001)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-540-45078-8_22","volume-title":"Algorithms and Data Structures","author":"P. Brass","year":"2003","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous graph embedding. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 243\u2013255. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Collberg, C., Kobourov, S.G., Nagra, J., Pitts, J., Wampler, K.: A system for graph-based visualization of the evolution of software. In: ACM Symposium on Software Visualization, pp. 77\u201386 (2003)","key":"41_CR5","DOI":"10.1145\/774833.774844"},{"key":"41_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36151-0_3","volume-title":"Graph Drawing","author":"S. Diehl","year":"2002","unstructured":"Diehl, S., G\u00f6rg, C.: Graphs, they are changing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 23\u201330. Springer, Heidelberg (2002)"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/BFb0021804","volume-title":"Graph Drawing","author":"P. Eades","year":"1996","unstructured":"Eades, P., Neto, C.F.X.M.: Vertex splitting and tension-free layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 202\u2013211. Springer, Heidelberg (1996)"},{"key":"41_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/3-540-36136-7_50","volume-title":"Algorithms and Computation","author":"C. Erten","year":"2002","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of a planar graph and its dual on the grid. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 575\u2013587. Springer, Heidelberg (2002)"},{"issue":"11","key":"41_CR9","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"Fruchterman, T., Reingold, E.: Graph drawing by force-directed placement. Softw. \u2013 Pract. Exp.\u00a021(11), 1129\u20131164 (1991)","journal-title":"Softw. \u2013 Pract. Exp."},{"key":"41_CR10","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.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 211\u2013221. Springer, Heidelberg (2001)"},{"issue":"3","key":"41_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.7155\/jgaa.00052","volume":"6","author":"P. Gajer","year":"2002","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with Intelligent Placement. Journal of Graph Algorithms and Applications\u00a06(3), 203\u2013224 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"doi-asserted-by":"crossref","unstructured":"Harel, D., Koren, Y.: Drawing graphs with non-uniform vertices. In: Proceedings of Working Conference on Advanced Visual Interfaces (AVI 2002), pp. 157\u2013166 (2002)","key":"41_CR12","DOI":"10.1145\/1556262.1556288"},{"issue":"1","key":"41_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/2945.841119","volume":"6","author":"Herman","year":"2000","unstructured":"Herman, Melan\u00e7on, G., Marshall, M.S.: Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics\u00a06(1), 24\u201343 (2000)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"41_CR14","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1006\/jvlc.1998.0094","volume":"9","author":"M.L. Huang","year":"1998","unstructured":"Huang, M.L., Eades, P., Wang, J.: On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing\u00a09, 623\u2013645 (1998)","journal-title":"Journal of Visual Languages and Computing"},{"unstructured":"Kamada, T., Kawai, S.: Automatic display of network structures for human understanding. Technical Report 88-007, Dept. of Inf. Science, University of Tokyo (1988)","key":"41_CR15"},{"doi-asserted-by":"crossref","unstructured":"North, S.C.: Incremental layout in DynaDAG. In: Proceedings of the 4th Symposium on Graph Drawing (GD), pp. 409\u2013418 (1996)","key":"41_CR16","DOI":"10.1007\/BFb0021824"},{"unstructured":"Yee, K.-P., Fisher, D., Dhamija, R., Hearst, M.: Animated exploration of dynamic graphs with radial layout. In: IEEE Symposium on Information Visualization (INFOVIS 2001), pp. 43\u201350 (2001)","key":"41_CR17"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24595-7_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:54:50Z","timestamp":1552823690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}