2009 | ||
---|---|---|
83 | Ulrik Brandes, Jürgen Lerner, Tom A. B. Snijders: Networks Evolving Step by Step: Statistical Analysis of Dyadic Event Data. ASONAM 2009: 200-205 | |
82 | Michael Baur, Ulrik Brandes, Jürgen Lerner, Dorothea Wagner: Group-Level Analysis and Visualization of Social Networks. Algorithmics of Large and Complex Networks 2009: 330-358 | |
81 | Michael R. Berthold, Ulrik Brandes, Tobias Kötter, Martin Mader, Uwe Nagel, Kilian Thiel: Pure spreading activation is pointless. CIKM 2009: 1915-1918 | |
80 | Ulrik Brandes, Patrick Kenis, Jürgen Lerner, Denise van Raaij: Network analysis of collaboration structure in Wikipedia. WWW 2009: 731-740 | |
79 | Ulrik Brandes, Sabine Cornelsen: Phylogenetic graph models beyond trees. Discrete Applied Mathematics 157(10): 2361-2369 (2009) | |
78 | Ulrik Brandes, Daniel Fleischer: Vertex Bisection is Hard, too. J. Graph Algorithms Appl. 13(2): 119-131 (2009) | |
2008 | ||
77 | Ulrik Brandes, Christian Pich: An Experimental Study on Distance-Based Graph Drawing. Graph Drawing 2008: 218-229 | |
76 | Ulrik Brandes, Barbara Pampel: On the Hardness of Orthogonal-Order Preserving Graph Drawing. Graph Drawing 2008: 266-277 | |
75 | Joachim Böttger, Ulrik Brandes, Oliver Deussen, Hendrik Ziezold: Map Warping for the Annotation of Metro Maps. PacificVis 2008: 199-206 | |
74 | Ulrik Brandes, Jürgen Lerner, Miranda J. Lubbers, Chris McCarty, José Luis Molina: Visual Statistics for Collections of Clustered Graphs. PacificVis 2008: 47-54 | |
73 | Ulrik Brandes, Martin Hoefer, Bobo Nick: Network Creation Games with Disconnected Equilibria. WINE 2008: 394-401 | |
72 | Ulrik Brandes, Gabi Dorfmüller: PageRank: Was ist wichtig im World Wide Web?. Taschenbuch der Algorithmen 2008: 95-101 | |
71 | Ulrik Brandes, Martin Hoefer, Bobo Nick: Network Connection Games with Disconnected Equilibria CoRR abs/0805.4323: (2008) | |
70 | Joachim Böttger, Ulrik Brandes, Oliver Deussen, Hendrik Ziezold: Map Warping for the Annotation of Metro Maps. IEEE Computer Graphics and Applications 28(5): 56-65 (2008) | |
69 | Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner: On Modularity Clustering. IEEE Trans. Knowl. Data Eng. 20(2): 172-188 (2008) | |
68 | Ulrik Brandes, Jürgen Lerner: Visual analysis of controversy in user-generated encyclopedias. Information Visualization 7(1): 34-48 (2008) | |
2007 | ||
67 | Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis: Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 | |
66 | Michael Baur, Ulrik Brandes: Multi-circular Layout of Micro/Macro Graphs. Graph Drawing 2007: 255-267 | |
65 | Krists Boitmanis, Ulrik Brandes, Christian Pich: Visualizing Internet Evolution on the Autonomous Systems Level. Graph Drawing 2007: 365-376 | |
64 | Ulrik Brandes, Daniel Fleischer: Geographic Routing on Improved Coordinates. IV 2007: 263-270 | |
63 | Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner: On Finding Graph Clusterings with Maximum Modularity. WG 2007: 121-132 | |
62 | Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Engineering graph clustering: Models and experimental evaluation. ACM Journal of Experimental Algorithmics 12: (2007) | |
61 | Ulrik Brandes, Christian Pich: Centrality Estimation in Large Networks. I. J. Bifurcation and Chaos 17(7): 2303-2318 (2007) | |
60 | Ulrik Brandes: Optimal leaf ordering of complete binary trees. J. Discrete Algorithms 5(3): 546-552 (2007) | |
59 | Ulrik Brandes, Daniel Fleischer, Thomas Puppe: Dynamic Spectral Layout with an Application to Small Worlds. J. Graph Algorithms Appl. 11(2): 325-343 (2007) | |
2006 | ||
58 | Ulrik Brandes, Martin Hoefer, Christian Pich: Affiliation Dynamics with an Application to Movie-Actor Biographies. EuroVis 2006: 179-186 | |
57 | Ulrik Brandes, Christian Pich: Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. Graph Drawing 2006: 42-53 | |
56 | Ulrik Brandes, Barbara Schlieper: Angle and Distance Constraints on Tree Drawings. Graph Drawing 2006: 54-65 | |
55 | Ulrik Brandes, Jürgen Lerner: Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities. MFCS 2006: 202-213 | |
54 | Ulrik Brandes, Daniel Fleischer, Jürgen Lerner: Summarizing Dynamic Bipolar Conflict Structures. IEEE Trans. Vis. Comput. Graph. 12(6): 1486-1499 (2006) | |
2005 | ||
53 | Ulrik Brandes, Thomas Erlebach: Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004] Springer 2005 | |
52 | Ulrik Brandes, Daniel Fleischer, Thomas Puppe: Dynamic Spectral Layout of Small Worlds. Graph Drawing 2005: 25-36 | |
51 | Ulrik Brandes, Daniel Fleischer, Jürgen Lerner: Highlighting Conflict Dynamics in Event Data. INFOVIS 2005: 14 | |
50 | Christian Bachmaier, Ulrik Brandes, Barbara Schlieper: Drawing Phylogenetic Trees. ISAAC 2005: 1110-1121 | |
49 | Ulrik Brandes, Daniel Fleischer: Centrality Measures Based on Current Flow. STACS 2005: 533-544 | |
48 | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles. J. Graph Algorithms Appl. 9(1): 99-115 (2005) | |
2004 | ||
47 | Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Drawing the AS Graph in 2.5 Dimensions. Graph Drawing 2004: 43-48 | |
46 | Ulrik Brandes, Christian Pich: GraphML Transformation. Graph Drawing 2004: 89-99 | |
45 | Ulrik Brandes, Jürgen Lerner: Structural Similarity in Graphs (A Relaxation Approach for Role Assignment). ISAAC 2004: 184-195 | |
44 | Ulrik Brandes, Thomas Erlebach: Introduction. Network Analysis 2004: 1-6 | |
43 | Ulrik Brandes, Thomas Erlebach: Fundamentals. Network Analysis 2004: 7-15 | |
42 | Ulrik Brandes, Tim Dwyer, Falk Schreiber: Visual Triangulation of Network-Based Phylogenetic Trees. VisSym 2004: 75-83 | |
41 | Michael Baur, Ulrik Brandes: Crossing Reduction in Circular Layouts. WG 2004: 332-343 | |
40 | Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Generating node coordinates for shortest-path computations in transportation networks. ACM Journal of Experimental Algorithmics 9: (2004) | |
39 | Ulrik Brandes, Sabine Cornelsen, Christian Fieß, Dorothea Wagner: How to draw the minimum cuts of a planar graph. Comput. Geom. 29(2): 117-133 (2004) | |
38 | Ulrik Brandes, Dorothea Wagner: Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany. J. Discrete Algorithms 2(4): 381 (2004) | |
37 | Ulrik Brandes, Tim Dwyer, Falk Schreiber: Visual Understanding of Metabolic Pathways Across Organisms Using Layout in Two and a Half Dimensions. J. Integrative Bioinformatics 1(1): (2004) | |
36 | Ulrik Brandes, Dorothea Wagner: Netzwerkvisualisierung. it - Information Technology 46(3): 129-134 (2004) | |
2003 | ||
35 | Ulrik Brandes, Marco Gaertler, Dorothea Wagner: Experiments on Graph Clustering Algorithms. ESA 2003: 568-579 | |
34 | Ulrik Brandes, Tim Dwyer, Falk Schreiber: Visualizing Related Metabolic Pathways in Two and a Half Dimensions. Graph Drawing 2003: 111-122 | |
33 | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. Graph Drawing 2003: 357-368 | |
32 | Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks: Graph Drawing Contest Report. Graph Drawing 2003: 504-508 | |
31 | Ulrik Brandes, Patrick Kenis, Dorothea Wagner: Communicating Centrality in Policy Network Drawings. IEEE Trans. Vis. Comput. Graph. 9(2): 241-253 (2003) | |
30 | Ulrik Brandes, Steven R. Corman: Visual unrolling of network evolution and the analysis of dynamic discourse? Information Visualization 2(1): 40-50 (2003) | |
29 | Ulrik Brandes, Sabine Cornelsen: Visual Ranking of Link Structures. J. Graph Algorithms Appl. 7(2): 181-201 (2003) | |
2002 | ||
28 | Ulrik Brandes: Eager st-Ordering. ESA 2002: 247-256 | |
27 | Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner: Sketch-Driven Orthogonal Graph Drawing. Graph Drawing 2002: 1-11 | |
26 | Ulrik Brandes, Steven R. Corman: Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse. INFOVIS 2002: 145-151 | |
2001 | ||
25 | Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Travel Planning with Self-Made Maps. ALENEX 2001: 132-144 | |
24 | Ulrik Brandes, Boris Köpf: Fast and Simple Horizontal Coordinate Assignment. Graph Drawing 2001: 31-44 | |
23 | Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner: Visone. Graph Drawing 2001: 463-464 | |
22 | Ulrik Brandes, Markus Eiglsperger, Ivan Herman, Michael Himsolt, M. Scott Marshall: GraphML Progress Report. Graph Drawing 2001: 501-512 | |
21 | Ulrik Brandes, Sabine Cornelsen: Visual Ranking of Link Structures. WADS 2001: 222-233 | |
20 | Ulrik Brandes, Jörg Raab, Dorothea Wagner: Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. Journal of Social Structure 2(4): (2001) | |
2000 | ||
19 | Ulrik Brandes, Dorothea Wagner: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings Springer 2000 | |
18 | Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner: How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). Graph Drawing 2000: 103-114 | |
17 | Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner: Fast Layout Methods for Timetable Graphs. Graph Drawing 2000: 127-138 | |
16 | Ulrik Brandes, M. Scott Marshall, Stephen C. North: Graph Data Format Workshop Report. Graph Drawing 2000: 407-409 | |
15 | Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner: Graph-Drawing Contest Report. Graph Drawing 2000: 410-418 | |
14 | Ulrik Brandes, Dorothea Wagner: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. Algorithmica 28(1): 16-36 (2000) | |
13 | Ulrik Brandes, Dorothea Wagner: Using Graph Layout to Visualize Train Interconnection Data. J. Graph Algorithms Appl. 4(3): 135-155 (2000) | |
12 | Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm: Dynamic WWW Structures in 3D. J. Graph Algorithms Appl. 4(3): 183-191 (2000) | |
1999 | ||
11 | Ulrik Brandes: Drawing on Physical Analogies. Drawing Graphs 1999: 71-86 | |
10 | Ulrik Brandes, Patrick Kenis, Dorothea Wagner: Centrality in Policy Network Drawings. Graph Drawing 1999: 250-258 | |
9 | Ulrik Brandes: Hunting Down Graph B. Graph Drawing 1999: 410-415 | |
8 | Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm: Empirical Design of Geometric Algorithms. Symposium on Computational Geometry 1999: 86-94 | |
7 | Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe: A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discrete Applied Mathematics 92(2-3): 91-110 (1999) | |
1998 | ||
6 | Ulrik Brandes, Dorothea Wagner: Using Graph Layout to Visualize Train Interconnection Data. Graph Drawing 1998: 44-56 | |
5 | Ulrik Brandes, Dorothea Wagner: Dynamic Grid Embedding with Few Bends and Changes. ISAAC 1998: 89-98 | |
4 | Ulrik Brandes, Dagmar Handke: NP-Completeness Results for Minimum Planar Spanners. Discrete Mathematics & Theoretical Computer Science 3(1): 1-10 (1998) | |
1997 | ||
3 | Ulrik Brandes, Dorothea Wagner: A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). ESA 1997: 64-77 | |
2 | Ulrik Brandes, Dorothea Wagner: A Bayesian Paradigm for Dynamic Graph Layout. Graph Drawing 1997: 236-247 | |
1 | Ulrik Brandes, Dagmar Handke: NP-Completness Results for Minimum Planar Spanners. WG 1997: 85-99 |