F. Eisenbrand

activity

20082026

most citedAn Algorithmic Theory of Integer Programming

34 citations · 60 across the 20 of their papers we have counts for

collaborators

26 papers

cs.DS2026

Nearly-Tight Bounds for Zonotope Containment and Beyond

Friedrich Eisenbrand, Thomas Rothvoss, Matteo Russo +1

We investigate the convex-body containment problem $max {s > 0 : s Z \subseteq Q}$ , where the outer body $Q \subseteq R^{d}$ is described by a membership oracle and the inne…

cs.CC2025

A parameterized linear formulation of the integer hull

Friedrich Eisenbrand, Thomas Rothvoss

Let $A \in Z^{m \times n}$ be an integer matrix with components bounded by $Δ$ in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix $B \in…

math.OC2023

Forall-exist statements in pseudopolynomial time

Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss +1

Given a convex set $Q \subseteq R^{m}$ and an integer matrix $W \in Z^{m \times n}$ , we consider statements of the form $\forall b \in Q \cap Z^{m}$ $\exists x \in Z^{n}$ s.t. $Wx \leq…

cs.DM2023

Integer points in the degree-sequence polytope

Eleonore Bach, Friedrich Eisenbrand, Rom Pinchasi

An integer vector $b \in Z^{d}$ is a degree sequence if there exists a hypergraph with vertices ${1, \dots, d}$ such that each $b_{i}$ is the number of hyperedges containing $…

math.OC2022

From approximate to exact integer programming

Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss

Approximate integer programming is the following: For a convex body $K \subseteq R^{n}$ , either determine whether $K \cap Z^{n}$ is empty, or find an integer point in…

cs.CG2021

A QPTAS for stabbing rectangles

Friedrich Eisenbrand, Martina Gallato, Ola Svensson +1

We consider the following geometric optimization problem: Given $n$ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length…