{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:13Z","timestamp":1725643573779},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_19","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"191-202","source":"Crossref","is-referenced-by-count":0,"title":["How to Visualize the K-Root Name Server (Demo)"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Claudio","family":"Squarcella","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Nagele","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00170-010-2960-4","volume":"54","author":"M. Akbari Jokar","year":"2011","unstructured":"Akbari Jokar, M., Shoja Sangchooli, A.: Constructing a block layout by face area. The International Journal of Advanced Manufacturing Technology\u00a054, 801\u2013809 (2011)","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-22300-6_9","volume-title":"Algorithms and Data Structures","author":"T. Biedl","year":"2011","unstructured":"Biedl, T., Ruiz Vel\u00e1zquez, L.: Orthogonal Cartograms with Few Corners Perface. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 98\u2013109. Springer, Heidelberg (2011)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Biedl, T., Vel\u00e1zquez, L.E.R.: Drawing planar 3-trees with given face-areas (2010)","DOI":"10.1007\/978-3-642-11805-0_30"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM\u00a016, 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"11","key":"19_CR5","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","volume":"10","author":"M.-J. Carpano","year":"1980","unstructured":"Carpano, M.-J.: Automatic display of hierarchized graphs for computer-aided decision analysis. IEEE Transactions on Systems, Man and Cybernetics\u00a010(11), 705\u2013715 (1980)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998. ACM (1998)","DOI":"10.1145\/276698.276865"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-005-1184-8","volume":"45","author":"Z.-Z. Chen","year":"2006","unstructured":"Chen, Z.-Z., Grigni, M., Papadimitriou, C.H.: Recognizing hole-free 4-map graphs in cubic time. Algorithmica\u00a045(2), 227\u2013262 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"19_CR8","first-page":"117","volume":"9","author":"L. Colitti","year":"2005","unstructured":"Colitti, L., Di Battista, G., Mariani, F., Patrignani, M., Pizzonia, M.: Visualizing interdomain routing with BGPlay. Journal of Graph Algorithms and Applications, Special Issue on the 2003 Symposium on Graph Drawing, GD 2003 \u00a09(1), 117\u2013148 (2005)","journal-title":"Journal of Graph Algorithms and Applications, Special Issue on the 2003 Symposium on Graph Drawing, GD 2003"},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/TVCG.2006.185","volume":"12","author":"P.F. Cortese","year":"2006","unstructured":"Cortese, P.F., Di Battista, G., Moneta, A., Patrignani, M., Pizzonia, M.: Topographic visualization of prefix propagation in the internet. IEEE Transactions on Visualization and Computer Graphics\u00a012(5), 725\u2013732 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1183471.1183476","volume-title":"Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems, GIS 2006","author":"M. Berg de","year":"2006","unstructured":"de Berg, M., Mumford, E., Speckmann, B.: Optimal BSPs and rectilinear cartograms. In: Proceedings of the 14th Annual ACM International Symposium on Advances in Geographic Information Systems, GIS 2006, pp. 19\u201326. ACM, New York (2006)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-18469-7_15","volume-title":"Graph Drawing","author":"W. Didimo","year":"2011","unstructured":"Didimo, W., Liotta, G., Romeo, S.A.: Topology-Driven Force-Directed Algorithms. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 165\u2013176. Springer, Heidelberg (2011)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-24595-7_9","volume-title":"Graph Drawing","author":"C. Erten","year":"2004","unstructured":"Erten, C., Harding, P., Kobourov, S., Wampler, K., Yee, G.: GraphAEL: Graph Animations with Evolving Layouts. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 98\u2013110. Springer, Heidelberg (2004)"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Fabrikant, S.I., Skupin, A.: Cognitively plausible information visualization. Exploring Geovisualization, 667\u2013690 (November 2005)","DOI":"10.1016\/B978-008044531-1\/50453-X"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-12200-2_37","volume-title":"LATIN 2010: Theoretical Informatics","author":"E. Gansner","year":"2010","unstructured":"Gansner, E., Hu, Y., Kaufmann, M., Kobourov, S.: Optimal Polygonal Representation of Planar Graphs. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 417\u2013432. Springer, Heidelberg (2010)"},{"issue":"20","key":"19_CR15","doi-asserted-by":"publisher","first-page":"7499","DOI":"10.1073\/pnas.0400280101","volume":"101","author":"M.T. Gastner","year":"2004","unstructured":"Gastner, M.T., Newman, M.E.J.: Diffusion-based method for producing density-equalizing maps. Proceedings of the National Academy of Sciences of the United States of America\u00a0101(20), 7499\u20137504 (2004)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"19_CR16","unstructured":"Huffaker, B., Fomenkov, M. Claffy, K.: Influence maps - a novel 2-d visualization of massive geographically distributed data sets. Internet Protocol Forum (October 2008)"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1559\/152304006777681698","volume":"33","author":"R. Inoue","year":"2006","unstructured":"Inoue, R., Shimizu, E.: A new algorithm for continuous area cartogram construction with triangulation of regions and restriction on bearing changes of edges. Cartography and Geographic Information Science\u00a033(2), 115\u2013125 (2006)","journal-title":"Cartography and Geographic Information Science"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/978-3-540-72504-6_53","volume-title":"Theory and Applications of Models of Computation","author":"A. Kawaguchi","year":"2007","unstructured":"Kawaguchi, A., Nagamochi, H.: Orthogonal Drawings for Plane Graphs with Specified Face Areas. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 584\u2013594. Springer, Heidelberg (2007)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Mashima, D., Kobourov, S., Hu, Y.: Visualizing Dynamic Data with Maps. In: Proc. 4th IEEE Pacific Visualization Symposium (March 2011)","DOI":"10.1109\/PACIFICVIS.2011.5742385"},{"key":"19_CR20","series-title":"Probability and Statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470317013","volume-title":"Spatial tessellations: Concepts and applications of Voronoi diagrams","author":"A. Okabe","year":"2000","unstructured":"Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial tessellations: Concepts and applications of Voronoi diagrams, 2nd edn. Probability and Statistics. Wiley, NYC (2000)","edition":"2"},{"key":"19_CR21","first-page":"231","volume-title":"Proceedings of the 2000 International Symposium on Database Engineering & Applications, IDEAS 2000","author":"M. Ouyang","year":"2000","unstructured":"Ouyang, M., Revesz, P.Z.: Algorithms for cartogram animation. In: Proceedings of the 2000 International Symposium on Database Engineering & Applications, IDEAS 2000, pp. 231\u2013235. IEEE Computer Society, Washington, DC, USA (2000)"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.comgeo.2008.09.002","volume":"42","author":"M.. S. Rahman","year":"2009","unstructured":"Rahman, M. S., Miura, K., Nishizeki, T.: Octagonal drawings of plane graphs with prescribed face areas. Comput. Geom. Theory Appl.\u00a042, 214\u2013230 (2009)","journal-title":"Comput. Geom. Theory Appl."},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1057\/palgrave.ivs.9500152","volume":"6","author":"R. Reitsma","year":"2007","unstructured":"Reitsma, R., Trubin, S.: Information space partitioning using adaptive voronoi diagrams. Information Visualization\u00a06, 123\u2013138 (2007)","journal-title":"Information Visualization"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TVCG.2008.125","volume":"14","author":"G. Robertson","year":"2008","unstructured":"Robertson, G., Fernandez, R., Fisher, D., Lee, B., Stasko, J.: Effectiveness of animation in trend visualization. IEEE Transactions on Visualization and Computer Graphics\u00a014, 1325\u20131332 (2008)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Map graphs in polynomial time. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS 1998 (1998)","DOI":"10.1109\/SFCS.1998.743490"},{"key":"19_CR26","unstructured":"Tollis, I.G., Di Battista, G., Eades, P., Tamassia, R.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall (1998)"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.comgeo.2006.06.002","volume":"37","author":"M. Kreveld van","year":"2007","unstructured":"van Kreveld, M., Speckmann, B.: On rectangular cartograms. Comput. Geom. Theory Appl.\u00a037, 175\u2013187 (2007)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,20]],"date-time":"2021-12-20T11:56:26Z","timestamp":1640001386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}