Curriculum vitae

Friedrich
Eisenbrand
Max Planck Institute for Computer Science
Stuhlsatzenhausweg 85
66123 Saarbrücken
eisen@mpi-sb.mpg.de
http://www.mpi-sb.mpg.de/~eisen
Personal data
Born: July 3, 1971 in Quierschied, Germany
Marital status: Married with Anne Eisenbrand, former Anne Kuhn
Current positions
Max Planck Institute for Computer Science since January 2002
Saarbrücken, Deutschland,
Head (associate professor) of the research group Discrete Optimization
Indian Institute of Technology January-March 2004
Delhi, India,
Visiting professor in the department of Computer Science and Engineering
Research interests
Algorithms and Complexity with focus on integer programming, combinatorial optimization, algorithmic
geometry of numbers, applied optimization
Education
University of the Saarland October 1991-March 1997
Studies in Computer Science and Mathematics
Diploma in Computer Science, March 1997
Title of Thesis: Factor refinement in quadratic number fields
University of the Saarland and MPI for Computer Science May 1997-March 2000
Ph.D. studies in Computer Science,
Dissertation (Summa Cum Laude), July 2000
Title of Dissertation: Gomory-Chvátal Cutting Planes and the Elementary Closure of Polyhedra
University of the Saarland April 2000-December 2003
Habilitation in Computer Science
Positions held
2000-2001
Max Planck Institute for Computer Science April 2000-February 2001
Saarbrücken, Germany,
Researcher in the group of Professor Dr. Harald Ganzinger
Istituto dei Analisi dei Sistemi ed Informatica March-August 2001
Rome, Italy,
Postdoc in the group of Professor Dr. Giovanni Rinaldi

Friedrich Eisenbrand (p. 2 of 4)
Technische Universität Berlin October-December 2001
Berlin, Germany,
Visiting researcher in the group of Professor Dr. Günter M. Ziegler
Honors
Scholarships
11/1997 - 03/2000 Scholarship holder of the graduate college efficiency of algorithms and
computing machinery of the University of the Saarland.
03/2001 - 08/2001 Scholarship holder of a DONET stipend for the visit to the IASI, Rome, Italy
Prize
07/2001 Otto Hahn medal of the Max Planck Society for excellent dissertation
Teaching
Computer Algebra Fall 2000/01
Lecture, University of the Saarland
Optimization Spring 2002
Lecture, University of the Saarland
Approximation Algorithms Fall 20002/03
Seminar, University of the Saarland
Optimization Spring 2003
Lecture, University of the Saarland
Integer Programming and Combinatorial Optimization Fall 20003/04
Seminar, University of the Saarland
Mathematical Programming Spring 2004
Lecture, IIT-Delhi
Editorial and refereeing activities
• Since 2004 I am associate editor of Operations Research Letters
• I was a referee for the following journals: Mathematics of Operations Research, SIAM Journal of
Discrete Mathematics, Discrete Applied Mathematics, Mathematical Programming, Operations
Research Letters
Research projects and consulting
• I am a principal investigator in the AVACS project Automatic Verification and Analysis of Complex
Systems, funded by the German Research Society (DFG).
• Together with my colleagues Prof. Dr. Elmar Schömer and Dr. Stefan Funke we are consulting
Daimler-Chrysler on a particular packing problem, which occurs in car manufacturing. Within this
scope, Daimler-Chrysler funds a Ph.D. student at the Max Planck Institute for Computer Science.

Friedrich Eisenbrand (p. 3 of 4)
Publications
Journals
[Z1] F. Eisengrand and F. Grandoni. On the complexity of fixed parameter clique and dominating set.
Theoretical Computer Science, 2004. to appear
[Z2] F. Eisenbrand and S. Laue. A linear algorithm for integer programming in the plane. Mathematical
Programming, 2004. to appear
[Z3] F. Eisenbrand. Fast integer programming in fixed dimension. Computing, 2004. to appear
[Z4] F. Eisenbrand and A. S. Schulz. Bounds on the Chvátal rank of polytopes in the 0/1 cube.
Combinatorica, 23(2):245–261, 2003
[Z5] P. Ventura and F. Eisenbrand. A compact linear program for testing optimality of perfect matchings.
Operations Research Letters, 31(6):429–434, 2003
[Z6] F. Eisenbrand and F. Grandoni. Detecting directed 4-cycles still faster. Information Processing
Letters, 87(1):13–15, 2003
[Z7] F. Eisenbrand, G. Rinaldi, and P. Ventura. Primal separation for 0/1 polytopes. Mathematical
Programming, 95(3):475–491, 2003
[Z8] A. Bockmayr and F. Eisenbrand. Cutting planes and the elementary closure in fixed dimension.
Mathematics of Operations Research, 26(2):304–312, 2001
[Z9] F. Eisenbrand. Short vectors of planar lattices via continued fractions. Information Processing
Letters, 79(3):121–126, 2001
[Z10] F. Eisenbrand. On the membership problem for the elementary closure of a polyhedron.
Combinatorica, 19(2):297–300, 1999
[Z11] A. Bockmayr, F. Eisenbrand, M. E. Hartmann, and A. S. Schulz. On the Chvátal rank of polytopes in
the 0/1 cube. Discrete Applied Mathematics, 98:21–27, 1999
[Z12] J. Buchmann and F. Eisenbrand. On factor refinement in number fields. Mathematics of
Computation, 68(225):345–350, 1999
Conferences
[C1] E. Althaus, F. Eisenbrand, S. Funke, and K. Mehlhorn. Point containment in the integer hull of a
polyhedron. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms,
2004
[C2] F. Eisenbrand and S. Laue. A faster algorithm for two variable integer programming. In 14th Annual
International Symposium on Algorithms and Computation, ISAAC 03, LNCS. Springer, 2003
[C3] F. Eisenbrand. Fast integer programming in fixed dimension. In G. Di Battista and U. Zwick, editors,
In Proceedings of the 11th Annual European Symposium on Algorithms, ESA’ 2003, volume 2832 of
LNCS, pages 196–207. Springer, 2003
[C4] F. Eisenbrand, S. Funke, J. Reichel, and E. Schömer. Packing a trunk. In G. Di Battista and U. Zwick,
editors, 11th Annual European Symposium on Algorithms, ESA 03, volume 2832 of LNCS, pages
618–129, 2003
[C5] F. Eisenbrand, S. Funke, N. Garg, and J. Könemann. A combinatorial algorithm for computing a
maximum independent set in a t-perfect graph. In Proceedings of the fourteenth annual ACM-SIAM
symposium on Discrete algorithms, pages 517–522. Society for Industrial and Applied Mathematics,
2003
[C6] F. Eisenbrand, G. Rinaldi, and P. Ventura. 0/1 optimization and 0/1 primal separation are equivalent.
In Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, pages
920–926, 2002

Friedrich Eisenbrand (p. 4 of 4)
[C7] F. Eisenbrand and G. Rote. Fast reduction of ternary quadratic forms. In J. Silverman, editor,
Cryptography and Lattices Conference, CALC 2001, volume 2146 of LNCS, pages 32–44. Springer,
2001
[C8] F. Eisenbrand and G. Rote. Fast 2-variable integer programming. In K. Aardal and B. Gerards,
editors, Integer Programming and Combinatorial Optimization, IPCO 2001, volume 2081 of LNCS,
pages 78–89. Springer, 2001
[C9] A. Bockmayr and F. Eisenbrand. Combining logic and optimization in cutting plane theory. In
H. Kirchner and C. Ringeissen, editors, Frontiers of Combining Systems, FroCoS 2000, LNAI 1794,
pages 1–17. Springer, 2000. invited paper
[C10] F. Eisenbrand and A. S. Schulz. Bounds on the Chvátal rank of polytopes in the 0/1 cube. In
G. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial
Optimization, IPCO 99, pages 137–150. Springer, LNCS 1610, 1999
Theses
[T1] F. Eisenbrand. Gomory-Chvátal cutting planes and the elementary closure ofpolyhedra. PhD thesis,
Universität des Saarlandes, July 2000
[T2] F. Eisenbrand. On factor refinement in quadratic number fields. Master’s thesis, Universität des
Saarlandes, March 1997