Homepage

Julian Mestre Max-Planck-Institut für Informatik Department 1: Algorithms and Complexity Campus E 1 4, Room 309 Email: Get my email address via email Phone: +49 681 9325 109 Fax: +49 681 9325 199

My research deals with the design and analysis of efficient algorithms for combinatorial optimization problems such as:

• Approximation algorithms for covering, scheduling, and routing problems.
• Matchings under preferences: popular, stable and fair assignments.
• Algorithmic aspects of graph and matroid theory.

Current Activities

• Coordinator for the AG1 Noon Seminar.
• Recently taught: Optimization (Summer 2009).
• Recently taught: Approximation Algorithms at the University of Buenos Aires.
• PC member LATIN 2010
• Upcoming course: Optimization II (Winter 2009/10)

Education

• Ph. D. in Computer Science. University of Maryland, College Park, USA, July 2007.
  Thesis: Primal-Dual Algorithms for Combinatorial Optimization Problems
  Adviser: Prof. Samir Khuller
• M.S. in Computer Science. University of Maryland, College Park, USA, May 2004.
  
• B.S in Software Engeneering. Universidad Catolica Argentina, July 2001.

Copyright 2005 by Max-Planck-Institut Informatik | Impressum
page last modified Tuesday, 06 October 2009 - 02:13

• Julian Mestre:
• Homepage
• Publications
• Talks
• Teaching