default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 8
Volume 8, Number 1, April 1984
- Martin Aigner, M. Fromme:
A game of cops and robbers. 1-12 - Jaakko Astola:
On the asymptotic behaviour of Lee-codes. 13-23 - Charles J. Colbourn:
The complexity of completing partial Latin squares. 25-30 - Edward J. Farrell, S. A. Wahid:
Matchings in pentagonal chains. 31-40 - Dan Gusfield:
Matroid optimization with the interleaving of two ordered sets. 41-50 - Hiroshi Hashimoto:
Transitive reduction of a nilpotent boolean matrix. 51-61 - András Recski:
A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae. 63-68 - Dale Skrien:
Chronological orderings of interval graphs. 69-83 - Craig A. Tovey
:
A simplified NP-complete satisfiability problem. 85-89 - Stephen J. Willson:
Cellular automata can generate fractals. 91-99 - J. L. Hock, R. B. McQuistan:
A note on the occupational degeneracy for dimers on a saturated two-dimensional lattice space. 101-104
Volume 8, Number 2, May 1984
- Susan F. Assmann, Daniel J. Kleitman:
Characterization of curve map graphs. 109-124 - Djangir A. Babayev, Fred W. Glover:
Aggregation of nonnegative integer-valued equations. 125-130 - Hans-Jürgen Bandelt, Jean-Pierre Barthélemy:
Medians in median graphs. 131-142 - Paola Bertolazzi, Claudio Leporelli, Mario Lucertini:
Alternative group relaxation of integer programming problems. 143-151 - Hiroshi Hashimoto:
Transitive reduction of a rectangular boolean matrix. 153-161 - Laurie B. Hopkins, William T. Trotter, Douglas B. West:
The interval number of a complete multipartite graph. 163-187 - Ernesto de Queirós Vieira Martins:
An algorithm to determine a path with minimal cost/capacity ratio. 189-194 - Bernard Péroche:
NP-completeness of some problems of partitioning and covering in graphs. 195-208 - Anni Sajo:
On subword complexity functions. 209-212
Volume 8, Number 3, July 1984
- Jean-Paul Allouche, Christine Reder:
Oscillations spatio-temporelles engendrees par un automate cellulaire. 215-254 - Harvey J. Greenberg, J. Richard Lundgren, John S. Maybee:
Inverting graphs of rectangular matrices. 255-265 - Amnon Naamad, D. T. Lee, Wen-Lian Hsu:
On the maximum empty rectangle problem. 267-277 - Madeleine Paoli:
Comparison of mean distance in superposed networks. 279-287 - György Turán:
On the succinct representation of graphs. 289-294 - Douglas B. West, David B. Shmoys:
Recognizing graphs with fixed interval number is NP-complete. 295-305 - Cun-Quan Zhang:
Optimal alphabetic binary tree for a nonregular cost function. 307-312 - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
On regularity of languages generated by copying systems. 313-317 - Eric Goles, Maurice Tchuenté:
Iterative behaviour of one-dimensional threshold automata. 319-322
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 2024-11-22 19:43 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:
