Bernhard Haeupler

Haeupler

Address

MIT Computer Science and Artificial Intelligence Lab
32-G694, Stata Center
32 Vassar Street
Cambridge, MA 02139
USA

email: haeupler at mit.edu
tel: (617) 253-7583

Map showing building location.

Bernhard Haeupler

Beginning August 2008, I will be a PhD student in the MIT CSAIL Theory Group Computer Science Department.

This year I am a visiting graduate student at the Theory Group of Princeton's Computer Science Department. I'm working with Robert E. Tarjan.

I studied in Germany at the Technical University Munich in the diploma program for Computer Science and the diploma program for Mathematics.
In October 2007, after only three years instead of the regular five to six, I completed the mathematics diploma summa cum laude (GPA: 4.00).

I am a fellow of the elite graduate program TopMath in Applied Mathematics. I am supervised by Ernst W. Mayr.
In 2007 I completed the TopMath elite Bachelor of Science and won the "Best Study Award" for my independent studies.

Research Interests

I'm interested in theoretical computer science, particulary the design and analysis of algorithms for combinatorial problems.

CV (PDF)

Selected Talks

  • An O(n log n) algorithm for maximum st-flow in a directed planar graph
    COS521, Princeton University, 2007

  • Maximum flows in planar networks
    TopMath Independent Studies Colloquium, 2007

  • Introduction to Information Theory
    TUM Theory Tea, 2007

  • Evolution of random graphs: Inside the phase transition
    Extremal Graph Theory Seminar, 2006

  • Zero-One-Laws
    Extremal Graph Theory Seminar, 2006

  • Goodstein Sequences and the Independence of Goodstein's Theorem
    TopMath Admission Colloquium, 2006

  • Introduction to computational complexity
    Joint Advanced Student School, St. Petersburg (Russia), 2006

  • MST and Matroids
    Algorithmic Graph Theory Seminar, 2005

  • Ranking aggregation methods for the web
    TUM Summer School, Sarentino (Italy), 2005

  • Randomized Primality Testing
    Gems of Theoretical Computer Science Seminar, 2005

Publications

  • Faster Algorithms for Incremental Topological Ordering
    with Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen and Robert E. Tarjan, accepted to ICALP 2008, April 2008
    to appear in Lecture Notes in Computer Science Series, Springer-Verlag

  • Incremental Topological Ordering and Strong Component Maintenance
    with Siddhartha Sen and Robert E. Tarjan, February 2008
    released under arXiv:0803.0792v1 [cs.DS]

  • Planarity Algorithms via PQ-trees
    with Robert E. Tarjan, accepted to Topological & Geometric Graph Theory International Conference 2008, January 2008
    to appear in Electronic Notes in Discrete Mathematics, Elsevier

  • Finding a Feasible Flow in a Strongly Connected Network
    with Robert E. Tarjan, December 2007
    to appear in Operations Research Letters, Elsevier

  • Maximum flows in planar networks
    diploma thesis, supervised by Ernst W. Mayr, December 2007