Friedrich Eisenbrand

Affiliations:
  • Swiss Federal Institute of Technology in Lausanne, Switzerland


According to our database1, Friedrich Eisenbrand authored at least 84 papers between 1999 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Approximate CVP<sub><i>p</i></sub> in time 2<sup>0.802<i>n</i></sup>.
J. Comput. Syst. Sci., 2022

2021
A QPTAS for stabbing rectangles.
CoRR, 2021

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma.
ACM Trans. Algorithms, 2020

Approximate $\mathrm{CVP}_{\infty}$ in time $2^{0.802 \, n}$.
CoRR, 2020

N-fold integer programming via LP rounding.
CoRR, 2020

Approximate CVP<sub>p</sub> in Time 2<sup>0.802 n</sup>.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
An Improved Analysis of Local Search for Max-Sum Diversification.
Math. Oper. Res., 2019

An Algorithmic Theory of Integer Programming.
CoRR, 2019

2018
The Support of Integer Optimal Solutions.
SIAM J. Optim., 2018

Diversity Maximization in Doubling Metrics.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Faster Algorithms for Integer Programs with Block Structure.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Geometric random edge.
Math. Program., 2017

Local Search for Max-Sum Diversification.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
A note on non-degenerate integer programs with small sub-determinants.
Oper. Res. Lett., 2016

Max-Sum Diversity Via Convex Programming.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
On largest volume simplices and sub-determinants.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Node-Balancing by Edge-Increments.
Proceedings of the Algorithms - ESA 2015, 2015

2014
On Sub-determinants and the Diameter of Polyhedra.
Discret. Comput. Geom., 2014

2013
Bin Packing via Discrepancy of Permutations.
ACM Trans. Algorithms, 2013

Testing additive integrality gaps.
Math. Program., 2013

Minimizing the number of lattice points in a translated polygon.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2011
Real-time Avionics Optimization.
it Inf. Technol., 2011

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Covering cubes and the closest vector problem.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

The Euclidean Algorithm.
Proceedings of the Algorithms Unplugged, 2011

2010
The LLL Algorithm and Integer Programming.
Proceedings of the LLL Algorithm - Survey and Applications, 2010

Diameter of Polyhedra: Limits of Abstraction.
Math. Oper. Res., 2010

Connected facility location via random facility sampling and core detouring.
J. Comput. Syst. Sci., 2010

EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
Proceedings of the Algorithms, 2010

Recent Hardness Results for Periodic Uni-processor Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Scheduling periodic tasks in a hard real-time environment.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Integer Programming and Algorithmic Geometry of Numbers - A tutorial.
Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009
Network Formulations of Mixed-Integer Programs.
Math. Oper. Res., 2009

Algorithms for longer OLED lifetime.
ACM J. Exp. Algorithmics, 2009

Coloring Fuzzy Circular Interval Graphs.
Electron. Notes Discret. Math., 2009

Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently.
Discret. Comput. Geom., 2009

Multiline Addressing by Network Flow.
Algorithmica, 2009

Diameter of polyhedra: limits of abstraction.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

New Hardness Results for Diophantine Approximation.
Proceedings of the Approximation, 2009

2008
Der Euklidische Algorithmus.
Proceedings of the Taschenbuch der Algorithmen, 2008

Parametric Integer Programming in Fixed Dimension.
Math. Oper. Res., 2008

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.
Log. Methods Comput. Sci., 2008

Energy-Aware Stage Illumination.
Int. J. Comput. Geom. Appl., 2008

Algorithms for Integer Programming.
Bull. EATCS, 2008

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets.
Electron. J. Comb., 2008

The stable set polytope of quasi-line graphs.
Comb., 2008

Approximating connected facility location problems via random facility sampling and core detouring.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard.
Proceedings of the 29th IEEE Real-Time Systems Symposium, 2008

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
New Approaches for Virtual Private Network Design.
SIAM J. Comput., 2007

Packing a Truck - Now with a Twist!
Int. J. Comput. Geom. Appl., 2007

A geometric framework for solving subsequence problems in computational biology efficiently.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

0/1 Vertex and Facet Enumeration with BDDs.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
Carathéodory bounds for integer cones.
Oper. Res. Lett., 2006

Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality.
Proceedings of the 12th IEEE Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2006), 2006

Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
A linear algorithm for integer programming in the plane.
Math. Program., 2005

BDDs in a Branch and Cut Framework.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

An improved approximation algorithm for virtual private network design.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Packing a trunk: now with a twist!
Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, 2005

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004
On the complexity of fixed parameter clique and dominating set.
Theor. Comput. Sci., 2004

Point containment in the integer hull of a polyhedron.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2004

2003
A compact linear program for testing optimality of perfect matchings.
Oper. Res. Lett., 2003

Primal separation for 0/1 polytopes.
Math. Program., 2003

Detecting directed 4-cycles still faster.
Inf. Process. Lett., 2003

Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Comb., 2003

A combinatorial algorithm for computing a maximum independent set in a t-perfect graph.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Faster Algorithm for Two-Variable Integer Programming.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Packing a Trunk.
Proceedings of the Algorithms, 2003

Fast Integer Programming in Fixed Dimension.
Proceedings of the Algorithms, 2003

2002
0/1 optimization and 0/1 primal separation are equivalent.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Cutting Planes and the Elementary Closure in Fixed Dimension.
Math. Oper. Res., 2001

Short vectors of planar lattices via continued fractions.
Inf. Process. Lett., 2001

Fast 2-Variable Integer Programming.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Fast Reduction of Ternary Quadratic Forms.
Proceedings of the Cryptography and Lattices, International Conference, 2001

2000
Combining Logic and Optimization in Cutting Plane Theory.
Proceedings of the Frontiers of Combining Systems, 2000

1999
On factor refinement in number fields.
Math. Comput., 1999

On the Chvátal Rank of Polytopes in the 0/1 Cube.
Discret. Appl. Math., 1999

On the Membership Problem for the Elementary Closure of a Polyhedron.
Comb., 1999


  Loading...