{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:39:12Z","timestamp":1773081552762,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540667315","type":"print"},{"value":"9783540467847","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_26","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"262-277","source":"Crossref","is-referenced-by-count":12,"title":["A Multi-Scale Algorithm for Drawing Graphs Nicely"],"prefix":"10.1007","author":[{"given":"Ronny","family":"Hadany","sequence":"first","affiliation":[]},{"given":"David","family":"Harel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0010-4655(91)90151-A","volume":"65","author":"A. \u201c. Brandt","year":"1991","unstructured":"Brandt, A., \u201cMultilevel computations of integral transforms and particle interactions with oscillatory kernels\u201d, Computer Physics Communications\n                        65 (1991), 24\u201338. 263","journal-title":"Computer Physics Communications"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0920-5632(92)90234-J","volume":"26","author":"A. \u201c. Brandt","year":"1992","unstructured":"Brandt, A., \u201cMultigrid Methods in Lattice Field Computations\u201d, Nuclear Physics B (Proc. Suppl.)\n                        26 (1992), 137\u2013180. 263","journal-title":"Nuclear Physics B (Proc. Suppl.)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., and D. Harel, \u201cDrawing Graphs Nicely Using Simulated Annealing\u201d, ACM Transactions on Graphics\n                        15 (1996), 301\u2013331. (Preliminary version: Technical Report, The Weizmann Institute of Science, 1989.) 262, 262, 262, 264, 269, 276","journal-title":"ACM Transactions on Graphics"},{"key":"26_CR4","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., P. Eades, R. Tamassia and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, NJ, 1999. 262"},{"key":"26_CR5","first-page":"149","volume":"42","author":"P. \u201c. Eades","year":"1984","unstructured":"Eades, P., \u201cA Heuristic for Graph Drawing\u201d,Cong. Numer.\n                        42 (1984), 149\u2013160. 262, 262, 276","journal-title":"Cong. Numer."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.G. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.G., and E. Reingold, \u201cGraph Drawing by Force-Directed Placement\u201d, Software-Practice & Experience\n                        21 (1991), 1129\u20131164. 262, 276","journal-title":"Software-Practice & Experience"},{"key":"26_CR7","unstructured":"Hadany, R., Harel, D. and Y. Koren, in preparation. 263, 269, 277"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1006\/jvlc.1995.1014","volume":"6","author":"D. Harel","year":"1995","unstructured":"Harel, D., and M. Sardas, \u201cRandomized Graph Drawing with Heavy-Duty Preprocessing\u201d, J. Visual Lang. and Comput.\n                        6 (1995), 233\u2013253. 262, 262, 263, 277","journal-title":"J. Visual Lang. and Comput."},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"K. T","year":"1989","unstructured":"Kamada, T., and S. Kawai, \u201cAn Algorithm for Drawing General Undirected Graphs\u201d, Inf. Proc. Lett.\n                        31 (1989), 7\u201315. 262, 276","journal-title":"Inf. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:26:45Z","timestamp":1550302005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}