[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 D 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

Network Analysis - Springer LNCS 3418

Social Network Visualization - Spring Meeting Network Analysis Group with GSA (1-2 May, Munich)

ARS'09 - 2nd Workshop Social Network Analysis (13-14 July, Salerno)

POLNET 2009 - 9th Intl. Summer School (30 August-4 September, Venice)

GD'09 - 17th Intl. Symp. Graph Drawing (22-25 September, Chicago)

 Personal
 
since 10/03   Full Professor ("C4"), Department of Computer & Information Science, University of Konstanz
10/02-09/03 Associate Professor ("C3"), Department of Mathematics & Computer Science, University of Passau
07/02 Habilitation in Computer Science
04/00-09/02 Assistant Professor ("C1"), 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
 
>   Courses are (mostly) in German:
dieses Semester  

Vorlesung Algorithmen und Datenstrukturen
Vorlesung Entwurf und Analyse von Algorithmen
Master-Projekt Algorithmik
Bachelor-Projekt Graphen & Algorithmen
Seminar zum Bachelor-Projekt Graphen & Algorithmen
Master-Projekt Visuelle Navigation
Doktorandenseminar Algorithmik
letztes Semester

Vorlesung Methoden der Netzwerkanalyse
Seminar Visuelle Navigation
Doktorandenseminar Algorithmik
Seminar Introduction to Social Network Analysis
Sommerschule POLNET

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 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, Using Graph Layout to Visualize Train Interconnection Data. Journal of Graph Algorithms and Applications 4(3):135-155, 2000.

    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  17 May 2009