{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:27Z","timestamp":1725487287316},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_14","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"150-163","source":"Crossref","is-referenced-by-count":3,"title":["Visualization of the Autonomous Systems Interconnections with Hermes"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Carmignani","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Matera","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"T. Bates, E. Gerich, L. Joncheray, J. M. Jouanigot, D. Karrenberg, M. Terpstra, and J. Yu. Representation of ip routing policies in a routing registry. On line, 1994. ripe-181, http:\/\/www.ripe.net , rfc 1786.","DOI":"10.17487\/rfc1786"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum numbr of bends. IEEE Transactions on Computers, 49(8), 2000.","DOI":"10.1109\/12.868028"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"T. C. Biedl and M. Kaufmann. Area-efficient static and incremental graph darwings. In R. Burkard and G. Woeginger, editors, Algorithms (Proc. ESA\u2019 97), volume 1284 of Lecture Notes Comput. Sci., pages 37\u201352. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63397-9_4"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. Dynamic grid embedding with few bends and changes. In K.-Y. Chwa and O. H. Ibarra, editors, ISAAC\u201998, volume 1533 of Lecture Notes Comput. Sci., pages 89\u201398. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-49381-6_11"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In S. H. Withesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 57\u201371. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_5"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactive-Giotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 303\u2013308. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-63938-1_73"},{"key":"14_CR7","unstructured":"M. Bukowy and J. Snabb. RIPE NCC database documentation update to support RIPE DB ver. 2.2.1. On line, 1999. ripe-189, http:\/\/www.ripe.net ."},{"key":"14_CR8","unstructured":"CAIDA. Otter: Tool for topology display. On line. http:\/\/www.caida.org ."},{"key":"14_CR9","unstructured":"CAIDA. Plankton: Visualizing nlanr\u2019s web cache hierarchy. On line. http:\/\/www.caida.org ."},{"issue":"5","key":"14_CR10","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"R. F. Cohen","year":"1995","unstructured":"R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. Dynamic graph drawings: Trees, series-parallel digraphs, and planar ST-digraphs. SIAM J. Comput., 24(5):970\u20131001, 1995.","journal-title":"SIAM J. Comput."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of prescribed sizes. In J. Kratochvil, editor, Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes Comput. Sci., pages 297\u2013310. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46648-7_31"},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999."},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 7:303\u2013325, 1997.","journal-title":"Comput. Geom. Theory Appl."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"G. Di Battista, R. Lillo, and F. Vernacotola. Ptolomaeus: The web cartographer. In S. H. Withesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes Comput. Sci., pages 444\u2013445. Springer-Verlag, 1998.","DOI":"10.1007\/3-540-37623-2_38"},{"key":"14_CR15","unstructured":"M. Dodge. An atlas of cyberspaces. On line. http:\/\/www.cybergeography.com\/atlas\/atlas.html ."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"P. Eades, R. F. Cohen, and M. L. Huang. Online animated graph drawing for web navigation. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes Comput. Sci., pages 330\u2013335. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63938-1_77"},{"key":"14_CR17","unstructured":"P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24\u201333, 1991."},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 254\u2013266. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021809"},{"key":"14_CR19","unstructured":"B. Huffaker. Tools to visualize the internet multicast backbone. On line. http:\/\/www.caida.org ."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"K. Miriyala, S. W. Hornick, and R. Tamassia. An incremental approach to aesthetic graph layout. In Proc. Internat. Workshop on Computer-Aided Software Engineering, 1993.","DOI":"10.1109\/CASE.1993.634832"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. J. Visual Lang. Comput., 6(2):183\u2013210, 1995.","journal-title":"J. Visual Lang. Comput."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"S. North. Incremental layout in DynaDAG. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes Comput. Sci., pages 409\u2013418. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021824"},{"issue":"11","key":"14_CR23","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/12.736444","volume":"47","author":"A. Papakostas","year":"1998","unstructured":"A. Papakostas and I. G. Tollis. Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11):1297\u20131309, 1998.","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR24","unstructured":"C. Rachit. Octopus: Backbone topology discovery. On line. http:\/\/www.cs.cornell.edu\/cnrg\/topology aware\/topology\/Default.html ."},{"key":"14_CR25","unstructured":"Y. Rekhter. A border gateway protocol 4 (bgp-4). IETF, rfc 1771."},{"issue":"3","key":"14_CR26","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. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:19:42Z","timestamp":1556680782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}