Friedrich Eisenbrand

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 32

Top Venues

Publications

Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR (2024)
Friedrich Eisenbrand, Matthieu Haeberle, Neta Singer
An Improved Bound on Sums of Square Roots via the Subspace Theorem. SoCG (2024)
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
From Approximate to Exact Integer Programming. IPCO (2023)
Friedrich Eisenbrand, Matthieu Haeberle, Neta Singer
An improved bound on sums of square roots via the subspace theorem. CoRR (2023)
Christoph Finkensiep, Matthieu Haeberle, Friedrich Eisenbrand, Markus Neuwirth, Martin Rohrmeier
Repetition-Structure Inference With Formal Prototypes. ISMIR (2023)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51 (6) (2023)
Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi
Integer points in the degree-sequence polytope. CoRR (2023)
Raimon Fabregat, Puck van Gerwen, Matthieu Haeberle, Friedrich Eisenbrand, Clémence Corminboeuf
Metric learning for kernel ridge regression: assessment of molecular similarity. Mach. Learn. Sci. Technol. 3 (3) (2022)
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
From approximate to exact integer programming. CoRR (2022)
Friedrich Eisenbrand, Moritz Venzin
. J. Comput. Syst. Sci. 124 (2022)
Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin
A QPTAS for stabbing rectangles. CoRR (2021)
Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. ESA (2021)
Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschröder, Lars Rohwedder, Robert Weismantel
Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. SODA (2021)
Jana Cslovjecsek, Friedrich Eisenbrand, Robert Weismantel
N-fold integer programming via LP rounding. CoRR (2020)
Friedrich Eisenbrand, Moritz Venzin
Approximate $\mathrm{CVP}_{\infty}$ in time $2^{0.802 \, n}$. CoRR (2020)
Friedrich Eisenbrand, Moritz Venzin
. ESA (2020)
Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel
Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. CoRR (2020)
Friedrich Eisenbrand, Robert Weismantel
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. ACM Trans. Algorithms 16 (1) (2020)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
An Improved Analysis of Local Search for Max-Sum Diversification. Math. Oper. Res. 44 (4) (2019)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn
An Algorithmic Theory of Integer Programming. CoRR (2019)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein
Faster Algorithms for Integer Programs with Block Structure. CoRR (2018)
Iskander Aliev, Jesús A. De Loera, Friedrich Eisenbrand, Timm Oertel, Robert Weismantel
The Support of Integer Optimal Solutions. SIAM J. Optim. 28 (3) (2018)
Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell
Diversity Maximization in Doubling Metrics. ISAAC (2018)
Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell
Diversity maximization in doubling metrics. CoRR (2018)
Friedrich Eisenbrand, Robert Weismantel
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. SODA (2018)
Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein
Faster Algorithms for Integer Programs with Block Structure. ICALP (2018)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Local Search for Max-Sum Diversification. SODA (2017)
Friedrich Eisenbrand, Robert Weismantel
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. CoRR (2017)
Friedrich Eisenbrand, Santosh S. Vempala
Geometric random edge. Math. Program. 164 (1-2) (2017)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Max-Sum Diversity Via Convex Programming. SoCG (2016)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Local Search for Max-Sum Diversification. CoRR (2016)
Stephan Artmann, Friedrich Eisenbrand, Christoph Glanzer, Timm Oertel, Santosh S. Vempala, Robert Weismantel
A note on non-degenerate integer programs with small sub-determinants. Oper. Res. Lett. 44 (5) (2016)
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
On largest volume simplices and sub-determinants. SODA (2015)
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Max-sum diversity via convex programming. CoRR (2015)
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
Node-balancing by edge-increments. CoRR (2015)
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella
Node-Balancing by Edge-Increments. ESA (2015)
Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer
On largest volume simplices and sub-determinants. CoRR (2014)
Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
On Sub-determinants and the Diameter of Polyhedra. Discret. Comput. Geom. 52 (1) (2014)
Friedrich Eisenbrand, Santosh S. Vempala
Geometric Random Edge. CoRR (2014)
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin
Testing additive integrality gaps. Math. Program. 141 (1-2) (2013)
Friedrich Eisenbrand, Nicolai Hähnle
Minimizing the number of lattice points in a translated polygon. SODA (2013)
Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß
Bin Packing via Discrepancy of Permutations. ACM Trans. Algorithms 9 (3) (2013)
Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
On sub-determinants and the diameter of polyhedra. SCG (2012)
Friedrich Eisenbrand, Martin Niemeier
Coloring fuzzy circular interval graphs. Eur. J. Comb. 33 (5) (2012)
Friedrich Eisenbrand, Nicolai Hähnle
Minimizing the number of lattice points in a translated polygon CoRR (2012)
Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß
Bin Packing via Discrepancy of Permutations. SODA (2011)
Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. IPCO (2011)
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
Covering cubes and the closest vector problem. SCG (2011)
Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
Real-time Avionics Optimization. it Inf. Technol. 53 (6) (2011)
Nicolas Bonifas, Marco Di Summa, Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
On sub-determinants and the diameter of polyhedra CoRR (2011)
Friedrich Eisenbrand, Dömötör Pálvölgyi, Thomas Rothvoß
Bin Packing via Discrepancy of Permutations CoRR (2010)
Friedrich Eisenbrand, Thomas Rothvoß
EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. SODA (2010)
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)
Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß
Diameter of Polyhedra: Limits of Abstraction. Flexible Network Design (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)
Friedrich Eisenbrand, Nicolai Hähnle, Alexander A. Razborov, Thomas Rothvoß
Diameter of Polyhedra: Limits of Abstraction. Math. Oper. Res. 35 (4) (2010)
Friedrich Eisenbrand, Thomas Rothvoß
Recent Hardness Results for Periodic Uni-processor Scheduling. Scheduling (2010)
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) (2010)
Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoß, Laura Sanità
Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps CoRR (2010)
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier
Covering Cubes and the Closest Vector Problem CoRR (2010)
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin
Testing Additive Integrality Gaps. SODA (2010)
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
Scheduling periodic tasks in a hard real-time environment. Scheduling (2010)
Michele Conforti, Marco Di Summa, Friedrich Eisenbrand, Laurence A. Wolsey
Network Formulations of Mixed-Integer Programs. Math. Oper. Res. 34 (1) (2009)
Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister
Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently. Discret. Comput. Geom. 42 (1) (2009)
Friedrich Eisenbrand, Nicolai Hähnle, Thomas Rothvoß
Diameter of polyhedra: limits of abstraction. SCG (2009)
Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
Multiline Addressing by Network Flow. Algorithmica 53 (4) (2009)
Friedrich Eisenbrand, Thomas Rothvoß
New Hardness Results for Diophantine Approximation. APPROX-RANDOM (2009)
Friedrich Eisenbrand, Martin Niemeier
Coloring Fuzzy Circular Interval Graphs. Electron. Notes Discret. Math. 34 (2009)
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu
Algorithms for longer OLED lifetime. ACM J. Exp. Algorithmics 14 (2009)
Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic
Energy-Aware Stage Illumination. Int. J. Comput. Geom. Appl. 18 (1/2) (2008)
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
The stable set polytope of quasi-line graphs. Comb. 28 (1) (2008)
Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher
Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets. Electron. J. Comb. 15 (1) (2008)
Friedrich Eisenbrand, Thomas Rothvoß
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. RTSS (2008)
Friedrich Eisenbrand, Gennady Shmonin
Parametric Integer Programming in Fixed Dimension. Math. Oper. Res. 33 (4) (2008)
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations CoRR (2008)
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. Log. Methods Comput. Sci. 4 (4) (2008)
Friedrich Eisenbrand, Thomas Rothvoß
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. ICALP (1) (2008)
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer
Approximating connected facility location problems via random facility sampling and core detouring. SODA (2008)
Friedrich Eisenbrand
Algorithms for Integer Programming. Bull. EATCS 96 (2008)
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
New Approaches for Virtual Private Network Design. SIAM J. Comput. 37 (3) (2007)
Thorsten Bernholt, Friedrich Eisenbrand, Thomas Hofmeister
A geometric framework for solving subsequence problems in computational biology efficiently. SCG (2007)
Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Joachim Reichel, Elmar Schömer
Packing a Truck - Now with a Twist! Int. J. Comput. Geom. Appl. 17 (5) (2007)
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. TACAS (2007)
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu
Algorithms for Longer OLED Lifetime. WEA (2007)
Markus Behle, Friedrich Eisenbrand
0/1 Vertex and Facet Enumeration with BDDs. ALENEX (2007)
Friedrich Eisenbrand, Edda Happ
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. CIAC (2006)
Friedrich Eisenbrand, Gennady Shmonin
Carathéodory bounds for integer cones. Oper. Res. Lett. 34 (5) (2006)
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)
Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu
Multiline Addressing by Network Flow. ESA (2006)
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella
New Approaches for Virtual Private Network Design. ICALP (2005)
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)
Friedrich Eisenbrand, Sören Laue
A linear algorithm for integer programming in the plane. Math. Program. 102 (2) (2005)
Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, Domagoj Matijevic
Energy-aware stage illumination. SCG (2005)
Bernd Becker, Markus Behle, Friedrich Eisenbrand, Ralf Wimmer
BDDs in a Branch and Cut Framework. WEA (2005)
Friedrich Eisenbrand, Fabrizio Grandoni
An improved approximation algorithm for virtual private network design. SODA (2005)
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. IPCO (2005)
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)
Friedrich Eisenbrand, Fabrizio Grandoni
On the complexity of fixed parameter clique and dominating set. Theor. Comput. Sci. 326 (1-3) (2004)
Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn
Point containment in the integer hull of a polyhedron. SODA (2004)
Paolo Ventura, Friedrich Eisenbrand
A compact linear program for testing optimality of perfect matchings. Oper. Res. Lett. 31 (3) (2003)

Friedrich Eisenbrand.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Friedrich Eisenbrand