| 2026 | SODA | Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure. | Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer |
| 2026 | SODA | A parameterized linear formulation of the integer hull. | Friedrich Eisenbrand, Thomas Rothvoss |
| 2025 | SODA | Forall-exist statements in pseudopolynomial time. | Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss, Robert Weismantel |
| 2024 | FOCS | Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. | Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki |
| 2023 | IPCO | From Approximate to Exact Integer Programming. | Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss |
| 2021 | ESA | Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. | Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel |
| 2021 | SODA | Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time. | Jana Cslovjecsek, Friedrich Eisenbrand, Christoph Hunkenschrder, Lars Rohwedder, Robert Weismantel |
| 2020 | ESA | Approximate CVP | Friedrich Eisenbrand, Moritz Venzin |
| 2018 | ICALP | Faster Algorithms for Integer Programs with Block Structure. | Friedrich Eisenbrand, Christoph Hunkenschrder, Kim-Manuel Klein |
| 2018 | ISAAC | Diversity Maximization in Doubling Metrics. | Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell |
| 2018 | SODA | Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma. | Friedrich Eisenbrand, Robert Weismantel |
| 2017 | SODA | Local Search for Max-Sum Diversification. | Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen |
| 2015 | ESA | Node-Balancing by Edge-Increments. | Friedrich Eisenbrand, Shay Moran, Rom Pinchasi, Martin Skutella |
| 2015 | SODA | On largest volume simplices and sub-determinants. | Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza, Carsten Moldenhauer |
| 2013 | SODA | Minimizing the number of lattice points in a translated polygon. | Friedrich Eisenbrand, Nicolai Hhnle |
| 2011 | IPCO | Set Covering with Ordered Replacement: Additive and Multiplicative Gaps. | Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvo, Laura Sanit |
| 2011 | SODA | Bin Packing via Discrepancy of Permutations. | Friedrich Eisenbrand, Dmtr Plvlgyi, Thomas Rothvo |
| 2010 | ESA | Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. | Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, Jos Verschae, Andreas Wiese |
| 2010 | ICALP | Scheduling Periodic Tasks in a Hard Real-Time Environment. | Friedrich Eisenbrand, Nicolai Hhnle, Martin Niemeier, Martin Skutella, Jos Verschae, Andreas Wiese |
| 2010 | SODA | Testing Additive Integrality Gaps. | Friedrich Eisenbrand, Nicolai Hhnle, Dmtr Plvlgyi, Gennady Shmonin |
| 2010 | SODA | EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. | Friedrich Eisenbrand, Thomas Rothvo |
| 2008 | ICALP | A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation. | Friedrich Eisenbrand, Thomas Rothvo |
| 2008 | SODA | Approximating connected facility location problems via random facility sampling and core detouring. | Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvo, Guido Schfer |
| 2008 | RTSS | Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard. | Friedrich Eisenbrand, Thomas Rothvo |
| 2007 | ALENEX | 0/1 Vertex and Facet Enumeration with BDDs. | Markus Behle, Friedrich Eisenbrand |
| 2007 | TACAS | Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations. | Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand, David N. Jansen |
| 2006 | CIAC | Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. | Friedrich Eisenbrand, Edda Happ |
| 2006 | ESA | Multiline Addressing by Network Flow. | Friedrich Eisenbrand, Andreas Karrenbauer, Martin Skutella, Chihao Xu |
| 2006 | RTCSA | Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality. | Werner Damm, Alexander Metzner, Friedrich Eisenbrand, Gennady Shmonin, Reinhard Wilhelm, Sebastian Winkel |
| 2005 | ICALP | New Approaches for Virtual Private Network Design. | Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo Oriolo, Martin Skutella |
| 2005 | IPCO | Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs. | Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura |
| 2005 | SODA | An improved approximation algorithm for virtual private network design. | Friedrich Eisenbrand, Fabrizio Grandoni |
| 2004 | SODA | Point containment in the integer hull of a polyhedron. | Ernst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn |
| 2003 | ESA | Fast Integer Programming in Fixed Dimension. | Friedrich Eisenbrand |
| 2003 | ESA | Packing a Trunk. | Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, Elmar Schmer |
| 2003 | ISAAC | A Faster Algorithm for Two-Variable Integer Programming. | Friedrich Eisenbrand, Sren Laue |
| 2003 | SODA | A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. | Friedrich Eisenbrand, Stefan Funke, Naveen Garg, Jochen Knemann |
| 2002 | SODA | 0/1 optimization and 0/1 primal separation are equivalent. | Friedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura |
| 2001 | IPCO | Fast 2-Variable Integer Programming. | Friedrich Eisenbrand, Gnter Rote |
| 1999 | IPCO | Bounds on the Chvtal Rank of Polytopes in the 0/1-Cube. | Friedrich Eisenbrand, Andreas S. Schulz |