| 2008 |
|---|
| 66 | EE | Ulrik Brandes,
Martin Hoefer,
Bobo Nick:
Network Connection Games with Disconnected Equilibria
CoRR abs/0805.4323: (2008) |
| 65 | EE | 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) |
| 2007 |
|---|
| 64 | EE | Ulrik Brandes,
Cesim Erten,
J. Fowler,
Fabrizio Frati,
Markus Geyer,
Carsten Gutwenger,
S. Hong,
Michael Kaufmann,
Stephen G. Kobourov,
Giuseppe Liotta,
Petra Mutzel,
Antonios Symvonis:
Colored Simultaneous Geometric Embeddings.
COCOON 2007: 254-263 |
| 63 | EE | Michael Baur,
Ulrik Brandes:
Multi-circular Layout of Micro/Macro Graphs.
Graph Drawing 2007: 255-267 |
| 62 | EE | Krists Boitmanis,
Ulrik Brandes,
Christian Pich:
Visualizing Internet Evolution on the Autonomous Systems Level.
Graph Drawing 2007: 365-376 |
| 61 | EE | Ulrik Brandes,
Daniel Fleischer:
Geographic Routing on Improved Coordinates.
IV 2007: 263-270 |
| 60 | EE | 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 |
| 59 | EE | Ulrik Brandes,
Marco Gaertler,
Dorothea Wagner:
Engineering graph clustering: Models and experimental evaluation.
ACM Journal of Experimental Algorithms 12: (2007) |
| 58 | EE | Ulrik Brandes:
Optimal leaf ordering of complete binary trees.
J. Discrete Algorithms 5(3): 546-552 (2007) |
| 2006 |
|---|
| 57 | EE | Ulrik Brandes,
Martin Hoefer,
Christian Pich:
Affiliation Dynamics with an Application to Movie-Actor Biographies.
EuroVis 2006: 179-186 |
| 56 | EE | Ulrik Brandes,
Christian Pich:
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data.
Graph Drawing 2006: 42-53 |
| 55 | EE | Ulrik Brandes,
Barbara Schlieper:
Angle and Distance Constraints on Tree Drawings.
Graph Drawing 2006: 54-65 |
| 54 | EE | Ulrik Brandes,
Jürgen Lerner:
Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities.
MFCS 2006: 202-213 |
| 53 | EE | Ulrik Brandes,
Daniel Fleischer,
Jürgen Lerner:
Summarizing Dynamic Bipolar Conflict Structures.
IEEE Trans. Vis. Comput. Graph. 12(6): 1486-1499 (2006) |
| 2005 |
|---|
| 52 | | Ulrik Brandes,
Thomas Erlebach:
Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004]
Springer 2005 |
| 51 | EE | Ulrik Brandes,
Daniel Fleischer,
Thomas Puppe:
Dynamic Spectral Layout of Small Worlds.
Graph Drawing 2005: 25-36 |
| 50 | EE | Ulrik Brandes,
Daniel Fleischer,
Jürgen Lerner:
Highlighting Conflict Dynamics in Event Data.
INFOVIS 2005: 14 |
| 49 | EE | Christian Bachmaier,
Ulrik Brandes,
Barbara Schlieper:
Drawing Phylogenetic Trees.
ISAAC 2005: 1110-1121 |
| 48 | EE | Ulrik Brandes,
Daniel Fleischer:
Centrality Measures Based on Current Flow.
STACS 2005: 533-544 |
| 47 | EE | 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 |
|---|
| 46 | EE | Michael Baur,
Ulrik Brandes,
Marco Gaertler,
Dorothea Wagner:
Drawing the AS Graph in 2.5 Dimensions.
Graph Drawing 2004: 43-48 |
| 45 | EE | Ulrik Brandes,
Christian Pich:
GraphML Transformation.
Graph Drawing 2004: 89-99 |
| 44 | EE | Ulrik Brandes,
Jürgen Lerner:
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment).
ISAAC 2004: 184-195 |
| 43 | EE | Ulrik Brandes,
Thomas Erlebach:
Introduction.
Network Analysis 2004: 1-6 |
| 42 | EE | Ulrik Brandes,
Thomas Erlebach:
Fundamentals.
Network Analysis 2004: 7-15 |
| 41 | | Ulrik Brandes,
Tim Dwyer,
Falk Schreiber:
Visual Triangulation of Network-Based Phylogenetic Trees.
VisSym 2004: 75-83 |
| 40 | EE | Michael Baur,
Ulrik Brandes:
Crossing Reduction in Circular Layouts.
WG 2004: 332-343 |
| 39 | EE | Ulrik Brandes,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Generating node coordinates for shortest-path computations in transportation networks.
ACM Journal of Experimental Algorithms 9: (2004) |
| 38 | EE | 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) |
| 37 | EE | 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) |
| 36 | EE | Ulrik Brandes,
Dorothea Wagner:
Netzwerkvisualisierung.
it - Information Technology 46(3): 129-134 (2004) |
| 2003 |
|---|
| 35 | EE | Ulrik Brandes,
Marco Gaertler,
Dorothea Wagner:
Experiments on Graph Clustering Algorithms.
ESA 2003: 568-579 |
| 34 | EE | Ulrik Brandes,
Tim Dwyer,
Falk Schreiber:
Visualizing Related Metabolic Pathways in Two and a Half Dimensions.
Graph Drawing 2003: 111-122 |
| 33 | EE | Ulrik Brandes,
Sabine Cornelsen,
Dorothea Wagner:
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.
Graph Drawing 2003: 357-368 |
| 32 | EE | Franz-Josef Brandenburg,
Ulrik Brandes,
Peter Eades,
Joe Marks:
Graph Drawing Contest Report.
Graph Drawing 2003: 504-508 |
| 31 | EE | Ulrik Brandes,
Patrick Kenis,
Dorothea Wagner:
Communicating Centrality in Policy Network Drawings.
IEEE Trans. Vis. Comput. Graph. 9(2): 241-253 (2003) |
| 30 | EE | Ulrik Brandes,
Steven R. Corman:
Visual unrolling of network evolution and the analysis of dynamic discourse?
Information Visualization 2(1): 40-50 (2003) |
| 29 | EE | Ulrik Brandes,
Sabine Cornelsen:
Visual Ranking of Link Structures.
J. Graph Algorithms Appl. 7(2): 181-201 (2003) |
| 2002 |
|---|
| 28 | EE | Ulrik Brandes:
Eager st-Ordering.
ESA 2002: 247-256 |
| 27 | EE | Ulrik Brandes,
Markus Eiglsperger,
Michael Kaufmann,
Dorothea Wagner:
Sketch-Driven Orthogonal Graph Drawing.
Graph Drawing 2002: 1-11 |
| 26 | EE | Ulrik Brandes,
Steven R. Corman:
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse.
INFOVIS 2002: 145-151 |
| 2001 |
|---|
| 25 | EE | Ulrik Brandes,
Frank Schulz,
Dorothea Wagner,
Thomas Willhalm:
Travel Planning with Self-Made Maps.
ALENEX 2001: 132-144 |
| 24 | EE | Ulrik Brandes,
Boris Köpf:
Fast and Simple Horizontal Coordinate Assignment.
Graph Drawing 2001: 31-44 |
| 23 | EE | 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 | EE | Ulrik Brandes,
Markus Eiglsperger,
Ivan Herman,
Michael Himsolt,
M. Scott Marshall:
GraphML Progress Report.
Graph Drawing 2001: 501-512 |
| 21 | EE | Ulrik Brandes,
Sabine Cornelsen:
Visual Ranking of Link Structures.
WADS 2001: 222-233 |
| 20 | EE | 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 | EE | Ulrik Brandes,
Sabine Cornelsen,
Dorothea Wagner:
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract).
Graph Drawing 2000: 103-114 |
| 17 | EE | Ulrik Brandes,
Galina Shubina,
Roberto Tamassia,
Dorothea Wagner:
Fast Layout Methods for Timetable Graphs.
Graph Drawing 2000: 127-138 |
| 16 | EE | Ulrik Brandes,
M. Scott Marshall,
Stephen C. North:
Graph Data Format Workshop Report.
Graph Drawing 2000: 407-409 |
| 15 | EE | Franz-Josef Brandenburg,
Ulrik Brandes,
Michael Himsolt,
Marcus Raitner:
Graph-Drawing Contest Report.
Graph Drawing 2000: 410-418 |
| 14 | EE | 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 | EE | Ulrik Brandes,
Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data.
J. Graph Algorithms Appl. 4(3): 135-155 (2000) |
| 12 | EE | 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 | EE | Ulrik Brandes:
Drawing on Physical Analogies.
Drawing Graphs 1999: 71-86 |
| 10 | EE | Ulrik Brandes,
Patrick Kenis,
Dorothea Wagner:
Centrality in Policy Network Drawings.
Graph Drawing 1999: 250-258 |
| 9 | EE | Ulrik Brandes:
Hunting Down Graph B.
Graph Drawing 1999: 410-415 |
| 8 | EE | 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 | EE | 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 | EE | Ulrik Brandes,
Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data.
Graph Drawing 1998: 44-56 |
| 5 | EE | Ulrik Brandes,
Dorothea Wagner:
Dynamic Grid Embedding with Few Bends and Changes.
ISAAC 1998: 89-98 |
| 4 | EE | 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 |
