default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrik Brandes
Person information
- affiliation: ETH Zurich, Switzerland
- affiliation (former): University of Konstanz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c98]Kshitijaa Jaglan, Meher Chaitanya, Triansh Sharma, Abhijeeth Singam, Nidhi Goyal, Ponnurangam Kumaraguru, Ulrik Brandes:
Tight Sampling in Unbounded Networks. ICWSM 2024: 704-716- 2023
- [j67]Wei Zhang
, Ulrik Brandes:
Is cooperation sustained under increased mixing in evolutionary public goods games on networks? Appl. Math. Comput. 438: 127604 (2023) - [j66]Rouzbeh Hasheminezhad, Ulrik Brandes:
Robustness of preferential-attachment graphs. Appl. Netw. Sci. 8(1): 32 (2023) - [j65]Simon Päpcke, Thomas Weitin, Katharina Herget, Anastasia Glawion, Ulrik Brandes:
Stylometric similarity in literary corpora: Non-authorship clustering and Deutscher Novellenschatz. Digit. Scholarsh. Humanit. 38(1): 277-295 (2023) - [c97]Rouzbeh Hasheminezhad, August Bøgh Rønberg, Ulrik Brandes:
The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis. WAW 2023: 99-111 - [i14]Ulrik Brandes, Gordana Marmulla, Ivana Smokovic:
Stop Simulating! Efficient Computation of Tournament Winning Probabilities. CoRR abs/2307.10411 (2023) - [i13]Kshitijaa Jaglan, Meher Chaitanya, Triansh Sharma, Abhijeeth Singam, Nidhi Goyal, Ponnurangam Kumaraguru, Ulrik Brandes:
Tight Sampling in Unbounded Networks. CoRR abs/2310.02859 (2023) - 2022
- [j64]Stanley Wasserman, Ulrik Brandes:
Editors' Note. Netw. Sci. 10(1): 1-2 (2022) - [j63]Julian Müller, Ulrik Brandes:
The evolution of roles. Soc. Networks 68: 195-208 (2022) - [c96]Ulrik Brandes, Christian Laußmann, Jörg Rothe:
Voting for Centrality. AAMAS 2022: 1554-1556 - [c95]Rouzbeh Hasheminezhad, Ulrik Brandes:
Robustness of Preferential-Attachment Graphs: Shifting the Baseline. COMPLEX NETWORKS (2) 2022: 445-456 - [c94]Kenza Amara, Zhitao Ying, Zitao Zhang, Zhichao Han, Yang Zhao, Yinan Shan, Ulrik Brandes, Sebastian Schemm, Ce Zhang:
GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks. LoG 2022: 44 - [c93]Rouzbeh Hasheminezhad, Ulrik Brandes:
Constructing Provably Robust Scale-Free Networks. NetSci-X 2022: 126-139 - [p8]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p7]Ulrik Brandes, Michael Hamann, Luise Häuser, Dorothea Wagner:
Skeleton-Based Clustering by Quasi-Threshold Editing. Algorithms for Big Data 2022: 134-151 - [i12]Kenza Amara, Rex Ying, Zitao Zhang, Zhihao Han, Yinan Shan, Ulrik Brandes, Sebastian Schemm, Ce Zhang:
GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks. CoRR abs/2206.09677 (2022) - [i11]Eren Cakmak, Johannes Fuchs, Dominik Jäckle, Tobias Schreck, Ulrik Brandes, Daniel A. Keim:
Motif-Based Visual Analysis of Dynamic Networks. CoRR abs/2208.11932 (2022) - 2021
- [c92]Meher Chaitanya, Ulrik Brandes:
Hardness Results for Seeding Complex Contagion with Neighborhoods. COMPLEX NETWORKS 2021: 207-216 - [c91]Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle:
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT 2021: 287-300 - [i10]Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle:
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR abs/2105.12093 (2021) - 2020
- [c90]Rouzbeh Hasheminezhad, Moses Boudourides, Ulrik Brandes:
Scale-free networks need not be fragile. ASONAM 2020: 332-339 - [c89]Ulrik Brandes:
Central Positions in Social Networks. CSR 2020: 30-45 - [c88]Katharina Börsig, Ulrik Brandes, Barna Pásztor:
Stochastic Gradient Descent Works Really Well for Stress Minimization. GD 2020: 18-25 - [i9]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i8]Ulrik Brandes, Julian Walter, Johannes Zink:
Erratum: Fast and Simple Horizontal Coordinate Assignment. CoRR abs/2008.01252 (2020) - [i7]Katharina Börsig, Ulrik Brandes, Barna Pásztor:
Stochastic Gradient Descent Works Really Well for Stress Minimization. CoRR abs/2008.10376 (2020)
2010 – 2019
- 2019
- [j62]Juri Buchmüller, Dominik Jäckle, Eren Cakmak, Ulrik Brandes, Daniel A. Keim:
MotionRugs: Visualizing Collective Trends in Space and Time. IEEE Trans. Vis. Comput. Graph. 25(1): 76-86 (2019) - [c87]Julian Müller, Ulrik Brandes:
The evolution of roles. ASONAM 2019: 406-413 - [p6]Carla Binucci, Ulrik Brandes, Tim Dwyer, Martin Gronemann, Reinhard von Hanxleden, Marc J. van Kreveld, Petra Mutzel, Marcus Schaefer, Falk Schreiber, Bettina Speckmann:
10 Reasons to Get Interested in Graph Drawing. Computing and Software Science 2019: 85-104 - 2018
- [j61]Michael Behrisch, Michael Blumenschein, Nam Wook Kim, Lin Shao, Mennatallah El-Assady, Johannes Fuchs, Daniel Seebacher, Alexandra Diehl, Ulrik Brandes, Hanspeter Pfister, Tobias Schreck, Daniel Weiskopf, Daniel A. Keim:
Quality Metrics for Information Visualization. Comput. Graph. Forum 37(3): 625-662 (2018) - [c86]David Schoch, Ulrik Brandes:
Social Stratification from Networks of Leveling Ties. COMPLEX NETWORKS (2) 2018: 447-459 - [e7]Ulrik Brandes, Chandan Reddy, Andrea Tagarelli:
IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018, Barcelona, Spain, August 28-31, 2018. IEEE Computer Society 2018, ISBN 978-1-5386-6051-5 [contents] - 2017
- [j60]Mark Ortmann, Ulrik Brandes:
Efficient orbit-aware triad and quad census in directed and undirected graphs. Appl. Netw. Sci. 2: 13 (2017) - [j59]Mereke van Garderen, Barbara Pampel, Arlind Nocaj, Ulrik Brandes:
Minimum-Displacement Overlap Removal for Geo-referenced Data Visualization. Comput. Graph. Forum 36(3): 423-433 (2017) - [j58]Tom Brughmans, Ulrik Brandes:
Visibility Network Patterns and Methods for Studying Visual Relational Phenomena in Archeology. Frontiers Digit. Humanit. 4: 17 (2017) - [j57]Mark Ortmann, Mirza Klimenta, Ulrik Brandes:
A Sparse Stress Model. J. Graph Algorithms Appl. 21(5): 791-821 (2017) - [j56]David Schoch, Thomas W. Valente, Ulrik Brandes:
Correlations among centrality indices and a class of uniquely ranked graphs. Soc. Networks 50: 46-54 (2017) - [j55]Christoph Schulz, Arlind Nocaj, Jochen Görtler, Oliver Deussen, Ulrik Brandes, Daniel Weiskopf:
Probabilistic Graph Layout for Uncertain Network Visualization. IEEE Trans. Vis. Comput. Graph. 23(1): 531-540 (2017) - [c85]Ulrik Brandes, Moritz Heine, Julian Müller, Mark Ortmann:
Positional Dominance: Concepts and Algorithms. CALDAM 2017: 60-71 - 2016
- [j54]Ulrik Brandes, Stephen P. Borgatti, Linton C. Freeman:
Maintaining the duality of closeness and betweenness centrality. Soc. Networks 44: 153-159 (2016) - [j53]Mehwish Nasim, Raphaël Charbey, Christophe Prieur, Ulrik Brandes:
Investigating Link Inference in Partially Observable Networks: Friendship Ties and Interaction. IEEE Trans. Comput. Soc. Syst. 3(3): 113-119 (2016) - [j52]Arlind Nocaj, Mark Ortmann, Ulrik Brandes:
Adaptive Disentanglement Based on Local Clustering in Small-World Network Visualization. IEEE Trans. Vis. Comput. Graph. 22(6): 1662-1671 (2016) - [c84]Christoph Schulz, Arlind Nocaj, Mennatallah El-Assady, Steffen Frey, Marcel Hlawatsch, Michael Hund, Grzegorz Karol Karch, Rudolf Netzel, Christin Schätzle, Miriam Butt, Daniel A. Keim, Thomas Ertl, Ulrik Brandes, Daniel Weiskopf:
Generative Data Models for Validation and Evaluation of Visualization Techniques. BELIV 2016: 112-124 - [c83]Ulrik Brandes, Eugenia Holm, Andreas Karrenbauer:
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. COCOA 2016: 175-186 - [c82]Mark Ortmann, Mirza Klimenta, Ulrik Brandes:
A Sparse Stress Model. GD 2016: 18-32 - [c81]Mark Ortmann, Ulrik Brandes:
Quad Census Computation: Simple, Efficient, and Orbit-Aware. NetSci-X 2016: 1-13 - [e6]Adam Wierzbicki, Ulrik Brandes, Frank Schweitzer, Dino Pedreschi:
Advances in Network Science - 12th International Conference and School, NetSci-X 2016, Wroclaw, Poland, January 11-13, 2016, Proceedings. Lecture Notes in Computer Science 9564, Springer 2016, ISBN 978-3-319-28360-9 [contents] - [r4]Ulrik Brandes:
Force-Directed Graph Drawing. Encyclopedia of Algorithms 2016: 768-773 - [i6]Mark Ortmann, Mirza Klimenta, Ulrik Brandes:
A Sparse Stress Model. CoRR abs/1608.08909 (2016) - 2015
- [j51]Rami Puzis, Yuval Elovici, Polina Zilberman, Shlomi Dolev, Ulrik Brandes:
Topology manipulations for speeding betweenness centrality computation. J. Complex Networks 3(1): 84-112 (2015) - [j50]Arlind Nocaj, Mark Ortmann, Ulrik Brandes:
Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks. J. Graph Algorithms Appl. 19(2): 595-618 (2015) - [j49]Ulrik Brandes, Hans Hagen, Shigeo Takahashi, Xiaoru Yuan:
Guest Editors' Introduction: Special Section on the IEEE Pacific Visualization Symposium 2014. IEEE Trans. Vis. Comput. Graph. 21(8): 887-888 (2015) - [c80]Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. ESA 2015: 251-262 - [e5]Ulrik Brandes, David Eppstein:
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015. SIAM 2015, ISBN 978-1-61197-375-4 [contents] - [i5]Ulrik Brandes, Michael Hamann, Ben Strasser, Dorothea Wagner:
Fast Quasi-Threshold Editing. CoRR abs/1504.07379 (2015) - [i4]Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron J. Quigley:
Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). Dagstuhl Reports 5(1): 243-258 (2015) - 2014
- [j48]Ulrik Brandes, Jan Hildenbrand:
Smallest graphs with distinct singleton centers. Netw. Sci. 2(3): 416-418 (2014) - [c79]Mark Ortmann, Ulrik Brandes:
Triangle Listing Algorithms: Back from the Diversion. ALENEX 2014: 1-8 - [c78]Ulrik Brandes:
Visualization for Visual Analytics: Micro-visualization, Abstraction, and Physical Appeal. PacificVis 2014: 352-353 - [c77]Arlind Nocaj, Mark Ortmann, Ulrik Brandes:
Untangling Hairballs - From 3 to 14 Degrees of Separation. GD 2014: 101-112 - [e4]Issei Fujishiro, Ulrik Brandes, Hans Hagen, Shigeo Takahashi:
IEEE Pacific Visualization Symposium, PacificVis 2014, Yokohama, Japan, March 4-7, 2014. IEEE Computer Society 2014, ISBN 978-1-4799-2873-6 [contents] - 2013
- [j47]Ulrik Brandes, Bobo Nick, Brigitte Rockstroh, Astrid Steffen:
Gestaltlines. Comput. Graph. Forum 32(3): 171-180 (2013) - [j46]Ulrik Brandes, Barbara Pampel:
Orthogonal-Ordering Constraints are Tough. J. Graph Algorithms Appl. 17(1): 1-10 (2013) - [j45]Ulrik Brandes, Garry Robins, Ann McCranie, Stanley Wasserman:
What is network science? Netw. Sci. 1(1): 1-15 (2013) - [j44]Natalie Indlekofer, Ulrik Brandes:
Relative importance of effects in stochastic actor-oriented models. Netw. Sci. 1(3): 278-304 (2013) - [c76]Bobo Nick, Conrad Lee, Pádraig Cunningham, Ulrik Brandes:
Simmelian backbones: amplifying hidden homophily in Facebook networks. ASONAM 2013: 525-532 - [c75]Arlind Nocaj, Ulrik Brandes:
Stub Bundling and Confluent Spirals for Geographic Networks. GD 2013: 388-399 - [c74]Conrad Lee, Bobo Nick, Ulrik Brandes, Pádraig Cunningham:
Link prediction with social vector clocks. KDD 2013: 784-792 - [r3]Ulrik Brandes, Markus Eiglsperger, Jürgen Lerner, Christian Pich:
Graph Markup Language (GraphML). Handbook of Graph Drawing and Visualization 2013: 517-541 - [r2]Christian Bachmaier, Ulrik Brandes, Falk Schreiber:
Biological Networks. Handbook of Graph Drawing and Visualization 2013: 621-651 - [r1]Ulrik Brandes, Linton C. Freeman, Dorothea Wagner:
Social Networks. Handbook of Graph Drawing and Visualization 2013: 805-839 - [i3]Conrad Lee, Bobo Nick, Ulrik Brandes, Pádraig Cunningham:
Link Prediction with Social Vector Clocks. CoRR abs/1304.4058 (2013) - 2012
- [b2]Marina Hennig, Ulrik Brandes, Jürgen Pfeffer, Ines Mergel:
Studying Social Networks - A Guide to Empirical Research. Campus-Verlag 2012, ISBN 978-3-593-39763-4, pp. 1-218 - [j43]Arlind Nocaj, Ulrik Brandes:
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent. Comput. Graph. Forum 31(3pt1): 855-864 (2012) - [j42]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - [j41]Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Path-based supports for hypergraphs. J. Discrete Algorithms 14: 248-261 (2012) - [j40]Ulrik Brandes, Sabine Cornelsen:
Guest Editor's Foreword. J. Graph Algorithms Appl. 16(1): 3-4 (2012) - [j39]Ulrik Brandes, Natalie Indlekofer, Martin Mader:
Visualization methods for longitudinal social networks and stochastic actor-oriented modeling. Soc. Networks 34(3): 291-308 (2012) - [j38]Michael Zinsmaier, Ulrik Brandes, Oliver Deussen, Hendrik Strobelt:
Interactive Level-of-Detail Rendering of Large Graphs. IEEE Trans. Vis. Comput. Graph. 18(12): 2486-2495 (2012) - [j37]Arlind Nocaj, Ulrik Brandes:
Organizing Search Results with a Reference Map. IEEE Trans. Vis. Comput. Graph. 18(12): 2546-2555 (2012) - [c73]Mirza Klimenta, Ulrik Brandes:
Graph Drawing by Classical Multidimensional Scaling: New Perspectives. GD 2012: 55-66 - [c72]Rami Puzis, Polina Zilberman, Yuval Elovici, Shlomi Dolev, Ulrik Brandes:
Heuristics for Speeding Up Betweenness Centrality Computation. SocialCom/PASSAT 2012: 302-311 - 2011
- [j36]Ulrik Brandes, Jürgen Lerner, Uwe Nagel:
Network ensemble clustering using latent roles. Adv. Data Anal. Classif. 5(2): 81-94 (2011) - [j35]Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, 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 and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j34]Melanie Badent, Ulrik Brandes, Sabine Cornelsen:
More Canonical Ordering. J. Graph Algorithms Appl. 15(1): 97-126 (2011) - [j33]Ulrik Brandes, Christian Pich:
More Flexible Radial Layout. J. Graph Algorithms Appl. 15(1): 157-173 (2011) - [j32]Ulrik Brandes, Christian Pich:
Explorative Visualization of Citation Patterns in Social Network Research. J. Soc. Struct. 12(1) (2011) - [j31]Ulrik Brandes, Bobo Nick:
Asymmetric Relations in Longitudinal Social Networks. IEEE Trans. Vis. Comput. Graph. 17(12): 2283-2290 (2011) - [c71]Ulrik Brandes:
Keynote address: Why everyone seems to be using spring embedders for network visualization, and should not. PacificVis 2011 - [c70]Ulrik Brandes, Martin Mader:
A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing. GD 2011: 99-110 - [c69]Ulrik Brandes, Jürgen Lerner, Bobo Nick, Steffen Rendle:
Network effects on interest rates in online social lending. GI-Jahrestagung 2011: 429 - [p5]Ulrik Brandes, Gabi Dorfmüller:
PageRank - What Is Really Relevant in the World-Wide Web? Algorithms Unplugged 2011: 89-96 - [e3]Ulrik Brandes, Sabine Cornelsen:
Graph Drawing - 18th International Symposium, GD 2010, Konstanz, Germany, September 21-24, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6502, Springer 2011, ISBN 978-3-642-18468-0 [contents] - 2010
- [j30]Ulrik Brandes, Jürgen Lerner:
Structural Similarity: Spectral Methods for Relaxed Blockmodeling. J. Classif. 27(3): 279-306 (2010) - [j29]Ulrik Brandes, Jürgen Lerner, Miranda J. Lubbers, Christopher McCarthy, José Luis Molina, Uwe Nagel:
Understanding the Composition of an Ensemble of Personal Networks. J. Soc. Struct. 11(1) (2010) - [j28]Miranda J. Lubbers, José Luis Molina, Jürgen Lerner, Ulrik Brandes, Javier Ávila, Christopher McCarty:
Longitudinal analysis of personal networks. The case of Argentinean migrants in Spain. Soc. Networks 32(1): 91-104 (2010) - [c68]Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Path-Based Supports for Hypergraphs. IWOCA 2010: 20-33 - [c67]Ulrik Brandes, Sabine Cornelsen, Barbara Pampel, Arnaud Sallaberry:
Blocks of Hypergraphs - Applied to Hypergraphs and Outerplanarity. IWOCA 2010: 201-211 - [p4]Ulrik Brandes:
Graphentheorie. Handbuch Netzwerkforschung 2010: 345-353
2000 – 2009
- 2009
- [j27]Ulrik Brandes, Sabine Cornelsen:
Phylogenetic graph models beyond trees. Discret. Appl. Math. 157(10): 2361-2369 (2009) - [j26]Ulrik Brandes, Daniel Fleischer:
Vertex Bisection is Hard, too. J. Graph Algorithms Appl. 13(2): 119-131 (2009) - [c66]Ulrik Brandes, Jürgen Lerner, Tom A. B. Snijders:
Networks Evolving Step by Step: Statistical Analysis of Dyadic Event Data. ASONAM 2009: 200-205 - [c65]Michael R. Berthold, Ulrik Brandes, Tobias Kötter, Martin Mader, Uwe Nagel, Kilian Thiel:
Pure spreading activation is pointless. CIKM 2009: 1915-1918 - [c64]Ulrik Brandes, Jürgen Lerner, Uwe Nagel, Bobo Nick:
Structural Trends in Network Ensembles. CompleNet 2009: 83-97 - [c63]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 - [c62]Ulrik Brandes, Christian Pich:
More Flexible Radial Layout. GD 2009: 107-118 - [c61]Melanie Badent, Michael Baur, Ulrik Brandes, Sabine Cornelsen:
Leftist Canonical Ordering. GD 2009: 159-170 - [c60]Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig:
Drawing Trees in a Streaming Model. GD 2009: 292-303 - [c59]Sonja Öttl, Fredrik Gundelsweiler, Harald Reiterer, Ulrik Brandes:
Visualisierungs- und Interaktionsdesign für multivariate, zeitbezogene Daten in sozialen Netzwerken. ISI 2009: 207-220 - [c58]Steffen Bogen, Ulrik Brandes, Hendrik Ziezold:
Visual Navigation with Schematic Maps. VINCI 2009: 65-84 - [c57]Ulrik Brandes, Patrick Kenis, Jürgen Lerner, Denise van Raaij:
Network analysis of collaboration structure in Wikipedia. WWW 2009: 731-740 - 2008
- [j25]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) - [j24]Ulrik Brandes, Jürgen Lerner:
Visual analysis of controversy in user-generated encyclopedias. Inf. Vis. 7(1): 34-48 (2008) - [j23]Ulrik Brandes:
On variants of shortest-path betweenness centrality and their generic computation. Soc. Networks 30(2): 136-145 (2008) - [j22]Ulrik Brandes:
Social network analysis and visualization [Applications Corner]. IEEE Signal Process. Mag. 25(6): 147-151 (2008) - [j21]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) - [c56]Ulrik Brandes, Jürgen Lerner, Miranda J. Lubbers, Christopher McCarty, José Luis Molina:
Visual Statistics for Collections of Clustered Graphs. PacificVis 2008: 47-54 - [c55]Joachim Böttger, Ulrik Brandes, Oliver Deussen, Hendrik Ziezold:
Map Warping for the Annotation of Metro Maps. PacificVis 2008: 199-206 - [c54]Ulrik Brandes, Christian Pich:
An Experimental Study on Distance-Based Graph Drawing. GD 2008: 218-229 - [c53]Ulrik Brandes, Barbara Pampel:
On the Hardness of Orthogonal-Order Preserving Graph Drawing. GD 2008: 266-277 - [c52]Ulrik Brandes, Martin Hoefer, Bobo Nick:
Network Creation Games with Disconnected Equilibria. WINE 2008: 394-401 - [p3]Ulrik Brandes, Gabi Dorfmüller:
PageRank: Was ist wichtig im World Wide Web?. Taschenbuch der Algorithmen 2008: 95-101 - [i2]Stephen P. Borgatti, Ulrik Brandes, Michael Kaufmann, Stephen G. Kobourov, Anna Lubiw, Dorothea Wagner:
08191 Working Group Report - Visualization of Trajectories. Graph Drawing with Applications to Bioinformatics and Social Sciences 2008 - [i1]Ulrik Brandes, Martin Hoefer, Bobo Nick:
Network Connection Games with Disconnected Equilibria. CoRR abs/0805.4323 (2008) - 2007
- [j20]Ulrik Brandes, Christian Pich:
Centrality Estimation in Large Networks. Int. J. Bifurc. Chaos 17(7): 2303-2318 (2007) - [j19]Ulrik Brandes:
Optimal leaf ordering of complete binary trees. J. Discrete Algorithms 5(3): 546-552 (2007) - [j18]Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Engineering graph clustering: Models and experimental evaluation. ACM J. Exp. Algorithmics 12: 1.1:1-1.1:26 (2007) - [j17]Ulrik Brandes, Daniel Fleischer, Thomas Puppe:
Dynamic Spectral Layout with an Application to Small Worlds. J. Graph Algorithms Appl. 11(2): 325-343 (2007) - [c51]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 - [c50]Michael Baur, Ulrik Brandes:
Multi-circular Layout of Micro/Macro Graphs. GD 2007: 255-267 - [c49]Krists Boitmanis, Ulrik Brandes, Christian Pich:
Visualizing Internet Evolution on the Autonomous Systems Level. GD 2007: 365-376 - [c48]Ulrik Brandes, Jürgen Lerner:
Visual Analysis of Controversy in User-generated Encyclopedias. IEEE VAST 2007: 179-186 - [c47]Ulrik Brandes, Daniel Fleischer:
Geographic Routing on Improved Coordinates. IV 2007: 263-270 - [c46]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 - 2006
- [j16]Ulrik Brandes, Daniel Fleischer, Jürgen Lerner:
Summarizing Dynamic Bipolar Conflict Structures. IEEE Trans. Vis. Comput. Graph. 12(6): 1486-1499 (2006) - [c45]Ulrik Brandes, Christian Pich:
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. GD 2006: 42-53 - [c44]Ulrik Brandes, Barbara Schlieper:
Angle and Distance Constraints on Tree Drawings. GD 2006: 54-65 - [c43]Ulrik Brandes, Jürgen Lerner:
Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities. MFCS 2006: 202-213 - [c42]Ulrik Brandes, Martin Hoefer, Jürgen Lerner:
WordSpace: visual summary of text corpora. Visualization and Data Analysis 2006: 60600N - [c41]Ulrik Brandes, Martin Hoefer, Christian Pich:
Affiliation Dynamics with an Application to Movie-Actor Biographies. EuroVis 2006: 179-186 - 2005
- [j15]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) - [c40]Ulrik Brandes, Daniel Fleischer, Thomas Puppe:
Dynamic Spectral Layout of Small Worlds. GD 2005: 25-36 - [c39]Ulrik Brandes, Daniel Fleischer, Jürgen Lerner:
Highlighting Conflict Dynamics in Event Data. INFOVIS 2005: 103-110 - [c38]Christian Bachmaier, Ulrik Brandes, Barbara Schlieper:
Drawing Phylogenetic Trees. ISAAC 2005: 1110-1121 - [c37]Ulrik Brandes, Daniel Fleischer:
Centrality Measures Based on Current Flow. STACS 2005: 533-544 - [e2]Ulrik Brandes, Thomas Erlebach:
Network Analysis: Methodological Foundations [outcome of a Dagstuhl seminar, 13-16 April 2004]. Lecture Notes in Computer Science 3418, Springer 2005, ISBN 3-540-24979-6 [contents] - 2004
- [j14]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) - [j13]Ulrik Brandes, Dorothea Wagner:
Netzwerkvisualisierung. it Inf. Technol. 46(3): 129-134 (2004) - [j12]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) - [j11]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Generating node coordinates for shortest-path computations in transportation networks. ACM J. Exp. Algorithmics 9 (2004) - [j10]Ulrik Brandes, Tim Dwyer, Falk Schreiber:
Visual Understanding of Metabolic Pathways Across Organisms Using Layout in Two and a Half Dimensions. J. Integr. Bioinform. 1(1) (2004) - [c36]Ulrik Brandes, Thomas Erlebach:
Introduction. Network Analysis 2004: 1-6 - [c35]Ulrik Brandes, Thomas Erlebach:
Fundamentals. Network Analysis 2004: 7-15 - [c34]Michael Baur, Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Drawing the AS Graph in 2.5 Dimensions. GD 2004: 43-48 - [c33]Ulrik Brandes, Christian Pich:
GraphML Transformation. GD 2004: 89-99 - [c32]Ulrik Brandes, Jürgen Lerner:
Structural Similarity in Graphs (A Relaxation Approach for Role Assignment). ISAAC 2004: 184-195 - [c31]Ulrik Brandes, Tim Dwyer, Falk Schreiber:
Visual Triangulation of Network-Based Phylogenetic Trees. VisSym 2004: 75-83 - [c30]Michael Baur, Ulrik Brandes:
Crossing Reduction in Circular Layouts. WG 2004: 332-343 - [c29]Ulrik Brandes, Jürgen Lerner, Christian Pich:
GXL to GraphML and Vice Versa with XSLT. GraBaTs 2004: 113-125 - [p2]Ulrik Brandes, Dorothea Wagner:
Analysis and Visualization of Social Networks. Graph Drawing Software 2004: 321-340 - 2003
- [j9]Ulrik Brandes, Steven R. Corman:
Visual unrolling of network evolution and the analysis of dynamic discourse? Inf. Vis. 2(1): 40-50 (2003) - [j8]Ulrik Brandes, Sabine Cornelsen:
Visual Ranking of Link Structures. J. Graph Algorithms Appl. 7(2): 181-201 (2003) - [j7]Ulrik Brandes, Patrick Kenis, Dorothea Wagner:
Communicating Centrality in Policy Network Drawings. IEEE Trans. Vis. Comput. Graph. 9(2): 241-253 (2003) - [c28]Ulrik Brandes, Marco Gaertler, Dorothea Wagner:
Experiments on Graph Clustering Algorithms. ESA 2003: 568-579 - [c27]Ulrik Brandes, Tim Dwyer, Falk Schreiber:
Visualizing Related Metabolic Pathways in Two and a Half Dimensions. GD 2003: 111-122 - [c26]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles. GD 2003: 357-368 - [c25]Franz-Josef Brandenburg, Ulrik Brandes, Peter Eades, Joe Marks:
Graph Drawing Contest Report. GD 2003: 504-508 - 2002
- [c24]Ulrik Brandes:
Eager st-Ordering. ESA 2002: 247-256 - [c23]Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner:
Sketch-Driven Orthogonal Graph Drawing. GD 2002: 1-11 - [c22]Ulrik Brandes, Steven R. Corman:
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse. INFOVIS 2002: 145-151 - [c21]Ulrik Brandes, Thomas Willhalm:
Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor. VisSym 2002: 159-164 - 2001
- [j6]Ulrik Brandes, Jörg Raab, Dorothea Wagner:
Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections. J. Soc. Struct. 2 (2001) - [c20]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Travel Planning with Self-Made Maps. ALENEX 2001: 132-144 - [c19]Ulrik Brandes, Boris Köpf:
Fast and Simple Horizontal Coordinate Assignment. GD 2001: 31-44 - [c18]Michael Baur, Marc Benkert, Ulrik Brandes, Sabine Cornelsen, Marco Gaertler, Boris Köpf, Jürgen Lerner, Dorothea Wagner:
Visone. GD 2001: 463-464 - [c17]Ulrik Brandes, Markus Eiglsperger, Ivan Herman, Michael Himsolt, M. Scott Marshall:
GraphML Progress Report. GD 2001: 501-512 - [c16]Ulrik Brandes, Sabine Cornelsen:
Visual Ranking of Link Structures. WADS 2001: 222-233 - 2000
- [j5]Ulrik Brandes, Dorothea Wagner:
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. Algorithmica 28(1): 16-36 (2000) - [j4]Ulrik Brandes, Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data. J. Graph Algorithms Appl. 4(3): 135-155 (2000) - [j3]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) - [c15]Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner:
How to Draw the Minimum Cuts of a Planar Graph (Extended Abstract). GD 2000: 103-114 - [c14]Ulrik Brandes, Galina Shubina, Roberto Tamassia, Dorothea Wagner:
Fast Layout Methods for Timetable Graphs. GD 2000: 127-138 - [c13]Ulrik Brandes, M. Scott Marshall, Stephen C. North:
Graph Data Format Workshop Report. GD 2000: 407-409 - [c12]Franz-Josef Brandenburg, Ulrik Brandes, Michael Himsolt, Marcus Raitner:
Graph-Drawing Contest Report. GD 2000: 410-418 - [c11]Ulrik Brandes, Dorothea Wagner:
Contextual Visualization of Actor Status in Social Networks. VisSym 2000: 13-22 - [c10]Ulrik Brandes, Galina Shubina, Roberto Tamassia:
Improving Angular Resolution in Visualizations of Geographic Networks. VisSym 2000: 23-32 - [e1]Ulrik Brandes, Dorothea Wagner:
Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings. Lecture Notes in Computer Science 1928, Springer 2000, ISBN 3-540-41183-6 [contents]
1990 – 1999
- 1999
- [b1]Ulrik Brandes:
Layout of graph visualizations. University of Konstanz, Germany, 1999, pp. 1-156 - [j2]Ulrik Brandes, Wolfram Schlickenrieder, Gabriele Neyer, Dorothea Wagner, Karsten Weihe:
A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks. Discret. Appl. Math. 92(2-3): 91-110 (1999) - [c9]Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm:
Empirical Design of Geometric Algorithms. SCG 1999: 86-94 - [c8]Ulrik Brandes:
Drawing on Physical Analogies. Drawing Graphs 1999: 71-86 - [c7]Ulrik Brandes, Patrick Kenis, Dorothea Wagner:
Centrality in Policy Network Drawings. GD 1999: 250-258 - [c6]Ulrik Brandes:
Hunting Down Graph B. GD 1999: 410-415 - [p1]Ulrik Brandes, Dorothea Wagner:
Über das Zeichnen von Graphen. Angewandte Mathematik, insbesondere Informatik 1999: 58-81 - 1998
- [j1]Ulrik Brandes, Dagmar Handke:
NP-Completeness Results for Minimum Planar Spanners. Discret. Math. Theor. Comput. Sci. 3(1): 1-10 (1998) - [c5]Ulrik Brandes, Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data. GD 1998: 44-56 - [c4]Ulrik Brandes, Dorothea Wagner:
Dynamic Grid Embedding with Few Bends and Changes. ISAAC 1998: 89-98 - 1997
- [c3]Ulrik Brandes, Dorothea Wagner:
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract). ESA 1997: 64-77 - [c2]Ulrik Brandes, Dorothea Wagner:
A Bayesian Paradigm for Dynamic Graph Layout. GD 1997: 236-247 - [c1]Ulrik Brandes, Dagmar Handke:
NP-Completness Results for Minimum Planar Spanners. WG 1997: 85-99
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
