Journal: Discrete Applied Mathematics

Volume 31, Issue 3

227 -- 260Bo Chen. Tighter bound for MULTIFIT scheduling on uniform processors
261 -- 277Karel Culik II, Tero Harju. Splicing semigroups of dominoes and DNA
279 -- 289Shashidhar Kaparthi, H. Raghav Rao. Higher dimensional restricted lattice paths with diagonal steps
291 -- 298Stephan Olariu. Some aspects of the semi-perfect elimination
299 -- 308Marc Pirlot. Synthetic description of a semiorder
309 -- 0F. Cheah, Derek G. Corneil. Addendum

Volume 31, Issue 2

79 -- 0David Avis. Preface
81 -- 96Shreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru. Intersection of algebraic space curves
97 -- 111Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Computing external farthest neighbors for a simple polygon
113 -- 132Rex A. Dwyer. Convex hulls of samples from spherically symmetric distributions
133 -- 140Peter Egyed, Rephael Wenger. Ordered stabbing of pairwise disjoint convex sets in linear time
141 -- 149Komei Fukuda, Shigemasa Saito, Akihisa Tamura. Combinatorial face enumeration in arrangements and oriented matroids
151 -- 165Komei Fukuda, Shigemasa Saito, Akihisa Tamura, Takeshi Tokuyama. Bounding the number of k-faces in arrangements of hyperplanes
167 -- 180Jacob E. Goodman, Richard Pollack. The complexity of point configurations
181 -- 191Jerzy W. Jaromczyk, Miroslaw Kowaluk. Constructing the relative neighborhood graph in 3-dimensional Euclidean space
193 -- 200Hiroshi Maehara. Distances in a rigid unit-distance graph in the plane
201 -- 225William O. J. Moser. Problems, problems, problems

Volume 31, Issue 1

1 -- 21Jean-Guy Penaud. Matrice de ramification des arbres binaires
23 -- 28K. B. Reid. The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
29 -- 35Alejandro A. Schäffer. Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam
37 -- 49Paolo M. Soardi, Wolfgang Woess. Uniqueness of currents in infinite resistive networks
51 -- 69Chi Wang, A. C. Williams. The threshold order of a Boolean function
71 -- 74Srinivasa Rao Arikati, C. Pandu Rangan. An efficient algorithm for finding a two-pair, and its applications