{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T00:04:30Z","timestamp":1770336270802,"version":"3.49.0"},"publisher-location":"Vienna","reference-count":29,"publisher":"Springer Vienna","isbn-type":[{"value":"9783211835159","type":"print"},{"value":"9783709167830","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-7091-6783-0_2","type":"book-chapter","created":{"date-parts":[[2011,9,15]],"date-time":"2011-09-15T23:45:11Z","timestamp":1316130311000},"page":"13-22","source":"Crossref","is-referenced-by-count":3,"title":["Contextual Visualization of Actor Status in Social Networks"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK User\u2019s Guide. Society for Industrial and Applied Mathematics, 3rd edition, 1999. See http:\/\/www.netlib.org\/lapack\/.","DOI":"10.1137\/1.9780898719604"},{"issue":"2","key":"2_CR2","first-page":"47","volume":"21","author":"V Batagelj","year":"1998","unstructured":"V. Batagelj and A. Mrvar. Pajek - Program for large network analysis. Connections, 21(2)47\u201357, 1998. Project home page at http:\/\/vlado.mat.uni-lj.si\/pub\/networks\/pajek\/default.htm.","journal-title":"Pajek - Program for large network analysis. Connections"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/2945.468391","volume":"1","author":"RA Becker","year":"1995","unstructured":"R.A. Becker, S.G. Eick, and A.R. Wilks. Visualizing network data. IEEE Transactions on Visualization and Graphics, 1(1)16\u201328, 1995.","journal-title":"IEEE Transactions on Visualization and Graphics"},{"key":"2_CR4","unstructured":"J. Bertin. Semiology of Graphics: Diagrams, Networks, Maps. University of Wisconsin Press, 1983."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1177\/0951692899011001004","volume":"11","author":"U Brandes","year":"1999","unstructured":". U. Brandes, P. Kenis, J. Raab, V. Schneider, and D. Wagner. Explorations into the visualization of policy networks. Journal of Theoretical Politics, 11(1)75\u2013106 1999.","journal-title":"Journal of Theoretical Politics"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"U. Brandes, P. Kenis, and D. Wagner. Centrality in policy network drawings. In Kratochvil [19], pages 250\u2013258.","DOI":"10.1007\/3-540-46648-7_26"},{"key":"2_CR7","volume-title":"Structure, Version 4.2","author":"RS Burt","year":"1991","unstructured":"R.S. Burt. Structure, Version 4.2. Center for the Social Sciences, Columbia University, New York, 1991."},{"key":"2_CR8","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999."},{"key":"2_CR9","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"P. Eades and N.C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11:379\u2013403, 1994.","journal-title":"Algorithmica"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"17","author":"ER Gansner","year":"1988","unstructured":"E.R. Gansner, S.C. North, andK.-P. Vo. DAG - A program that draws directed graphs. Software-Practice and Experience, 17(1)1047\u20131062, 1988.","journal-title":"Software-Practice and Experience"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"M.R. Garey and D.S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4:312\u2013316, 1983","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"N.B. Harrison and J.O. Coplien. Patterns of productive Software organziations. Bell Labs Technical Journal, pages 138\u2013145 Summer 1996.","DOI":"10.1002\/1538-7305(199621)1:1<138::AID-BLTJ2010>3.0.CO;2-P"},{"issue":"1","key":"2_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"M. J\u00fcnger and P. Mutzel. 2-Layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal on Graph Algorithms and Applications, 1(1)1\u201325 1997.","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"R.M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18:39\u201343 1953.","journal-title":"Psychometrika"},{"key":"2_CR17","unstructured":"D. Krackhardt. Social networks and the liability of newness for managers. In C.L. Cooper and D.M. Rousseau, editors, Trends in Organizational Behavior, volume 3, pages 159-173. John Wiley & Sons, 1996."},{"issue":"2","key":"2_CR18","first-page":"53","volume":"17","author":"D Krackhardt","year":"1994","unstructured":"D. Krackhardt, J. Blythe, and C. McGrath. KrackPlot 3.0: An improved network drawing program. Connections, 17(2):53\u201355, 1994. Project home page at http:\/\/www.contrib.andrew.cmu.edu\/~krack\/.","journal-title":"Connections"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"J. Kratochv\u00edl, editor. Proceedings of the 7th International Symposium on Graph Drawing (GD \u203299), volume 1731 of Lecture Notes in Computer Science. Springer, 1999.","DOI":"10.1007\/3-540-46648-7"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"C. Matuszewski, R. Sch\u00f6nfeld, and P. Molitor. Using sifting for k-layer straightline crossing minimization. In Kratochv\u00edl [19], pages 217-224.","DOI":"10.1007\/3-540-46648-7_22"},{"issue":"3","key":"2_CR21","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0378-8733(96)00299-7","volume":"19","author":"C McGrath","year":"1997","unstructured":"C. McGrath, J. Blythe, and D. Krackhardt. The effect of spatial arrangement on judgments and errors in interpreting graphs. Social Networks, 19(3)223\u2013242, 1997.","journal-title":"Social Networks"},{"key":"2_CR22","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform of Combinatorial and Geometrie Computing. Cambridge University Press, 1999. Project home page at http:\/\/www.mpi-sb.mpg.de\/LEDA\/."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"P. Mutzel, C. Gutwenger, R. Brockenauer, S. Fialko, G.W. Klau, M. Kr\u00fcger, T. Ziegler, S. N\u00e4her, D. Alberts, D. Ambras, G. Koch, M. J\u00fcnger, C. Buchheim, and S. Leipert. A library of algorithms for graph drawing. In S.H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD \u201998), volume 1547 of Lecture Notes in Computer Science, pages 456-457. Springer, 1998. Project home page at http:\/\/www.mpi-sb.mpg.de\/AGD\/.","DOI":"10.1007\/3-540-37623-2_44"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"H.C. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Proceedings of the 5th International Symposium on Graph Drawing (GD \u201997), volume 1353 of Lecture Notes in Computer Science, pages 248- 261. Springer, 1997.","DOI":"10.1007\/3-540-63938-1_67"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"H.C. Purchase, R.F. Cohen, and M. James. An experimental study of the basis for graph drawing algorithms. ACM Journal of Experimental Algorithmics, 2(4), 1997.","DOI":"10.1145\/264216.264222"},{"key":"2_CR26","unstructured":"J. Raab. Steuerungsstrukturen politisierter Gro\u00dfprivatisierungen in Ostdeutschland 1990-1994. Das Beispiel der Werft- und Stahlindustrie. PhD thesis, University of Konstanz, 2000."},{"key":"2_CR27","unstructured":"W.D. Richards. MultiNet. Software tool, see http:\/\/www.sfu.ca\/~richards\/ Multinet\/."},{"issue":"2","key":"2_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system struetures. IEEE Transactions on Systems, Man and Cybernetics, 11(2): 109\u2013125, February 1981.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511815478"}],"container-title":["Eurographics","Data Visualization 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6783-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,5]],"date-time":"2021-12-05T00:49:37Z","timestamp":1638665377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6783-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783211835159","9783709167830"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6783-0_2","relation":{},"ISSN":["0946-2767"],"issn-type":[{"value":"0946-2767","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}