| Publication | Date of Publication | Type |
|---|
| An improved bound on sums of square roots via the subspace theorem | 2025-11-24 | Paper |
Sparse integer programming is fixed-parameter tractable
Mathematics of Operations Research | 2025-09-30 | Paper |
Reducibility bounds of objective functions over the integers
Operations Research Letters | 2024-06-17 | Paper |
scientific article; zbMATH DE number 7788439 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Forall-exist statements in pseudopolynomial time | 2023-11-13 | Paper |
From approximate to exact integer programming
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity
(available as arXiv preprint) | 2023-09-20 | Paper |
| Approximate CVP_p in Time 2^{0.802 n} | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7561387 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Approximate CVP\(_p\) in time \(2^{0.802n}\)
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Faster Algorithms for Integer Programs with Block Structure
(available as arXiv preprint) | 2021-07-28 | Paper |
An improved analysis of local search for max-sum diversification
Mathematics of Operations Research | 2020-04-30 | Paper |
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
ACM Transactions on Algorithms | 2019-12-02 | Paper |
0/1 vertex and facet enumeration with BDDs
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Minimizing the number of lattice points in a translated polygon
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
A note on non-degenerate integer programs with small sub-determinants
Operations Research Letters | 2019-01-11 | Paper |
The support of integer optimal solutions
SIAM Journal on Optimization | 2018-08-03 | Paper |
Local Search for Max-Sum Diversification
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6850361 (Why is no real title available?) | 2018-03-15 | Paper |
Max-sum diversity via convex programming
(available as arXiv preprint) | 2018-01-30 | Paper |
| Recent results around the diameter of polyhedra | 2017-11-06 | Paper |
Energy-aware stage illumination
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Diameter of polyhedra: limits of abstraction
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
On largest volume simplices and sub-determinants
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Bin packing via discrepancy of permutations | 2017-09-29 | Paper |
Geometric random edge
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
Node-balancing by edge-increments
Algorithms - ESA 2015 | 2015-11-19 | Paper |
| Point containment in the integer hull of a polyhedron | 2015-08-03 | Paper |
Bin packing via discrepancy of permutations
ACM Transactions on Algorithms | 2014-12-05 | Paper |
| An improved approximation algorithm for virtual private network design | 2014-10-13 | Paper |
On sub-determinants and the diameter of polyhedra
Discrete & Computational Geometry | 2014-09-19 | Paper |
On sub-determinants and the diameter of polyhedra
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
| EDF-schedulability of synchronous periodic task systems is coNP-hard | 2014-05-22 | Paper |
| Testing additive integrality gaps | 2014-05-22 | Paper |
Algorithms for longer OLED lifetime
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
Top | 2013-11-28 | Paper |
Testing additive integrality gaps
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Coloring fuzzy circular interval graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Pope Gregory, the calendar, and continued fractions
Documenta Mathematica | 2013-04-17 | Paper |
Coloring fuzzy circular interval graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
Set Covering with Ordered Replacement: Additive and Multiplicative Gaps
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Parametric integer programming in fixed dimension
Mathematics of Operations Research | 2011-04-27 | Paper |
Diameter of polyhedra: limits of abstraction
Mathematics of Operations Research | 2011-04-27 | Paper |
Network Formulations of Mixed-Integer Programs
Mathematics of Operations Research | 2011-04-27 | Paper |
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Scheduling periodic tasks in a hard real-time environment
Automata, Languages and Programming | 2010-09-07 | Paper |
Solving an avionics real-time scheduling problem by advanced IP-methods
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764866 (Why is no real title available?) | 2010-08-06 | Paper |
Integer programming and algorithmic geometry of numbers
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
The LLL algorithm and integer programming
The LLL Algorithm | 2010-03-05 | Paper |
Fast integer programming in fixed dimension
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Packing a trunk
Lecture Notes in Computer Science | 2010-03-03 | Paper |
New Hardness Results for Diophantine Approximation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently
Discrete & Computational Geometry | 2009-07-06 | Paper |
Multiline addressing by network flow
Algorithmica | 2009-05-06 | Paper |
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Logical Methods in Computer Science | 2009-04-29 | Paper |
Detecting directed 4-cycles still faster
Information Processing Letters | 2009-04-28 | Paper |
Convexly independent subsets of the Minkowski sum of planar point sets
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Convexly independent subsets of the Minkowski sum of planar point sets
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
| A geometric framework for solving subsequence problems in computational biology efficiently | 2009-02-12 | Paper |
The stable set polytope of quasi-line graphs
Combinatorica | 2008-10-21 | Paper |
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
Automata, Languages and Programming | 2008-08-28 | Paper |
ENERGY-AWARE STAGE ILLUMINATION
International Journal of Computational Geometry & Applications | 2008-08-26 | Paper |
New Approaches for Virtual Private Network Design
SIAM Journal on Computing | 2008-06-19 | Paper |
PACKING A TRUCK — NOW WITH A TWIST!
International Journal of Computational Geometry & Applications | 2008-05-20 | Paper |
Carathéodory bounds for integer cones
Operations Research Letters | 2008-03-28 | Paper |
Multiline Addressing by Network Flow
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
| scientific article; zbMATH DE number 5165610 (Why is no real title available?) | 2007-06-19 | Paper |
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Cutting Planes and the Elementary Closure in Fixed Dimension
Mathematics of Operations Research | 2005-11-11 | Paper |
A linear algorithm for integer programming in the plane
Mathematical Programming. Series A. Series B | 2005-04-19 | Paper |
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2119756 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079379 (Why is no real title available?) | 2004-07-28 | Paper |
Bounds on the Chvatal rank of polytopes in the 0/1-cube
Combinatorica | 2003-12-14 | Paper |
A compact linear program for testing optimality of perfect matchings.
Operations Research Letters | 2003-11-25 | Paper |
Primal separation for 0/1 polytopes
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1852135 (Why is no real title available?) | 2003-01-09 | Paper |
Short vectors of planar lattices via continued fractions
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1757949 (Why is no real title available?) | 2002-06-20 | Paper |
| scientific article; zbMATH DE number 1342126 (Why is no real title available?) | 2001-06-26 | Paper |
On the Chvátal rank of polytopes in the 0/1 cube
Discrete Applied Mathematics | 2001-03-04 | Paper |
| scientific article; zbMATH DE number 1538005 (Why is no real title available?) | 2000-12-03 | Paper |
On the membership problem for the elementary closure of a polyhedron
Combinatorica | 1999-12-08 | Paper |
On factor refinement in number fields
Mathematics of Computation | 1998-12-03 | Paper |
