default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 4
Volume 4, Number 1, January 1982
- Harold Abelson, Andrzej Ehrenfeucht, James Fickett, Jan Mycielski:
Compositional complexity of Boolean functions. 1-10 - Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt:
Basic formulas and languages: PART II.Applications to E0L systems and forms. 11-22 - Giorgio Gallo
, Stefano Pallottino:
A new algorithm to find the shortest paths between all pairs of nodes. 23-35 - Coriolan Ghilezan:
Les derivees partielles des fonctions pseudo-booleennes generalisees. 37-45 - Thomas Zaslavsky:
Signed graphs. 47-74
Volume 4, Number 2, April 1982
- Davis Avis:
On the complexity of finding the convex hull of a set of points. 81-86 - Frank Markham Brown:
Segmental solutions of Boolean equations. 87-96 - Gerard J. Chang, Frank K. Hwang, Shen Lin:
Group testing with two defectives. 97-102 - Charles J. Colbourn, Marlene J. Colbourn, Kevin T. Phelps, Vojtech Rödl:
Colouring steiner quadruple systems. 103-111 - Cornelius Croitoru:
An analysis of the greedy algorithm for partially ordered sets. 113-117 - Peter C. Fishburn:
Monotonicity paradoxes in the theory of elections. 119-134 - Hanif D. Sherali, C. M. Shetty:
A finitely convergent procedure for facial disjunctive programs. 135-148 - Karel Culík II, Faith E. Fich, Arto Salomaa:
A homomorphic characterization of regular languages. 149-152 - Jaak Henno:
On equivalent sets of functions. 153-156
Volume 4, Number 3, June 1982
- Jürgen Dassow:
Grammars with valuations - a discrete model for self-organization of biopolymers. 161-174 - Georg Gati:
Maximizing a lower bound on the computational complexity. 175-180 - Fanica Gavril, Johanan Schönheim:
Characterization and algorithms of curve map graphs. 181-191 - Anthony Mansfield:
An algorithm for a merge recognition problem. 193-197 - Thomas D. Rogers, J. R. Pounder:
Cycle structure in discrete-density models. 199-210 - John F. Sallee:
A note on minimal triangulations of an n-cube. 211-215 - Dominique de Werra:
Minimizing irregularities in sports schedules using graph theory. 217-226 - Jaakko Astola:
A note on perfect Lee-codes over small alphabets. 227-228 - Juha Honkala:
Unique representation in number systems and L codes. 229-232 - Juha Kortelainen:
A result concerning the trios generated by commutative slip-languages. 233-236 - Grzegorz Rozenberg, R. Verraedt:
A note on the similarity depth. 237-241
Volume 4, Number 4, August 1982
- Martin Aigner:
Selecting the top three elements. 247-267 - E. Ya. Gabovich:
On spectral theory in discrete programming : References added in proof. 269-280 - T. Margush:
Distances between trees. 281-290 - Alexander Rosa, Walter D. Wallis:
Premature sets of 1-factors or how not to schedule round robin tournaments. 291-297 - Arie Tamir:
On the solution of discrete bottleneck problems. 299-302 - Uwe Zimmermann:
Minimization on submodular flows. 303-323 - Dean S. Clark:
A class of combinatorial identities. 325-327 - Gianfranco d'Atri, Claude Puech:
Probabilistic analysis of the subset-sum problem. 329-334 - Rabe von Randow:
The bank safe problem. 335-337
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 2025-12-02 23:38 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
