Discrete Applied Mathematics

Foreword
pp. 1-1(1)
Authors: Tokuyama T.; Imai H.

On the negation-limited circuit complexity of merging
pp. 3-8(6)
Authors: Amano K.; Maruoka A.; Tarui J.

A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
pp. 9-31(23)
Author: Cai J.-Y.

Improving the efficiency of parallel minimum spanning tree algorithms
pp. 33-54(22)
Authors: Chong K.W.; Han Y.; Igarashi Y.; Lam T.W.

An external memory data structure for shortest path queries
pp. 55-82(28)
Authors: Hutchinson D.; Maheshwari A.; Zeh N.

An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
pp. 83-113(31)
Author: Nagamochi H.

Theory of 2-3 Heaps
pp. 115-128(14)
Author: Takaoka T.