default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 31
Volume 31, Number 1, March 1991
- Jean-Guy Penaud:
Matrice de ramification des arbres binaires. 1-21 - K. B. Reid:
The relationship between two algorithms for decisions via sophisticated majority voting with an agenda. 23-28 - Alejandro A. Schäffer:
Recognizing brittle graphs: remarks on a paper of Hoàng and Khouzam. 29-35 - Paolo M. Soardi, Wolfgang Woess:
Uniqueness of currents in infinite resistive networks. 37-49 - Chi Wang, A. C. Williams:
The threshold order of a Boolean function. 51-69 - Srinivasa Rao Arikati, C. Pandu Rangan:
An efficient algorithm for finding a two-pair, and its applications. 71-74
Volume 31, Number 2, April 1991
- David Avis:
Preface. 79 - Shreeram S. Abhyankar, Srinivasan Chandrasekar, Vijaya Chandru:
Intersection of algebraic space curves. 81-96 - Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov
, S. Rao Kosaraju, Baruch Schieber, Subhash Suri:
Computing external farthest neighbors for a simple polygon. 97-111 - Rex A. Dwyer:
Convex hulls of samples from spherically symmetric distributions. 113-132 - Peter Egyed, Rephael Wenger:
Ordered stabbing of pairwise disjoint convex sets in linear time. 133-140 - Komei Fukuda, Shigemasa Saito, Akihisa Tamura:
Combinatorial face enumeration in arrangements and oriented matroids. 141-149 - Komei Fukuda, Shigemasa Saito, Akihisa Tamura, Takeshi Tokuyama:
Bounding the number of k-faces in arrangements of hyperplanes. 151-165 - Jacob E. Goodman, Richard Pollack:
The complexity of point configurations. 167-180 - Jerzy W. Jaromczyk, Miroslaw Kowaluk:
Constructing the relative neighborhood graph in 3-dimensional Euclidean space. 181-191 - Hiroshi Maehara:
Distances in a rigid unit-distance graph in the plane. 193-200 - William O. J. Moser:
Problems, problems, problems. 201-225
Volume 31, Number 3, May 1991
- Bo Chen:
Tighter bound for MULTIFIT scheduling on uniform processors. 227-260 - Karel Culík II, Tero Harju:
Splicing semigroups of dominoes and DNA. 261-277 - Shashidhar Kaparthi, H. Raghav Rao:
Higher dimensional restricted lattice paths with diagonal steps. 279-289 - Stephan Olariu:
Some aspects of the semi-perfect elimination. 291-298 - Marc Pirlot:
Synthetic description of a semiorder. 299-308 - F. Cheah, Derek G. Corneil:
Addendum. 309
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-15 00:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
