{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T23:53:39Z","timestamp":1726444419507},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020933"},{"type":"electronic","value":"9783642020940"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02094-0_16","type":"book-chapter","created":{"date-parts":[[2009,6,27]],"date-time":"2009-06-27T10:45:07Z","timestamp":1246099507000},"page":"330-358","source":"Crossref","is-referenced-by-count":2,"title":["Group-Level Analysis and Visualization of Social Networks"],"prefix":"10.1007","author":[{"given":"Michael","family":"Baur","sequence":"first","affiliation":[]},{"given":"Ulrik","family":"Brandes","sequence":"additional","affiliation":[]},{"given":"J\u00fcrgen","family":"Lerner","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., Fiat, A., Karlin, A., McSherry, F.: Web Search Via Hub Synthesis. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 500\u2013509 (2001)","DOI":"10.1109\/SFCS.2001.959926"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1137\/S0097539794270248","volume":"26","author":"N. Alon","year":"1997","unstructured":"Alon, N., Kahale, N.: A Spectral Technique for Coloring Random 3-Colorable Graphs. SIAM Journal on Computation\u00a026, 1733\u20131748 (1997)","journal-title":"SIAM Journal on Computation"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TVCG.2007.46","volume":"13","author":"D. Archambault","year":"2007","unstructured":"Archambault, D., Munzner, T., Auber, D.: TopoLayout: Multi-Level Graph Layout by Topological Features. IEEE Transactions on Visualization and Computer Graphics\u00a013(2), 305\u2013317 (2007)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Azar, Y., Fiat, A., Karlin, A., McSherry, F., Saia, J.: Spectral Analysis of Data. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 619\u2013626 (2001)","DOI":"10.1145\/380752.380859"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TVCG.2007.1000","volume":"13","author":"C. Bachmaier","year":"2007","unstructured":"Bachmaier, C.: A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information. IEEE Transactions on Visualization and Computer Graphics\u00a013(3), 585\u2013594 (2007)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Balzer, M., Deussen, O.: Level-of-Detail Visualization of Clustered Graph Layouts. In: Asia-Pacific Symposium on Visualisation 2007, APVIS 2007 (2007)","DOI":"10.1109\/APVIS.2007.329288"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0378-8733(92)90016-Z","volume":"14","author":"V. Batagelj","year":"1992","unstructured":"Batagelj, V., Doreian, P., Ferligoj, A.: An Optimizational Approach to Regular Equivalence. Social Networks\u00a014, 121\u2013135 (1992)","journal-title":"Social Networks"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-30559-0_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Baur","year":"2004","unstructured":"Baur, M., Brandes, U.: Crossing Reduction in Circular Layouts. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 332\u2013343. Springer, Heidelberg (2004)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/270991","volume":"22","author":"S.P. Borgatti","year":"1992","unstructured":"Borgatti, S.P., Everett, M.G.: Notions of Position in Social Network Analysis. Sociological Methodology\u00a022, 1\u201335 (1992)","journal-title":"Sociological Methodology"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U. Brandes","year":"2008","unstructured":"Brandes, U.: On Variants of Shortest-Path Betweenness Centrality and their Generic Computation. Social Networks\u00a030(2), 136\u2013145 (2008)","journal-title":"Social Networks"},{"volume-title":"Network Analysis: Methodological Foundations","year":"2005","key":"16_CR11","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis: Methodological Foundations. Springer, Heidelberg (2005)"},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1109\/TVCG.2006.105","volume":"12","author":"U. Brandes","year":"2006","unstructured":"Brandes, U., Fleischer, D., Lerner, J.: Summarizing Dynamic Bipolar Conflict Structures. IEEE Transactions on Visualization and Computer Graphics, special issue on Visual Analytics\u00a012(6), 1486\u20131499 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics, special issue on Visual Analytics"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-30551-4_18","volume-title":"Algorithms and Computation","author":"U. Brandes","year":"2004","unstructured":"Brandes, U., Lerner, J.: Structural Similarity in Graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 184\u2013195. Springer, Heidelberg (2004)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/11821069_18","volume-title":"Mathematical Foundations of Computer Science 2006","author":"U. Brandes","year":"2006","unstructured":"Brandes, U., Lerner, J.: Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 202\u2013213. Springer, Heidelberg (2006)"},{"key":"16_CR15","series-title":"NATO Science for Peace and Security Series E: Human and Societal Dynamics","volume-title":"Building and Using Datasets on Armed Conflicts","author":"U. Brandes","year":"2008","unstructured":"Brandes, U., Lerner, J.: Visualization of Conflict Networks. In: Kauffmann, M. (ed.) Building and Using Datasets on Armed Conflicts. NATO Science for Peace and Security Series E: Human and Societal Dynamics, vol.\u00a036. IOS Press, Amsterdam (2008)"},{"key":"16_CR16","unstructured":"Coja-Oghlan, A.: A Spectral Heuristic for Bisecting Random Graphs. In: Proceeding of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 850\u2013859 (2005)"},{"key":"16_CR17","series-title":"Monographs on Statistics and Applied Probability","volume-title":"Multidimensional Scaling","author":"T.F. Cox","year":"2001","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling, 2nd edn. Monographs on Statistics and Applied Probability. Chapman\u00a0& Hall\/CRC, Boca Raton (2001)","edition":"2"},{"key":"16_CR18","unstructured":"Cvetkovi\u0107, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Johann Ambrosius Barth Verlag (1995)"},{"key":"16_CR19","series-title":"Structural Analysis in the Social Sciences","volume-title":"Generalized Blockmodeling","author":"P. Doreian","year":"2005","unstructured":"Doreian, P., Batagelj, V., Ferligoj, A.: Generalized Blockmodeling. Structural Analysis in the Social Sciences, vol.\u00a025. Cambridge University Press, Cambridge (2005)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45848-4_14","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2002","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with Fat Edges. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 162\u2013177. Springer, Heidelberg (2002)"},{"issue":"A","key":"16_CR21","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"Eades, P., Kelly, D.: Heuristics for Reducing Crossings in 2-Layered Networks. Ars Combinatoria\u00a021(A), 89\u201398 (1986)","journal-title":"Ars Combinatoria"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/0022250X.1994.9990134","volume":"18","author":"M.G. Everett","year":"1994","unstructured":"Everett, M.G., Borgatti, S.P.: Regular Equivalence: General Theory. Journal of Mathematical Sociology\u00a018(1), 29\u201352 (1994)","journal-title":"Journal of Mathematical Sociology"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/3-540-45061-0_64","volume-title":"Automata, Languages and Programming","author":"J. Fiala","year":"2003","unstructured":"Fiala, J., Paulusma, D.: The Computational Complexity of the Role Assignment Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 817\u2013828. Springer, Heidelberg (2003)"},{"key":"16_CR24","unstructured":"Fleischer, D.: Theory and Applications of the Laplacian. Ph.D thesis (2007)"},{"key":"16_CR25","unstructured":"Freeman, L.C.: Visualizing Social Networks. Journal of Social Structure\u00a01(1) (2000)"},{"issue":"11","key":"16_CR26","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph Drawing by Force-Directed Placement. Software - Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software - Practice and Experience"},{"key":"16_CR27","unstructured":"Gaertler, M.: Algorithmic Aspects of Clustering \u2013 Theory, Experimental Evaluation and Applications in Network Analysis and Visualization. Ph.D thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t f\u00fcr Informatik (2007)"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved Circular Layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 386\u2013398. Springer, Heidelberg (2007)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"1999","unstructured":"Gansner, E.R., North, S.C.: Improved Force-Directed Layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 364\u2013373. Springer, Heidelberg (1999)"},{"key":"16_CR30","first-page":"364","volume-title":"Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)","author":"C. Gkantsidis","year":"2003","unstructured":"Gkantsidis, C., Mihail, M., Zegura, E.W.: Spectral Analysis of Internet Topologies. In: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom), vol.\u00a01, pp. 364\u2013374. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"16_CR31","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C. Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (2001)"},{"key":"16_CR32","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., van Loan, C.F.: Matrix Computations. John Hopkins University Press, Baltimore (1996)"},{"key":"16_CR33","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/1556262.1556288","volume-title":"Proceedings of the 6th Working Conference on Advanced Visual Interfaces (AVI 2002)","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Drawing Graphs with Non-Uniform Vertices. In: Proceedings of the 6th Working Conference on Advanced Visual Interfaces (AVI 2002), pp. 157\u2013166. ACM Press, New York (2002)"},{"issue":"5","key":"16_CR34","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D. Holten","year":"2006","unstructured":"Holten, D.: Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data. IEEE Transactions on Visualization and Computer Graphics\u00a012(5), 741\u2013748 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"3","key":"16_CR35","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1145\/990308.990313","volume":"51","author":"R. Kannan","year":"2004","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, Bad and Spectral. Journal of the ACM\u00a051(3), 497\u2013515 (2004)","journal-title":"Journal of the ACM"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-36151-0_2","volume-title":"Graph Drawing","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Maintaining the Mental Map for Circular Drawings. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 12\u201322. Springer, Heidelberg (2002)"},{"key":"16_CR37","unstructured":"Krebs, V.E.: Visualizing Human Networks. Release 1.0, pp. 1\u201325 (1996)"},{"key":"16_CR38","unstructured":"Krempel, L.: Visualisierung komplexer Strukturen. Grundlagen der Darstellung mehrdimensionaler Netzwerke. Campus (2005)"},{"key":"16_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-31955-9_9","volume-title":"Network Analysis","author":"J. Lerner","year":"2005","unstructured":"Lerner, J.: Role Assignments. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. LNCS, vol.\u00a03418, pp. 216\u2013252. Springer, Heidelberg (2005)"},{"key":"16_CR40","unstructured":"Lerner, J.: Structural Similarity of Vertices in Networks. Ph.D thesis (2007)"},{"key":"16_CR41","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F. Lorrain","year":"1971","unstructured":"Lorrain, F., White, H.C.: Structural Equivalence of Individuals in Social Networks. Journal of Mathematical Sociology\u00a01, 49\u201380 (1971)","journal-title":"Journal of Mathematical Sociology"},{"issue":"3","key":"16_CR42","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1006\/jtbi.2003.3147","volume":"220","author":"J.J. Luczkovich","year":"2003","unstructured":"Luczkovich, J.J., Borgatti, S.P., Johnson, J.C., Everett, M.G.: Defining and Measuring Trophic Role Similarity in Food Webs Using Regular Equivalence. Journal of Theoretical Biology\u00a0220(3), 303\u2013321 (2003)","journal-title":"Journal of Theoretical Biology"},{"key":"16_CR43","first-page":"292","volume-title":"Proceedings of the 20th IEEE International Symposium on Circuits and Systems 1987","author":"S. Masuda","year":"1987","unstructured":"Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: On the \n \n \n \n $\\mathcal{NP}$\n -Completeness of a Computer Network Layout Problem. In: Proceedings of the 20th IEEE International Symposium on Circuits and Systems 1987, pp. 292\u2013295. IEEE Computer Society, Los Alamitos (1987)"},{"key":"16_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Graph Drawing","author":"C. Matuszewski","year":"1999","unstructured":"Matuszewski, C., Sch\u00f6nfeld, R., Molitor, P.: Using Sifting for k-Layer Straightline Crossing Minimization. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 217\u2013224. Springer, Heidelberg (1999)"},{"key":"16_CR45","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Spectral Partitioning of Random Graphs. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 529\u2013537 (2001)","DOI":"10.1109\/SFCS.2001.959929"},{"issue":"2","key":"16_CR46","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jcss.2000.1711","volume":"61","author":"C. Papadimitriou","year":"2000","unstructured":"Papadimitriou, C., Raghavan, P., Tamaki, H., Vempala, S.: Latent Semantic Indexing: A Probabilistic Analysis. Journal of Computer and System Sciences\u00a061(2), 217\u2013235 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR47","first-page":"42","volume-title":"Proceedings of the 1993 IEEE\/ACM International Conference on Computer-Aided Design","author":"R. Rudell","year":"1993","unstructured":"Rudell, R.: Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In: Proceedings of the 1993 IEEE\/ACM International Conference on Computer-Aided Design, pp. 42\u201347. IEEE Computer Society Press, Los Alamitos (1993)"},{"key":"16_CR48","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0378-8733(78)90014-X","volume":"1","author":"L.D. Sailer","year":"1978","unstructured":"Sailer, L.D.: Structural Equivalence: Meaning and Definition, Computation and Application. Social Networks\u00a01, 73\u201390 (1978)","journal-title":"Social Networks"},{"issue":"3","key":"16_CR49","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1177\/089443939401200408","volume":"12","author":"P.A. Schrodt","year":"1994","unstructured":"Schrodt, P.A., Davis, S.G., Weddle, J.L.: Political Science: KEDS - A Program for the Machine Coding of Event Data. Social Science Computer Review\u00a012(3), 561\u2013588 (1994)","journal-title":"Social Science Computer Review"},{"key":"16_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-24595-7_13","volume-title":"Graph Drawing","author":"J.M. Six","year":"2004","unstructured":"Six, J.M., Tollis, I.G.: A Framework for User-Grouped Circular Drawings. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 135\u2013146. Springer, Heidelberg (2004)"},{"key":"16_CR51","volume-title":"Matrix Perturbation Theory","author":"G.W. Stewart","year":"1990","unstructured":"Stewart, G.W., Sun, J.-G.: Matrix Perturbation Theory. Academic Press, London (1990)"},{"key":"16_CR52","unstructured":"Vempala, S., Wang, G.: A Spectral Algorithm for Learning Mixtures of Distributions. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2002 (2002)"},{"key":"16_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/BFb0021835","volume-title":"Graph Drawing","author":"X. Wang","year":"1996","unstructured":"Wang, X., Miyamoto, I.: Generating Customized Layouts. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 504\u2013515. Springer, Heidelberg (1996)"},{"key":"16_CR54","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"16_CR55","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0378-8733(83)90025-4","volume":"5","author":"D.R. White","year":"1983","unstructured":"White, D.R., Reitz, K.P.: Graph and Semigroup Homomorphisms on Networks of Relations. Social Networks\u00a05, 193\u2013234 (1983)","journal-title":"Social Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Large and Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02094-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:08:27Z","timestamp":1558267707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02094-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020933","9783642020940"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02094-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}