A Polynomial Algorithm for the Two-Variable Integer Programming Problem

On the parallel complexity of integer programming

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures

On parallel complexity of integer linear programming, GCD and the iterated mod function

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

Proportionate progress: a notion of fairness in resource allocation

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

A Fast Algorithm for the Two-Variable Integer Programming Problem

Journal of the ACM (JACM)

Finite-resolution hidden surface removal

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Fast 2-Variable Integer Programming

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

Non-standard approaches to integer programming

Discrete Applied Mathematics

Reducing the coefficients of a two-dimensional integer linear constraint

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis

Efficient lattice width computation in arbitrary dimension

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery

Integer programming

Algorithms and theory of computation handbook

Computing efficiently the lattice width in any dimension

Theoretical Computer Science

The exact lattice width of planar sets and minimal arithmetical thickness

IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis

Description of 2-integer continuous knapsack polyhedra

Discrete Optimization

A polynomial algorithm for a one machine batching problem

Operations Research Letters

An integral transformation for integer programming problems

Operations Research Letters

An exact algorithm for large unbounded knapsack problems

Operations Research Letters