Friedrich Eisenbrand
Full Professor
friedrich.eisenbrand@epfl.ch +41 21 693 25 60
EPFL SB MATH DISOPT
MA C1 553 (Bâtiment MA)
Station 8
CH-1015 Lausanne
Fields of expertise
Combinatorial Optimization, Algorithms and Complexity
Biography
Friedrich Eisenbrand's main research interests lie in the field of discrete optimization, in particular in algorithms and complexity, integer programming, geometry of numbers, and applied optimization. He is best known for his work on efficient algorithms for integer programming in fixed dimension and the theory of cutting planes, which are an important tool to solve large scale industrial optimization problems in practice.
Before joining EPFL in March 2008, Friedrich Eisenbrand was a full professor of mathematics at the University of Paderborn. Friedrich received the Heinz Maier-Leibnitz award of the German Research Foundation (DFG) in 2004 and the Otto Hahn medal of the Max Planck Society in 2001.
Current work
Algorithms and complexity for Real Time Scheduling
Mixed integer programming over TU systems
Complexity of variants of Diophantine Approximation
Combinatorial Geometry
Friedrich Eisenbrand's research is supported by the Swiss National Science Foundation (SNSF) and the German Research Foundation (DFG) within the priority programme 1307 Algorithm Engineering
Infoscience publications
F. Eisenbrand; G. Shmonin : Parametric integer programming in fixed dimension; Mathematics of Operations Research. 2008. DOI : 10.1287/moor.1080.0320.
F. Eisenbrand; G. Oriolo; G. Stauffer; P. Ventura : The stable set polytope of quasi-line graphs; Combinatorica. 2008. DOI : 10.1007/s00493-008-2244-x.
F. Eisenbrand; T. Rothvoß : A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. 2008. Automata, Languages and Programming, 35th International Colloquium (ICALP 2008), Reykjavik, Iceland, July 7-11, 2008.
F. Eisenbrand; F. Grandoni; G. Oriolo; M. Skutella : New approaches for virtual private network design; SIAM Journal on Computing. 2007. DOI : 10.1137/060654827.
F. Eisenbrand; A. Karrenbauer; C. Xu : Algorithms for longer OLED lifetime. 2007. p. 338-351.
F. Eisenbrand; S. Laue : A linear algorithm for integer programming in the plane; Mathematical Programming. 2005. DOI : 10.1007/s10107-004-0520-0.
Infoscience
F. Eisenbrand; G. Shmonin : Parametric integer programming in fixed dimension; Mathematics of Operations Research. 2008. DOI : 10.1287/moor.1080.0320.
F. Eisenbrand; G. Oriolo; G. Stauffer; P. Ventura : The stable set polytope of quasi-line graphs; Combinatorica. 2008. DOI : 10.1007/s00493-008-2244-x.
F. Eisenbrand; T. Rothvoß : A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. 2008. Automata, Languages and Programming, 35th International Colloquium (ICALP 2008), Reykjavik, Iceland, July 7-11, 2008.
F. Eisenbrand; F. Grandoni; G. Oriolo; M. Skutella : New approaches for virtual private network design; SIAM Journal on Computing. 2007. DOI : 10.1137/060654827.
F. Eisenbrand; A. Karrenbauer; C. Xu : Algorithms for longer OLED lifetime. 2007. p. 338-351.
F. Eisenbrand; S. Laue : A linear algorithm for integer programming in the plane; Mathematical Programming. 2005. DOI : 10.1007/s10107-004-0520-0.
