Discrete Applied Mathematics, Volume 35

Volume 35, Number 1, January 1992

• Vladimír Baláz, Vladimir Kvasnicka, Jiri Pospichal:
  Two metrics in a graph theory modeling of organic chemistry. 1-19
  Electronic Edition (link) BibTeX
• D. Bankovic:
  Certain Boolean equations. 21-27
  Electronic Edition (link) BibTeX
• Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
  Polynomial graph-colorings. 29-45
  Electronic Edition (link) BibTeX
• Stephen J. Willson:
  Calculating growth rates and moments for additive cellular automata. 47-65
  Electronic Edition (link) BibTeX
• Peter Damaschke:
  Distances in cocomparability graphs and their powers. 67-72
  Electronic Edition (link) BibTeX
• Ulrich Faigle, Rainer Schrader:
  A greedy reduction algorithm for setup optimization. 73-79
  Electronic Edition (link) BibTeX
• Charles T. Ryan:
  Linear sections of the general linear group: A geometric approach. 81-86
  Electronic Edition (link) BibTeX

Volume 35, Number 2, January 1992

• Wenjie He, Wenchen He, Suling Xie:
  Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid. 91-106
  Electronic Edition (link) BibTeX
• Tor Helleseth:
  Legendre sums and codes related to QR codes. 107-113
  Electronic Edition (link) BibTeX
• Beverly Jamison, Stephan Olariu:
  A tree representation for P₄-sparse graphs. 115-129
  Electronic Edition (link) BibTeX
• Naoki Katoh:
  An e-approximation scheme for combinatorial optimization problems with minimum variance criterion. 131-141
  Electronic Edition (link) BibTeX
• Naoki Katoh:
  A fully polynomial time approximation scheme for minimum cost-reliability ratio problems. 143-155
  Electronic Edition (link) BibTeX
• P. Butkovic, R. A. Cuninghame-Green:
  An O(n²) algorithm for the maximum cycle mean of an n×n bivalent matrix. 157-162
  Electronic Edition (link) BibTeX
• Shigeru Masuyama:
  On the tree packing problem. 163-166
  Electronic Edition (link) BibTeX
• Owen J. Murphy:
  Computing independent sets in graphs with large girth. 167-170
  Electronic Edition (link) BibTeX

Volume 35, Number 3, March 1992

• Dominique de Werra, Alain Hertz:
  Foreword. 175-176
  Electronic Edition (link) BibTeX
• Mirjana Cangalovic, Jan A. M. Schreuder:
  Modelling and solving an acyclic multi-period timetabling problem. 177-195
  Electronic Edition (link) BibTeX
• Judit Csima, László Lovász:
  A matching algorithm for regular bipartite graphs. 197-203
  Electronic Edition (link) BibTeX
• Dominique de Werra, Jacek Blazewicz:
  Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. 205-219
  Electronic Edition (link) BibTeX
• R. Fahrion, G. Dollansky:
  Construction of university faculty timetables using logic programming techniques. 221-236
  Electronic Edition (link) BibTeX
• Jacques A. Ferland, Alain Lavoie:
  Exchanges procedures for timetabling problems. 237-253
  Electronic Edition (link) BibTeX
• Alain Hertz:
  Finding a feasible course schedule using Tabu search. 255-270
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton:
  Alternating Hamiltonian circuits in edge-coloured bipartite graphs. 271-273
  Electronic Edition (link) BibTeX
• Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki:
  Optimal strategies for some team games. 275-291
  Electronic Edition (link) BibTeX
• Alexander Rosa:
  On a class of completable partial edge-colourings. 293-299
  Electronic Edition (link) BibTeX
• Jan A. M. Schreuder:
  Combinatorial aspects of construction of competition Dutch Professional Football Leagues. 301-312
  Electronic Edition (link) BibTeX
• Arabinda Tripathy:
  Computerised decision aid for timetabling - a case analysis. 313-323
  Electronic Edition (link) BibTeX