Nicolai Hähnle

PhD Student

EPFL SB IMA
MA B1 533
Station 8
CH-1015 Lausanne

Phone: +41 21 693 2739
Fax: +41 21 693 5840
Email: [email protected]

I have completed my PhD and I am now a PostDoc in Bonn.

Biography

Teaching

  • Spring 2011: Computer Algebra (main assistant), semester project on the width of prismatoids
  • Fall 2010: Combinatorial Optimization (main assistant)
  • Spring 2010: Computer Algebra (main assistant)
  • Fall 2009: Mathematics of Machine Learning (main assistant), semester project on oriented matroid-based abstraction for the diameter of polytopes
  • Spring 2009: Optimization (main assistant), semester project on Gomory-Hu trees
  • Summer 2007: Datenstrukturen und Algorithmen (student assistant)
  • Winter 2006: Einführung in Berechenbarkeit, Komplexität und formale Sprachen (student assistant)

Publications

New Results in the Theory of Linear and Integer Programming

N. Hähnle / F. Eisenbrand (Dir.)  

Lausanne, EPFL, 2012. 

On sub-determinants and the diameter of polyhedra

N. Bonifas; M. Di Summa; F. Eisenbrand; N. Hähnle; M. Niemeier 

2012. 28th Symposium on Computational Geometry (SoCG 2012), Chapel Hill, North Carolina, USA, June 17-20, 2012.

Covering Cubes and the Closest Vector Problem

F. Eisenbrand; N. Hähnle; M. Niemeier 

2011. 27th Annual Symposium on Computational Geometry (SoCG 2011), Paris, France, June 13-15, 2011. p. 417-423. DOI : 10.1145/1998196.1998264.

Diameter of Polyhedra: Limits of Abstraction

F. Eisenbrand; N. Hähnle; A. Razborov; T. Rothvoss 

Mathematics of Operations Research. 2010. Vol. 35, num. 4, p. 786-794. DOI : 10.1287/moor.1100.0470.

Scheduling periodic tasks in a hard real-time environment

F. Eisenbrand; N. Hähnle; M. Niemeier; M. Skutella; J. Verschae et al. 

2010. 37th International Colloquium on Automata, Languages and Programming (ICALP2010), Bordeaux, France, July 5-10, 2010. p. 299-311. DOI : 10.1007/978-3-642-14165-2_26.

Testing additive integrality gaps

F. Eisenbrand; N. Hähnle; D. Pálvölgyi; G. Shmonin 

2010. 21st ACM-SIAM Symposium on Discrete Algorithms, Austin, Texas, January 17-19, 2010. p. 1227-1234. DOI : 10.1137/1.9781611973075.98.

Diameter of Polyhedra: Limits of Abstraction

F. Eisenbrand; N. Hähnle; T. Rothvoß 

2009. 25th Annual ACM Symposium on Computational Geometry (SoCG’09), Aarhus, Denmark, June 8-10, 2009. p. 386-392. DOI : 10.1145/1542362.1542428.

Other Writings

This is a more or less random collection of texts related to various topics in mathematics and computer science that I have written over the years. You may or may not find them useful; in any case, treat them as if they were full of mistakes, and please drop me an email if you find any.