Prof. Dr. Ro­bert El­säs­ser

Main research interests:

• Parallel and distributed algorithms
• Structure and spectra of graphs and networks
• Discrete optimization problems in graphs
  
  Publications (see also google scholar or DBLP)

Recent Teaching Activities:

• SS 2009:
  Datenstrukturen und Algorithmen
  
  
• WS 2009/10:
  Algorithmentheorie
  
  
• SS 2010:
  Theory I
  
  
• WS 2010/11:
  Graphenalgorithmen
  
  
• SS 2011:
  Randomized Algorithms
  
  
• WS 2011/12:
  Graph Algorithms
  

Membership in Program Committees (2009-2012):

• HPCS 2009
  
• I-SPAN 2009
  
• SIROCCO 2010
  
• HPCS 2011
  
• IPDPS 2011, PhD-Forum
  
• STACS 2012
  

Short Vita:

Robert Elsässer graduated as "Diplom-Informatiker" in 1998 at the University of Paderborn, Germany. In 2002 he obtaind a PhD in Computer Science at the same university, and was appointed to Junior Professor at the Institute for Computer Science of the University of Paderborn. For his PhD Thesis, he received the faculty award for an excellent dissertation. From April 2005 to March 2006, Robert Elsässer visited the Department of Mathematics at the University of California, San Diego, USA. In September 2007, he was a visiting professor at INRIA-Futurs, Bordeaux, and from October 2009 to September 2010 he headed the Chair of Algorithms and Complexity at the University of Freiburg as a visiting professor. The main research interests of Robert Elsässer include parallel and distributed algorithms, as well as the structure and spectra of graphs and networks. He served as member in the program committee of several international conferences, and as a referee for the German Research Foundation (DFG), the German Academic Exchange Service (DAAD), the German National Academic Foundation - Studienstiftung, as well as for numerous international conferences and journals.

In February/March 2012, Robert Elsässer has been offered professorships at the University of Hamburg and the University of Salzburg, respectively.