Friedrich Eisenbrand

Oper. Res. Lett., November, 2023

An improved bound on sums of square roots via the subspace theorem.

[BibT_eX]

[DOI]

Matthieu Haeberle

Neta Singer

CoRR, 2023

Integer points in the degree-sequence polytope.

[BibT_eX]

[DOI]

Eleonore Bach

Rom Pinchasi

CoRR, 2023

Repetition-Structure Inference With Formal Prototypes.

[BibT_eX]

[DOI]

Proceedings of the 24th International Society for Music Information Retrieval Conference, 2023

From Approximate to Exact Integer Programming.

[BibT_eX]

[DOI]

Daniel Dadush

Thomas Rothvoss

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Metric learning for kernel ridge regression: assessment of molecular similarity.

[BibT_eX]

[DOI]

Mach. Learn. Sci. Technol., September, 2022

Approximate CVPp in time 20.802n.

[BibT_eX]

[DOI]

Moritz Venzin

J. Comput. Syst. Sci., 2022

2021

A QPTAS for stabbing rectangles.

[BibT_eX]

[DOI]

CoRR, 2021

Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time.

[BibT_eX]

[DOI]

Jana Cslovjecsek

Lars Rohwedder

Robert Weismantel

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma.

[BibT_eX]

[DOI]

Robert Weismantel

ACM Trans. Algorithms, 2020

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

[BibT_eX]

[DOI]

Moritz Venzin

CoRR, 2020

N-fold integer programming via LP rounding.

[BibT_eX]

[DOI]

Jana Cslovjecsek

Robert Weismantel

CoRR, 2020

Approximate CVPp in Time 20.802 n.

[BibT_eX]

[DOI]

Moritz Venzin

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

An Improved Analysis of Local Search for Max-Sum Diversification.

[BibT_eX]

[DOI]

Rico Zenklusen

Math. Oper. Res., 2019

An Algorithmic Theory of Integer Programming.

[BibT_eX]

[DOI]

CoRR, 2019

2018

The Support of Integer Optimal Solutions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2018

Diversity Maximization in Doubling Metrics.

[BibT_eX]

[DOI]

Sarah Morell

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Faster Algorithms for Integer Programs with Block Structure.

[BibT_eX]

[DOI]

Kim-Manuel Klein

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Geometric random edge.

[BibT_eX]

[DOI]

Santosh S. Vempala

Math. Program., 2017

Local Search for Max-Sum Diversification.

[BibT_eX]

[DOI]

Rico Zenklusen

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.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

Max-Sum Diversity Via Convex Programming.

[BibT_eX]

[DOI]

Rico Zenklusen

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015

On largest volume simplices and sub-determinants.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Node-Balancing by Edge-Increments.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

On Sub-determinants and the Diameter of Polyhedra.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

2013

Bin Packing via Discrepancy of Permutations.

[BibT_eX]

[DOI]

Dömötör Pálvölgyi

ACM Trans. Algorithms, 2013

Testing additive integrality gaps.

[BibT_eX]

[DOI]

Math. Program., 2013

Minimizing the number of lattice points in a translated polygon.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2011

Real-time Avionics Optimization.

[BibT_eX]

[DOI]

it Inf. Technol., 2011

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Covering cubes and the closest vector problem.

[BibT_eX]

[DOI]

Martin Niemeier

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

The Euclidean Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

The LLL Algorithm and Integer Programming.

[BibT_eX]

[DOI]

Karen I. Aardal

Proceedings of the LLL Algorithm - Survey and Applications, 2010

Diameter of Polyhedra: Limits of Abstraction.

[BibT_eX]

[DOI]

Alexander A. Razborov

Math. Oper. Res., 2010

Connected facility location via random facility sampling and core detouring.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Recent Hardness Results for Periodic Uni-processor Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Scheduling periodic tasks in a hard real-time environment.

[BibT_eX]

[DOI]

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Integer Programming and Algorithmic Geometry of Numbers - A tutorial.

[BibT_eX]

[DOI]

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Network Formulations of Mixed-Integer Programs.

[BibT_eX]

[DOI]

Math. Oper. Res., 2009

Algorithms for longer OLED lifetime.

[BibT_eX]

[DOI]

Andreas Karrenbauer

Chihao Xu

ACM J. Exp. Algorithmics, 2009

Coloring Fuzzy Circular Interval Graphs.

[BibT_eX]

[DOI]

Martin Niemeier

Electron. Notes Discret. Math., 2009

Constrained Minkowski Sums: A Geometric Framework for Solving Interval Problems in Computational Biology Efficiently.

[BibT_eX]

[DOI]

Thorsten Bernholt

Thomas Hofmeister

Discret. Comput. Geom., 2009

Multiline Addressing by Network Flow.

[BibT_eX]

[DOI]

Algorithmica, 2009

Diameter of polyhedra: limits of abstraction.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

New Hardness Results for Diophantine Approximation.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2009

2008

Der Euklidische Algorithmus.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

Parametric Integer Programming in Fixed Dimension.

[BibT_eX]

[DOI]

Gennady Shmonin

Math. Oper. Res., 2008

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2008

Energy-Aware Stage Illumination.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2008

Algorithms for Integer Programming.

[BibT_eX]

Bull. EATCS, 2008

Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

The stable set polytope of quasi-line graphs.

[BibT_eX]

[DOI]

Comb., 2008

Approximating connected facility location problems via random facility sampling and core detouring.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE Real-Time Systems Symposium, 2008

A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

New Approaches for Virtual Private Network Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Packing a Truck - Now with a Twist!

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2007

A geometric framework for solving subsequence problems in computational biology efficiently.

[BibT_eX]

[DOI]

Thorsten Bernholt

Thomas Hofmeister

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

0/1 Vertex and Facet Enumeration with BDDs.

[BibT_eX]

[DOI]

Markus Behle

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Carathéodory bounds for integer cones.

[BibT_eX]

[DOI]

Gennady Shmonin

Oper. Res. Lett., 2006

Mapping Task-Graphs on Distributed ECU Networks: Efficient Algorithms for Feasibility and Optimality.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Edda Happ

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

A linear algorithm for integer programming in the plane.

[BibT_eX]

[DOI]

Sören Laue

Math. Program., 2005

BDDs in a Branch and Cut Framework.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

An improved approximation algorithm for virtual private network design.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Packing a trunk: now with a twist!

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

On the complexity of fixed parameter clique and dominating set.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Theor. Comput. Sci., 2004

Point containment in the integer hull of a polyhedron.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Paolo Ventura

Oper. Res. Lett., 2003

Primal separation for 0/1 polytopes.

[BibT_eX]

[DOI]

Giovanni Rinaldi

Paolo Ventura

Math. Program., 2003

Detecting directed 4-cycles still faster.

[BibT_eX]

[DOI]

Fabrizio Grandoni

Inf. Process. Lett., 2003

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

[BibT_eX]

[DOI]

Andreas S. Schulz

Comb., 2003

A combinatorial algorithm for computing a maximum independent set in a t-perfect graph.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Faster Algorithm for Two-Variable Integer Programming.

[BibT_eX]

[DOI]

Sören Laue

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Packing a Trunk.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

Fast Integer Programming in Fixed Dimension.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2003

2002

0/1 optimization and 0/1 primal separation are equivalent.

[BibT_eX]

[DOI]

Giovanni Rinaldi

Paolo Ventura

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Cutting Planes and the Elementary Closure in Fixed Dimension.

[BibT_eX]

[DOI]

Alexander Bockmayr

Math. Oper. Res., 2001

Short vectors of planar lattices via continued fractions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

Fast 2-Variable Integer Programming.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

Fast Reduction of Ternary Quadratic Forms.

[BibT_eX]

[DOI]

Günter Rote

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

Gomory-Chvátal cutting planes and the elementary closure of polyhedra.

[BibT_eX]

[DOI]

PhD thesis, 2000

Combining Logic and Optimization in Cutting Plane Theory.

[BibT_eX]

[DOI]

Alexander Bockmayr

Proceedings of the Frontiers of Combining Systems, 2000

1999

On factor refinement in number fields.

[BibT_eX]

[DOI]

Johannes Buchmann

Math. Comput., 1999

On the Chvátal Rank of Polytopes in the 0/1 Cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

On the Membership Problem for the Elementary Closure of a Polyhedron.

[BibT_eX]

[DOI]