External Links

    Journal: Discrete Applied Mathematics

    Volume 8, Issue 3

    215 -- 254Jean-Paul Allouche, Christine Reder. Oscillations spatio-temporelles engendrees par un automate cellulaire
    255 -- 265Harvey J. Greenberg, J. Richard Lundgren, John S. Maybee. Inverting graphs of rectangular matrices
    267 -- 277Amnon Naamad, D. T. Lee, Wen-Lian Hsu. On the maximum empty rectangle problem
    279 -- 287M. Paoli. Comparison of mean distance in superposed networks
    289 -- 294György Turán. On the succinct representation of graphs
    295 -- 305Douglas B. West, David B. Shmoys. Recognizing graphs with fixed interval number is NP-complete
    307 -- 312Cun-Quan Zhang. Optimal alphabetic binary tree for a nonregular cost function
    313 -- 317Andrzej Ehrenfeucht, Grzegorz Rozenberg. On regularity of languages generated by copying systems
    319 -- 322Eric Goles, Maurice Tchuente. Iterative behaviour of one-dimensional threshold automata

    Volume 8, Issue 2

    109 -- 124Susan F. Assmann, Daniel J. Kleitman. Characterization of curve map graphs
    125 -- 130Djangir A. Babayev, Fred Glover. Aggregation of nonnegative integer-valued equations
    131 -- 142Hans-Jürgen Bandelt, Jean-Pierre Barthélemy. Medians in median graphs
    143 -- 151Paola Bertolazzi, C. Leporelli, M. Lucertini. Alternative group relaxation of integer programming problems
    153 -- 161Hiroshi Hashimoto. Transitive reduction of a rectangular boolean matrix
    163 -- 187Laurie B. Hopkins, William T. Trotter, Douglas B. West. The interval number of a complete multipartite graph
    189 -- 194Ernesto de Queirós Vieira Martins. An algorithm to determine a path with minimal cost/capacity ratio
    195 -- 208Bernard Péroche. NP-completeness of some problems of partitioning and covering in graphs
    209 -- 212Anni Sajo. On subword complexity functions

    Volume 8, Issue 1

    1 -- 12Martin Aigner 0001, M. Fromme. A game of cops and robbers
    13 -- 23Jaakko Astola. On the asymptotic behaviour of Lee-codes
    25 -- 30Charles J. Colbourn. The complexity of completing partial Latin squares
    31 -- 40E. J. Farrell, S. A. Wahid. Matchings in pentagonal chains
    41 -- 50Dan Gusfield. Matroid optimization with the interleaving of two ordered sets
    51 -- 61Hiroshi Hashimoto. Transitive reduction of a nilpotent boolean matrix
    63 -- 68András Recski. A network theory approach to the rigidity of skeletal structures part II. Laman's theorem and topological formulae
    69 -- 83Dale Skrien. Chronological orderings of interval graphs
    85 -- 89Craig A. Tovey. A simplified NP-complete satisfiability problem
    91 -- 99Stephen J. Willson. Cellular automata can generate fractals
    101 -- 104J. L. Hock, R. B. McQuistan. A note on the occupational degeneracy for dimers on a saturated two-dimensional lattice space
    runs on