Seminar by Anand Srivastav
Randomized Approximation of b-Matching in Hypergraphs
Anand Srivastav
Kiel University, Germany
Date: Thursday, September 12th, 2013
Time: 3:30 PM
Venue: CS102.Abstract: Link
About the speaker:
Anand Srivastav got his doctoral degree in Mathematics (Functional Analysis) from the University of Muenster, Germany in 1988. From 1988--1993, he was a Postdoctoral fellow at the Research Institute for Discrete Mathematics at the University of Bonn. He completed his Habilitation in Computer Science at Humboldt University, Berlin 1996. Since 1997, he has been the Professor and Chair for Discrete Optimization at the University of Kiel, Germany. Since 2004, he has been the Director of the Computer Science Department at the University of Kiel. Since 2007 he has been the PI and Speaker of the Research Platforms in the DFG Cluster of Excellence "The Future Ocean". He has been a visiting Professor at Univ. of Minnesota, New York University, Yale University, Free University of Berlin, Humboldt University Berlin and Indo-MaxPlanck Guest Professor at IMPECS India.