Discrete Applied Mathematics, Volume 24

Volume 24, Numbers 1-3, 1989

• Gena Hahn, Ivo G. Rosenberg:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Didier Arquès:
  Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. 3-23
  Electronic Edition (link) BibTeX
• C. Berge:
  A new color change to improve the coloring of a graph. 25-28
  Electronic Edition (link) BibTeX
• François Bergeron:
  Algorithms for sequential generation of combinatorial structures. 29-35
  Electronic Edition (link) BibTeX
• Anselm Blumer, Andrzej Ehrenfeucht, David Haussler:
  Average sizes of suffix trees and DAWGs. 37-45
  Electronic Edition (link) BibTeX
• Anselm Blumer, Nick Littlestone:
  Learning faster than promised by the Vapnik-Chervonenkis dimension. 47-53
  Electronic Edition (link) BibTeX
• André Bouchet:
  Matchings and -matroids. 55-62
  Electronic Edition (link) BibTeX
• Jean-Marie Bourjolly, William R. Pulleyblank:
  König-Egerváry graphs, 2-bicritical graphs and fractional matchings. 63-82
  Electronic Edition (link) BibTeX
• Srecko Brlek:
  Enumeration of factors in the Thue-Morse word. 83-96
  Electronic Edition (link) BibTeX
• Kathie Cameron:
  Induced matchings. 97-102
  Electronic Edition (link) BibTeX
• Gérard D. Cohen, Gábor Simonyi:
  Coding for write-unidirectional memories and conflict resolution. 103-114
  Electronic Edition (link) BibTeX
• Herbert Fleischner:
  Elementary proofs of (relatively) recent characterizations of Eulerian graphs. 115-119
  Electronic Edition (link) BibTeX
• Irène Guessarian:
  Fixpoint strategies for deductive databases. 121-131
  Electronic Edition (link) BibTeX
• Lucien Haddad, Ivo G. Rosenberg:
  Maximal partial clones determined by the areflexive relations. 133-143
  Electronic Edition (link) BibTeX
• Marshall Hall Jr.:
  Codes and matrices in studies on designs. 145-152
  Electronic Edition (link) BibTeX
• Yahya Ould Hamidoune:
  Factorisations courtes dans un groupe fini. 153-165
  Electronic Edition (link) BibTeX
• Simone Hazan:
  TC operations and Latin bricks. 167-177
  Electronic Edition (link) BibTeX
• Nathalie Homobono, Claudine Peyrat:
  Fault-tolerant routings in Kautz and de Bruijn networks. 179-186
  Electronic Edition (link) BibTeX
• Masami Ito, Helmut Jürgensen, Huei-Jan Shyr, Gabriel Thierrin:
  Anti-commutative languages and n-codes. 187-196
  Electronic Edition (link) BibTeX
• Jean-Claude König:
  Extensions de réseaux de connexité donnée. 197-211
  Electronic Edition (link) BibTeX
• Jacques Labelle, Yeong-Nan Yeh:
  Dyck paths of knight moves. 213-221
  Electronic Edition (link) BibTeX
• Nasser Saheb:
  Concurrency measure in commutation monoids. 223-236
  Electronic Edition (link) BibTeX
• Rodica Simion:
  Finite automata for languages of combinatorial interest: An order theoretical point of view. 237-246
  Electronic Edition (link) BibTeX
• Dan A. Simovici, Corina Reischer:
  An algebraic point of view of the data structures of database systems. 247-260
  Electronic Edition (link) BibTeX