Publications: Friedrich Eisenbrand

Preprints

• Friedrich Eisenbrand & Gennady Shmonin,
  Parametric integer programming in fixed dimension
  Revision of  Integer points in a parameterised polyhedron

• Michele Conforti, Marco di Summa, Friedrich Eisenbrand & Laurence A. Wolsey
  Network formulations of mixed-integer programs
  
  

Articles in Journals and Conference Proceedings

• F. Eisenbrand, F. Grandoni, T. Rothvoß, & G. Schäfer
  Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring.
  to appear in Proceedings of Nineteenth annual ACM-SIAM symposium on Discrete algorithms, SODA 2008.

• Thorsten Bernholt, Friedrich Eisenbrand & Thomas Hofmeister,
  A Geometric Framework for Solving Subsequence Problems in  Computational Biology Efficiently,
  submitted.
  
  An extended abstract appeared in
  J. Erickson and M. Teillaud (eds.): Proceedings of the 23nd Annual ACM Symposium on Computational Geometry
  Gyeongju, South Korea, June 6-8, 2007, 310-318. (Slides)

• Friedrich Eisenbrand, Gianpaolo Oriolo, Paolo Ventura & Gautier Stauffer,
  Circular ones matrices and the stable set polytope of quasi-line graphs,
  accepted in Combinatorica. (Slides)

An extended abstract appeared in
M. Jünger and V. Kaibel (eds.): Proceedings of the Eleventh Conference on Integer Programming and Combinatorial Optimization (IPCO 05) , Lecture Notes in Computer Science 3509, Springer: Berlin, 2005, 291-305.

• Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo & Martin Skutella,
  New Approaches for Virtual Private Network Design,
  SIAM Journal on Computing 37(3):706-721, 2007.

An extended Abstract appeared as
New Approaches for Virtual Private Network Design,
L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi, M. Yung (Eds.): Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), Lecture Notes in Computer Science 3142, Springer: Berlin, 2005, 1151-1162.

• Friedrich Eisenbrand, Andreas Karrenbauer & Chihao Xu,
  Algorithms for longer OLED lifetime,
  to appear in the Proceedings of the 6-th Workshop on Experimental Algorithms WEA 07.

• Markus Behle & Friedrich Eisenbrand,
  0/1 vertex and facet enumeration with BDDs,
  To appear in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX07), New Orleans, U.S.A., January 2007.

• Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand & David N. Jansen,
  Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations,
  in Thirteenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 07), to appear
  
  
• Friedrich Eisenbrand & Gennady Shmonin,
  Carathéodory Bounds for Integer Cones,
  Operations Research Letters, 34:564-568, 2006. (Slides)

• Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella & Chihao Xu,
  Multiline Addressing by Network Flow,
  in Yossi Azar & Thomas Erlebach (eds.):  Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06), Lecture Notes in Computer Science 4168, Springer: Berlin, 744--755, 2006.
  
  
• Friedrich Eisenbrand & Edda Happ,
  Provisioning a virtual private network under the presence of non-communicating groups,
  T. Calamoneri, I. Finocchi, G. F. Italiano (Eds): Proceedings of the 6th Italian Conference on Algorithms and Complexity, CIAC 2006, Lecture Notes in Computer Science 3998, Springer: Berlin, 2006, 105 - 114.
  
  
• F. Eisenbrand and S. Laue.
  A linear algorithm for integer programming in the plane.
  Mathematical Programming, 102(2):249-259, 2005. (Slides)
  
  An extended abstract appeared as:
  A faster algorithm for two variable integer programming.
  In 14th Annual International Symposium on Algorithms and Computation, ISAAC 03, LNCS. Springer, 2003.
  
  
• Bernd Becker, Markus Behle, Friedrich Eisenbrand & Ralf Wimmer,
  BDDs in a Branch and Cut Framework,
  Sotiris E. Nikoletseas (eds.):Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA 05), Lecture Notes in Computer Science 3503, Springer: Berlin, 2005, 452-463 .
  
  
• Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Elmar Schömer & Joachim Reichel
  Packing a trunk - now even with a twist,
  L. Kobbelt, V. Shapiro (Eds.): Proceedings of the Ninth ACM Symposium on Solid and Physical Modeling (SPM), 197-206
  
  
• F. Eisenbrand, S. Funke, A. Karrenbauer and D. Matjevic.
  Energy-aware stage illumination.
  J. S. B. Mitchell, G. Rote (Eds.): Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, 2005, 336-345.
  
  
• F. Eisenbrand and F. Grandoni.
  An improved approximation algorithm for virtual private network design.
  in Proceedings of Sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA 2005, 928-932.
  
  
• 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. (Slides)
  
  
• 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, SODA 04, 2004.
  
  
• 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.
  
  An extended abstract appeared as:
  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.
  
  
• Friedrich Eisenbrand & Fabrizio Grandoni,
  On the complexity of fixed parameter clique and dominating set,
  Theoretical Computer Science, 326(1-3): 57-67, 2004.
  
  
• 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, SODA 03, pages 517-522. Society for Industrial and Applied Mathematics, 2003.
  
  
• P. Ventura and F. Eisenbrand.
  A compact linear program for testing optimality of perfect matchings.
  Operations Research Letters, 31(6):429-434, 2003.
  
  
• F. Eisenbrand and F. Grandoni.
  Detecting directed 4-cycles still faster.
  Information Processing Letters, 87(1):13-15, 2003.
  
  
• F. Eisenbrand, G. Rinaldi, and P. Ventura.
  Primal separation for 0/1 polytopes.
  Mathematical Programming, 95(3):475-491, 2003.
  
  An extended abstract appeared as:
  0/1 optimization and 0/1 primal separation are equivalent.
  In Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 02, pages 920-926, 2002.
  
  
• A. Bockmayr and F. Eisenbrand.
  Cutting planes and the elementary closure in fixed dimension.
  Mathematics of Operations Research, 26(2):304-312, 2001.
  
  
• F. Eisenbrand.
  Short vectors of planar lattices via continued fractions.
  Information Processing Letters, 79(3):121-126, 2001.
  
  
• 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.
  
  
• 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.
  
  
• 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.
  
  
• F. Eisenbrand.
  On the membership problem for the elementary closure of a polyhedron.
  Combinatorica, 19(2):297-300, 1999.
  
  
• 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.
  
  
• J. Buchmann and F. Eisenbrand.
  On factor refinement in number fields.
  Mathematics of Computation, 68(225):345-350, 1999.

Theses

• F. Eisenbrand.
  Gomory-Chvátal cutting planes and the elementary closure of polyhedra.
  PhD thesis, Universität des Saarlandes, July 2000.
  
  
• F. Eisenbrand.
  On factor refinement in quadratic number fields.
  Master's thesis, Universität des Saarlandes, March 1997.