|
|
|
Friedrich Eisenbrand
|
Professor
PhD (Saarbrücken, 2000)
|
office(s):
MAC1573
phone(s): [+41 21 69] 32560,37922,32548
fax: +41 21 69 35840
|
|
|
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.
|
|
MAIN PUBLICATIONS
|
|
|
F. Eisenbrand and G. Shmonin.
Parametric integer programming in fixed dimension.
Mathematics of Operations Research, 33(4):839-850, 2008.
[ Details |
Full Text |
Link ]
|
|
|
F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura.
The stable set polytope of quasi-line graphs.
Combinatorica, 28(1):45-67, 2008.
[ Details |
Full Text |
Link ]
|
|
|
F. Eisenbrand, F. Grandoni, G. Oriolo, and M. Skutella.
New approaches for virtual private network design.
SIAM J. Comput., 37(3):706-721 (electronic), 2007.
[ Details |
Full Text ]
|
|
|
F. Eisenbrand and S. Laue.
A linear algorithm for integer programming in the plane.
Mathematical Programming, 102(2):249 - 259, 2005.
[ Details |
Full Text |
Link ]
|
|
|
F. Eisenbrand and T. Rothvoß.
A PTAS for Static Priority Real-Time Scheduling with
Resource Augmentation.
In Automata, Languages and Programming (ICALP'08),
Lecture Notes in Computer Science. Springer, 2008.
[ Details |
Full Text |
Link ]
|
|
|
F. Eisenbrand, A. Karrenbauer, and C. Xu.
Algorithms for longer OLED lifetime.
In Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in
Bioinformatics), volume 4525 NCS, pages 338 - 351, 2007.
[ Details |
Full Text ]
|
|
|
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
|
|
|
