Journal: Discrete Applied Mathematics

Volume 12, Issue 3

195 -- 201Alan A. Bertossi, Maurizio A. Bonuccelli. A polynomial feasibility test for preemptive periodic scheduling of unrelated processors
203 -- 213Maurizio A. Bonuccelli. Dominating sets and domatic number of circular arc graphs
215 -- 231Jean Paul Bordat. Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes
233 -- 239Derek G. Corneil. The complexity of generalized clique packing
241 -- 260A. A. Elimam, Salah E. Elmaghraby. On the reduction method for integer linear programs, II
261 -- 277Eric Goles Chacc, Françoise Fogelman-Soulié, Didier Pellegrin. Decreasing energy functions as a tool for studying threshold networks
279 -- 291Michel Habib, Roland Jégou. N-free posets as generalizations of series-parallel posets
293 -- 302R. E. Krichevsky, B. Ya. Ryabko. Universal retrieval trees
303 -- 318Ten-Hwang Lai, Alan P. Sprague. On the complexity of a family of generalized matching problems

Volume 12, Issue 2

93 -- 101Christian Choffrut, Juhani Karhumäki. Test sets for morphisms with bounded delay
103 -- 114Stefan M. Dodunekov, Nikolai L. Manev. An improvement of the Griesmer bound for some small minimum distances
115 -- 122Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen. A morphic representation of EOL languages and other ETOL languages
123 -- 138Joan Feigenbaum, John Hershberger, Alejandro A. Schäffer. A polynomial time algorithm for finding the prime factors of cartesian-product graphs
139 -- 146Richard A. Games. Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial
147 -- 154Pierre Hansen, Brigitte Jaumard. Uniquely solvable quadratic boolean equations
155 -- 164Frank Harary, J. Richard Lundgren, John S. Maybee. On signed digraphs with all cycles negative
165 -- 173Ales Pultr, J. Úlehla. Remarks on strategies in combinatorial games
175 -- 189Grzegorz Rozenberg, R. Verraedt. On erasing in EOL forms
191 -- 194Peter C. Fishburn. A characterization of uniquely representable interval graphs

Volume 12, Issue 1

1 -- 11Alain Billionnet, Michel Minoux. Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
13 -- 20Ronald V. Book. The base of the intersection of two free submonoids
21 -- 29Rainer E. Burkard, Ulrich Fincke. Probabilistic asymptotic properties of some combinatorial optimization problems
31 -- 40J. S. Frame, Dennis Crippen Gilliland. Votes and a half-binomial
41 -- 56Friedrich Otto. Classes of regular and context-free languages over countably infinite alphabets
57 -- 69Uri N. Peled, Bruno Simeone. Polynomial-time algorithms for regular set-covering and threshold synthesis
71 -- 80Yehoshua Perl, Uzi Vishkin. Efficient implementation of a shifting algorithm
81 -- 87Richard P. Stanley. On dimer coverings of rectangles of fixed width
89 -- 92Jeremy P. Spinrad, Gopalakrishnan Vijayan. Worst case analysis of a graph coloring algorithm