{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:25Z","timestamp":1725643585196},"publisher-location":"Berlin, Heidelberg","reference-count":31,"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_18","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"179-190","source":"Crossref","is-referenced-by-count":2,"title":["Generalizing Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Edith","family":"Brunel","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Gemsa","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Krug","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-31843-9_44","volume-title":"Graph Drawing","author":"J. Abello","year":"2005","unstructured":"Abello, J., Kobourov, S.G., Yusufov, R.: Visualizing Large Graphs with Compound-Fisheye Views and Treemaps. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 431\u2013441. Springer, Heidelberg (2005)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Abello, J., Korn, J., Finocchi, I.: Graph sketches. In: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS 2001), p. 67. IEEE Computer Society (2001)","DOI":"10.1109\/INFVIS.2001.963282"},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems I. static-to-dynamic transformation. Journal of Algorithms\u00a01(4), 301\u2013358 (1980)","journal-title":"Journal of Algorithms"},{"key":"18_CR4","unstructured":"Bohn, R.E., Short, J.E.: How much information? 2009 Report on American consumers. Global Information Industry Center, University of California, San Diego (2009)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U. Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00f6rke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowledge and Data Engineering\u00a020, 172\u2013188 (2008)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Brunel, E., Gemsa, A., Krug, M., Rutter, I., Wagner, D.: Generalizing Geometric Graphs. Technical Report\u00a027, Karlsruhe Institute of Technology (2011)","DOI":"10.1007\/978-3-642-25878-7_18"},{"issue":"1-3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0019-9958(86)80030-4","volume":"68","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Cole, R., Preparata, F.P., Yap, C.: New upper bounds for neighbor searching. Information and Control\u00a068(1-3), 105\u2013124 (1986)","journal-title":"Information and Control"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0217026","volume":"17","author":"B. Chazelle","year":"1988","unstructured":"Chazelle, B.: Functional approach to data structures and its use in multidimensional searching. SIAM J. Comput.\u00a017, 427\u2013462 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1-3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics\u00a086(1-3), 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"18_CR10","unstructured":"Davis, T.A.: University of florida sparse matrix collection. NA Digest\u00a092 (1994)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-14031-0_25","volume-title":"Computing and Combinatorics","author":"M. Berg de","year":"2010","unstructured":"de Berg, M., Khosravi, A.: Optimal Binary Space Partitions in the Plane. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 216\u2013225. Springer, Heidelberg (2010)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D. Dobkin","year":"1990","unstructured":"Dobkin, D., Friedman, S., Supowit, K.: Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry\u00a05, 399\u2013407 (1990)","journal-title":"Discrete & Computational Geometry"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-62495-3_41","volume-title":"Graph Drawing","author":"P. Eades","year":"1997","unstructured":"Eades, P., Feng, Q.-W.: Multilevel Visualization of Clustered Graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 101\u2013112. Springer, Heidelberg (1997)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF02187733","volume":"4","author":"H. Edelsbrunner","year":"1989","unstructured":"Edelsbrunner, H., Guibas, L., Sharir, M.: The upper envelope of piecewise linear functions: Algorithms and applications. Discr. & Comp. Geometry\u00a04, 311\u2013336 (1989)","journal-title":"Discr. & Comp. Geometry"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/22339.22342","volume":"17","author":"G.W. Furnas","year":"1986","unstructured":"Furnas, G.W.: Generalized fisheye views. SIGCHI Bull.\u00a017, 16\u201323 (1986)","journal-title":"SIGCHI Bull."},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-31955-9_8","volume-title":"Network Analysis","author":"M. Gaertler","year":"2005","unstructured":"Gaertler, M.: Clustering. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol.\u00a03418, pp. 178\u2013215. Springer, Heidelberg (2005)"},{"key":"18_CR17","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-77537-9_35","volume-title":"Graph Drawing","author":"R. G\u00f6rke","year":"2008","unstructured":"G\u00f6rke, R., Gaertler, M., Wagner, D.: Lunarvis - Analytic Visualizations of Large Graphs. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 352\u2013364. Springer, Heidelberg (2008)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S. Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 285\u2013295. Springer, Heidelberg (2005)"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica\u00a018, 145\u2013163 (1997)","journal-title":"Algorithmica"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36151-0_20","volume-title":"Graph Drawing","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Graph Drawing by High-Dimensional Embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 207\u2013219. Springer, Heidelberg (2002)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. In: Proc. of the 11th Eurographics\/IEEE-VGTC Symp. on Vis, pp. 983\u2013990 (2009)","DOI":"10.1111\/j.1467-8659.2009.01450.x"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1137\/S154034590241370X","volume":"1","author":"Y. Koren","year":"2003","unstructured":"Koren, Y., Carmel, L., Harel, D.: Drawing huge graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation\u00a01, 645\u2013673 (2003)","journal-title":"Multiscale Modeling and Simulation"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1559\/152304093782637479","volume":"20","author":"W.A. Mackaness","year":"1993","unstructured":"Mackaness, W.A., Beard, K.M.: Use of graph theory to support map generalization. Cartography and Geographic Information Science\u00a020, 210\u2013221 (1993)","journal-title":"Cartography and Geographic Information Science"},{"key":"18_CR25","unstructured":"Mackaness, W.A., Ruas, A., Sarjakoski, L.T. (eds.): Generalisation of Geographic Information. Cartographic Modelling and Applications. Elsevier B.V. (2007)"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages & Computing\u00a06(2), 183\u2013210 (1995)","journal-title":"Journal of Visual Languages & Computing"},{"key":"18_CR27","unstructured":"Openstreetmap database (2011), http:\/\/www.openstreetmap.de\/"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Graph Drawing","author":"A. Quigley","year":"2001","unstructured":"Quigley, A., Eades, P.: Fade: Graph Drawing, Clustering, and Visual Abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 197\u2013210. Springer, Heidelberg (2001)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-58950-3_398","volume-title":"Graph Drawing","author":"A. Saalfeld","year":"1995","unstructured":"Saalfeld, A.: Map Generalization as a Graph Drawing Problem. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 444\u2013451. Springer, Heidelberg (1995)"},{"key":"18_CR30","first-page":"83","volume-title":"Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI 1992","author":"M. Sarkar","year":"1992","unstructured":"Sarkar, M., Brown, M.H.: Graphical fisheye views of graphs. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI 1992, pp. 83\u201391. ACM, New York (1992)"},{"issue":"3","key":"18_CR31","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1111\/j.1467-8659.2009.01680.x","volume":"29","author":"A. Telea","year":"2010","unstructured":"Telea, A., Ersoy, O.: Image-based edge bundles: Simplified visualization of large graphs. Computer Graphics Forum\u00a029(3), 843\u2013852 (2010)","journal-title":"Computer Graphics Forum"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T23:29:39Z","timestamp":1561073379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}