[an error occurred while processing this directive]
Department of Computer & Information Science University of Konstanz
Algorithmics Group Members

A photo

Ulrik Brandes

address   Department of Computer & Information Science
University of Konstanz
Box 67
78457 Konstanz, Germany
personal
teaching
research
publications
Deutsche Version
phone +49 7531 / 88-4433
fax +49 7531 / 88-3577
email
web http://www.inf.uni-konstanz.de/~brandes/
office E 212 (show)
public hour wednesdays 12:00-13:00
topical visone  ·  GraphML  ·  INSNA

Network Analysis - Springer LNCS 3418

Modeling and Analysis of Novel Mechanisms in Future Internet Applications - Summer School (28 March-4 April, Würzburg)

ASONAM 2012 - Intl. Conf. Advances in Social Network Analysis and Mining (26-29 August, Istanbul)

ASNA 2012 - 9th Conf. Applications of Social Network Analysis (4-7 September, Zurich)

Digital Social Networks - 5th Satellite Workshop of INFORMATIK 2012 (19 September, Braunschweig)

GD 2012 - 20th Intl. Symp. Graph Drawing (19-21 September, Redmond)

 Personal
 
since 10/03   Professor, Department of Computer & Information Science, University of Konstanz
10/02-09/03 Associate Professor, Department of Mathematics & Computer Science, University of Passau
07/02 Habilitation in Computer Science
04/00-09/02 Assistant Professor, Department of Computer & Information Science, University of Konstanz
10/01-12/01 Postdoctoral research fellow, Department of Computer Science, University of Sydney (with Prof. Peter Eades)
07/99-12/99 Postdoctoral research fellow, Department of Computer Science, Brown University (with Prof. Roberto Tamassia)
06/99 Ph.D. in Computer Science. Thesis entitled Layout of Graph Visualizations; supervisor and reviewer: Prof. Dr. Dorothea Wagner, additional reviewer: Prof. Dr. Michael Kaufmann
10/94-03/00 Wissenschaftlicher Mitarbeiter/BAT IIa, Department of Computer & Information Science, University of Konstanz; (with Prof. Dr. Dorothea Wagner)
10/89-10/94 Studied computer science (with mathematics minor) at RWTH Aachen
  • thesis on Markov Random Fields as a Tool in Image Processing (in German) written at legendary Lehrstuhl für angewandte Mathematik, insbesondere Informatik, chaired by my advisor, Prof. Dr. Walter Oberschelp
  • spent the summer of 1992 as an exchange student at Michigan Technological University, Houghton, Michigan, USA.
to top

 Teaching
 
this semester  

on sabbatical

next semester

Graduate course Network Analysis
Seminar Ranking
Bachelor project Algorithmik
Master project Algorithmics
Doctoral seminar Algorithmics
to top

 Research
 
> Areas of interest include:
  • graph drawing and information visualization
  • efficient graph algorithms
  • social network analysis
  • algorithm engineering
  • combinatorial optimization
    •
    to top

     Publications
     
    > List of publications (access to electronic versions)
     
    > Five selected publications:

    Ulrik Brandes and Christian Pich, An Experimental Study on Distance-based Graph Drawing. Proc. 16th Intl. Symp. Graph Drawing (GD '08). LNCS 5417, pp. 218-229. Springer-Verlag 2009.

    Ulrik Brandes and Thomas Erlebach (Eds.): Network Analysis: Methodological Foundations. Lecture Notes in Computer Science Tutorial, vol. 3418. Springer-Verlag, 2005.

    Ulrik Brandes, Eager st-Ordering. Proc. 10th Europ. Symp. Algorithms (ESA '02). LNCS 2461, pp. 247-256. Springer 2002.

    Ulrik Brandes, A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2):163-177, 2001.

    Ulrik Brandes and Dorothea Wagner, A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs. Algorithmica 28(1):16-36, 2000.

    to top

    last modified  22 March 2012