Volume 96, Number 1, 16 October 2005
, Jérôme Leroux
: The convex hull of a regular set of integer vectors is polyhedral and effectively computable.
: A mutual exclusion algorithm with optimally bounded bypasses.
Volume 96, Number 2, 31 October 2005
Volume 96, Number 3, 15 November 2005
: The labeled perfect matching in bipartite graphs.
: Partial known plaintext attack on Koyama scheme.
Volume 96, Number 4, 30 November 2005
: Minimum degree triangulation for rectangular domains.
Volume 96, Number 5, 16 December 2005
: An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem.
Volume 96, Number 6, 31 December 2005
, Kun-Mao Chao
: Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint.
: On the P versus NP intersected with co-NP question in communication complexity.
: De Bruijn sequences and De Bruijn graphs for a general language.