| 2008 |
|---|
| 38 | EE | Friedrich Eisenbrand,
Fabrizio Grandoni,
Thomas Rothvoß,
Guido Schäfer:
Approximating connected facility location problems via random facility sampling and core detouring.
SODA 2008: 1174-1183 |
| 37 | EE | Friedrich Eisenbrand,
Gianpaolo Oriolo,
Gautier Stauffer,
Paolo Ventura:
The stable set polytope of quasi-line graphs.
Combinatorica 28(1): 45-67 (2008) |
| 2007 |
|---|
| 36 | EE | Markus Behle,
Friedrich Eisenbrand:
0/1 Vertex and Facet Enumeration with BDDs.
ALENEX 2007 |
| 35 | EE | Thorsten Bernholt,
Friedrich Eisenbrand,
Thomas Hofmeister:
A geometric framework for solving subsequence problems in computational biology efficiently.
Symposium on Computational Geometry 2007: 310-318 |
| 34 | EE | Lijun Zhang,
Holger Hermanns,
Friedrich Eisenbrand,
David N. Jansen:
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.
TACAS 2007: 155-169 |
| 33 | EE | Friedrich Eisenbrand,
Andreas Karrenbauer,
Chihao Xu:
Algorithms for Longer OLED Lifetime.
WEA 2007: 338-351 |
| 32 | EE | Friedrich Eisenbrand,
Fabrizio Grandoni,
Gianpaolo Oriolo,
Martin Skutella:
New Approaches for Virtual Private Network Design.
SIAM J. Comput. 37(3): 706-721 (2007) |
| 2006 |
|---|
| 31 | EE | Friedrich Eisenbrand,
Edda Happ:
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups.
CIAC 2006: 105-114 |
| 30 | EE | Friedrich Eisenbrand,
Andreas Karrenbauer,
Martin Skutella,
Chihao Xu:
Multiline Addressing by Network Flow.
ESA 2006: 744-755 |
| 29 | EE | Werner Damm,
Alexander Metzner,
Friedrich Eisenbrand,
Gennady Shmonin,
Reinhard Wilhelm,
Sebastian Winkel:
Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality.
RTCSA 2006: 87-90 |
| 28 | EE | Friedrich Eisenbrand,
Gennady Shmonin:
Carathéodory bounds for integer cones.
Oper. Res. Lett. 34(5): 564-568 (2006) |
| 2005 |
|---|
| 27 | EE | Friedrich Eisenbrand,
Fabrizio Grandoni,
Gianpaolo Oriolo,
Martin Skutella:
New Approaches for Virtual Private Network Design.
ICALP 2005: 1151-1162 |
| 26 | EE | Friedrich Eisenbrand,
Gianpaolo Oriolo,
Gautier Stauffer,
Paolo Ventura:
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.
IPCO 2005: 291-305 |
| 25 | EE | Friedrich Eisenbrand,
Fabrizio Grandoni:
An improved approximation algorithm for virtual private network design.
SODA 2005: 928-932 |
| 24 | EE | Friedrich Eisenbrand,
Stefan Funke,
Andreas Karrenbauer,
Domagoj Matijevic:
Energy-aware stage illumination.
Symposium on Computational Geometry 2005: 336-345 |
| 23 | EE | Friedrich Eisenbrand,
Stefan Funke,
Andreas Karrenbauer,
Joachim Reichel,
Elmar Schömer:
Packing a trunk: now with a twist!
Symposium on Solid and Physical Modeling 2005: 197-206 |
| 22 | EE | Bernd Becker,
Markus Behle,
Friedrich Eisenbrand,
Ralf Wimmer:
BDDs in a Branch and Cut Framework.
WEA 2005: 452-463 |
| 21 | EE | Friedrich Eisenbrand,
Sören Laue:
A linear algorithm for integer programming in the plane.
Math. Program. 102(2): 249-259 (2005) |
| 2004 |
|---|
| 20 | EE | Ernst Althaus,
Friedrich Eisenbrand,
Stefan Funke,
Kurt Mehlhorn:
Point containment in the integer hull of a polyhedron.
SODA 2004: 929-933 |
| 19 | EE | Friedrich Eisenbrand,
Fabrizio Grandoni:
On the complexity of fixed parameter clique and dominating set.
Theor. Comput. Sci. 326(1-3): 57-67 (2004) |
| 2003 |
|---|
| 18 | EE | Friedrich Eisenbrand:
Fast Integer Programming in Fixed Dimension.
ESA 2003: 196-207 |
| 17 | EE | Friedrich Eisenbrand,
Stefan Funke,
Joachim Reichel,
Elmar Schömer:
Packing a Trunk.
ESA 2003: 618-629 |
| 16 | EE | Friedrich Eisenbrand,
Sören Laue:
A Faster Algorithm for Two-Variable Integer Programming.
ISAAC 2003: 290-299 |
| 15 | EE | Friedrich Eisenbrand,
Stefan Funke,
Naveen Garg,
Jochen Könemann:
A combinatorial algorithm for computing a maximum independent set in a t-perfect graph.
SODA 2003: 517-522 |
| 14 | EE | Friedrich Eisenbrand,
Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Combinatorica 23(2): 245-261 (2003) |
| 13 | EE | Friedrich Eisenbrand,
Fabrizio Grandoni:
Detecting directed 4-cycles still faster.
Inf. Process. Lett. 87(1): 13-15 (2003) |
| 12 | EE | Friedrich Eisenbrand,
Giovanni Rinaldi,
Paolo Ventura:
Primal separation for 0/1 polytopes.
Math. Program. 95(3): 475-491 (2003) |
| 11 | EE | Paolo Ventura,
Friedrich Eisenbrand:
A compact linear program for testing optimality of perfect matchings.
Oper. Res. Lett. 31(3): 429-434 (2003) |
| 2002 |
|---|
| 10 | EE | Friedrich Eisenbrand,
Giovanni Rinaldi,
Paolo Ventura:
0/1 optimization and 0/1 primal separation are equivalent.
SODA 2002: 920-926 |
| 2001 |
|---|
| 9 | EE | Friedrich Eisenbrand,
Günter Rote:
Fast Reduction of Ternary Quadratic Forms.
CaLC 2001: 32-44 |
| 8 | EE | Friedrich Eisenbrand,
Günter Rote:
Fast 2-Variable Integer Programming.
IPCO 2001: 78-89 |
| 7 | EE | Friedrich Eisenbrand:
Short vectors of planar lattices via continued fractions.
Inf. Process. Lett. 79(3): 121-126 (2001) |
| 6 | EE | Alexander Bockmayr,
Friedrich Eisenbrand:
Cutting Planes and the Elementary Closure in Fixed Dimension.
Math. Oper. Res. 26(2): 304-312 (2001) |
| 2000 |
|---|
| 5 | | Alexander Bockmayr,
Friedrich Eisenbrand:
Combining Logic and Optimization in Cutting Plane Theory.
FroCos 2000: 1-17 |
| 1999 |
|---|
| 4 | EE | Friedrich Eisenbrand,
Andreas S. Schulz:
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
IPCO 1999: 137-150 |
| 3 | EE | Friedrich Eisenbrand:
On the Membership Problem for the Elementary Closure of a Polyhedron.
Combinatorica 19(2): 297-300 (1999) |
| 2 | EE | Alexander Bockmayr,
Friedrich Eisenbrand,
Mark E. Hartmann,
Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube.
Discrete Applied Mathematics 98(1-2): 21-27 (1999) |
| 1 | | Johannes Buchmann,
Friedrich Eisenbrand:
On factor refinement in number fields.
Math. Comput. 68(225): 345-350 (1999) |
