Traveling the boundary of Minkowski sums
- Sándor P. Fekete
- William R. Pulleyblank
- 1998
- Information Processing Letters
Publications
Date
Featured collections
Popular topics
81 results at Information Processing Letters
A tight bound for approximating the square root
- Nader H. Bshouty
- Yishay Mansour
- et al.
- 1997
- Information Processing Letters
On the number of small cuts in a graph
- Monika Henzinger
- David P. Williamson
- 1996
- Information Processing Letters
The worst-case running time of the random simplex algorithm is exponential in the height
- Andrei Z. Broder
- Martin E. Dyer
- et al.
- 1995
- Information Processing Letters
Incremental constraint deletion in systems of linear constraints
- Tien Huynh
- Kim Marriott
- 1995
- Information Processing Letters
Approximating xn efficiently
- Chandrasekhar Narayanaswami
- William Luken
- 1994
- Information Processing Letters
Consistent global checkpoints based on direct dependency tracking
- Yi-Min Wang
- Andy Lowry
- et al.
- 1994
- Information Processing Letters
Finding extremal sets in less than quadratic time
- Daniel M. Yellin
- Charanjit S. Jutla
- 1993
- Information Processing Letters
A well-characterized approximation problem
- Johan Håstad
- Steven Philips
- et al.
- 1993
- Information Processing Letters
A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
- Fillia Makedon
- Dafna Sheinwald
- et al.
- 1993
- Information Processing Letters