Friedrich Eisenbrand

Friedrich Eisenbrand, Nicolai Hähnle: Minimizing the number of lattice points in a translated polygon. SODA 2013: 1123-1130

Friedrich Eisenbrand, Martin Niemeier: Coloring fuzzy circular interval graphs. Eur. J. Comb. 33(5): 893-904 (2012)

Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier: On sub-determinants and the diameter of polyhedra. Symposium on Computational Geometry 2012: 357-362

Friedrich Eisenbrand, Nicolai Hähnle: Minimizing the number of lattice points in a translated polygon. CoRR abs/1207.0979 (2012)

Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese: Real-time Avionics Optimization. it - Information Technology 53(6): 274-279 (2011)

Friedrich Eisenbrand: The Euclidean Algorithm. Algorithms Unplugged 2011: 111-117

Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier: Covering cubes and the closest vector problem. Symposium on Computational Geometry 2011: 417-423

Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità: Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO 2011: 170-182

Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß: Bin Packing via Discrepancy of Permutations. SODA 2011: 476-481

Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier: On sub-determinants and the diameter of polyhedra. CoRR abs/1108.4272 (2011)

Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer: Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8): 709-726 (2010)

Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß: Diameter of Polyhedra: Limits of Abstraction. Math. Oper. Res. 35(4): 786-794 (2010)

Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese: Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. ESA (1) 2010: 11-22

Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese: Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311

Friedrich Eisenbrand, Thomas Rothvoß: EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. SODA 2010: 1029-1034

Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin: Testing Additive Integrality Gaps. SODA 2010: 1227-1234

Friedrich Eisenbrand, F. Bruce Shepherd (Eds.): Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Lecture Notes in Computer Science 6080, Springer 2010, isbn 978-3-642-13035-9

Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß: Bin Packing via Discrepancy of Permutations. CoRR abs/1007.2170 (2010)

Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier: Covering Cubes and the Closest Vector Problem. CoRR abs/1012.2289 (2010)

Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità: Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps. CoRR abs/1012.3295 (2010)

Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu: Multiline Addressing by Network Flow. Algorithmica 53(4): 583-596 (2009)

Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister: Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. Discrete & Computational Geometry 42(1): 22-36 (2009)

Friedrich Eisenbrand, Martin Niemeier: Coloring Fuzzy Circular Interval Graphs. Electronic Notes in Discrete Mathematics 34: 543-548 (2009)

Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu: Algorithms for longer OLED lifetime. ACM Journal of Experimental Algorithmics 14 (2009)

Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey: Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34(1): 194-209 (2009)

Friedrich Eisenbrand, Thomas Rothvoß: New Hardness Results for Diophantine Approximation. APPROX-RANDOM 2009: 98-110

Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß: Diameter of polyhedra: limits of abstraction. Symposium on Computational Geometry 2009: 386-392

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura: The stable set polytope of quasi-line graphs. Combinatorica 28(1): 45-67 (2008)

Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher: Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. Electr. J. Comb. 15(1) (2008)

Friedrich Eisenbrand: Algorithms for Integer Programming. Bulletin of the EATCS 96: 46-57 (2008)

Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic: Energy-Aware Stage Illumination. Int. J. Comput. Geometry Appl. 18(1/2): 107-129 (2008)

Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen: Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. Logical Methods in Computer Science 4(4) (2008)

Friedrich Eisenbrand, Gennady Shmonin: Parametric Integer Programming in Fixed Dimension. Math. Oper. Res. 33(4): 839-850 (2008)

Friedrich Eisenbrand, Thomas Rothvoß: A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. ICALP (1) 2008: 246-257

Friedrich Eisenbrand, Thomas Rothvoß: Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. RTSS 2008: 397-406

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

Friedrich Eisenbrand: Der Euklidische Algorithmus. Taschenbuch der Algorithmen 2008: 119-125

Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen: Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. CoRR abs/0808.3651 (2008)

Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Joachim Reichel, Elmar Schömer: Packing a Truck - Now with a Twist! Int. J. Comput. Geometry Appl. 17(5): 505-527 (2007)

Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. SIAM J. Comput. 37(3): 706-721 (2007)

Markus Behle, Friedrich Eisenbrand: 0/1 Vertex and Facet Enumeration with BDDs. ALENEX 2007

Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister: A geometric framework for solving subsequence problems in computational biology efficiently. Symposium on Computational Geometry 2007: 310-318

Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen: Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. TACAS 2007: 155-169

Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu: Algorithms for Longer OLED Lifetime. WEA 2007: 338-351

Friedrich Eisenbrand, Gennady Shmonin: Carathéodory bounds for integer cones. Oper. Res. Lett. 34(5): 564-568 (2006)

Friedrich Eisenbrand, Edda Happ: Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. CIAC 2006: 105-114

Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu: Multiline Addressing by Network Flow. ESA 2006: 744-755

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

Friedrich Eisenbrand, Sören Laue: A linear algorithm for integer programming in the plane. Math. Program. 102(2): 249-259 (2005)

Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic: Energy-aware stage illumination. Symposium on Computational Geometry 2005: 336-345

Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella: New Approaches for Virtual Private Network Design. ICALP 2005: 1151-1162

Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura: Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO 2005: 291-305

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

Friedrich Eisenbrand, Fabrizio Grandoni: An improved approximation algorithm for virtual private network design. SODA 2005: 928-932

Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer: BDDs in a Branch and Cut Framework. WEA 2005: 452-463

Friedrich Eisenbrand, Fabrizio Grandoni: On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326(1-3): 57-67 (2004)

Bernd Becker, Markus Behle, Friedrich Eisenbrand, Martin Fränzle, Marc Herbstritt, Christian Herde, Jörg Hoffmann, Daniel Kröning, Bernhard Nebel, Ilia Polian, Ralf Wimmer: Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems. MBMV 2004: 65-75

Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn: Point containment in the integer hull of a polyhedron. SODA 2004: 929-933

Friedrich Eisenbrand, Andreas S. Schulz: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. Combinatorica 23(2): 245-261 (2003)

Friedrich Eisenbrand, Fabrizio Grandoni: Detecting directed 4-cycles still faster. Inf. Process. Lett. 87(1): 13-15 (2003)

Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura: Primal separation for 0/1 polytopes. Math. Program. 95(3): 475-491 (2003)

Paolo Ventura, Friedrich Eisenbrand: A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett. 31(3): 429-434 (2003)

Friedrich Eisenbrand: Fast Integer Programming in Fixed Dimension. ESA 2003: 196-207

Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schömer: Packing a Trunk. ESA 2003: 618-629

Friedrich Eisenbrand, Sören Laue: A Faster Algorithm for Two-Variable Integer Programming. ISAAC 2003: 290-299

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

Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura: 0/1 optimization and 0/1 primal separation are equivalent. SODA 2002: 920-926

Friedrich Eisenbrand: Short vectors of planar lattices via continued fractions. Inf. Process. Lett. 79(3): 121-126 (2001)

Alexander Bockmayr, Friedrich Eisenbrand: Cutting Planes and the Elementary Closure in Fixed Dimension. Math. Oper. Res. 26(2): 304-312 (2001)

Friedrich Eisenbrand, Günter Rote: Fast Reduction of Ternary Quadratic Forms. CaLC 2001: 32-44

Friedrich Eisenbrand, Günter Rote: Fast 2-Variable Integer Programming. IPCO 2001: 78-89

Alexander Bockmayr, Friedrich Eisenbrand: Combining Logic and Optimization in Cutting Plane Theory. FroCoS 2000: 1-17

Friedrich Eisenbrand: On the Membership Problem for the Elementary Closure of a Polyhedron. Combinatorica 19(2): 297-300 (1999)

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)

Johannes Buchmann, Friedrich Eisenbrand: On factor refinement in number fields. Math. Comput. 68(225): 345-350 (1999)

Friedrich Eisenbrand, Andreas S. Schulz: Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. IPCO 1999: 137-150