Discrete Applied Mathematics, Volume 36

Volume 36, Number 1, March 1992

• Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
  New clique and independent set algorithms for circle graphs. 1-24
  Electronic Edition (link) BibTeX
• J. Mark Keil, Doug Schaefer:
  An optimal algorithm for finding dominating cycles in circular-arc graphs. 25-34
  Electronic Edition (link) BibTeX
• Marek Kubale:
  Some results concerning the complexity of restricted colorings of graphs. 35-46
  Electronic Edition (link) BibTeX
• Giri Narasimhan, Rachel Manber:
  Stability number and chromatic number of tolerance graphs. 47-56
  Electronic Edition (link) BibTeX
• Dominique Roelants van Baronaigien, Frank Ruskey:
  Generating permutations with given ups and downs. 57-65
  Electronic Edition (link) BibTeX
• Zhang Fu-ji, Maolin Zheng:
  Generalized hexagonal systems with each hexagon being resonant. 67-73
  Electronic Edition (link) BibTeX
• Leizhen Cai, John A. Ellis:
  Edge colouring line graphs of unicyclic graphs. 75-82
  Electronic Edition (link) BibTeX
• Reinhard Franzkeit:
  A binary search problem on graphs. 83-86
  Electronic Edition (link) BibTeX
• András Kornai, Zsolt Tuza:
  Narrowness, pathwidth, and their application in natural language processing. 87-92
  Electronic Edition (link) BibTeX

Volume 36, Number 2, April 1992

• Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
  Sparse broadcast graphs. 97-130
  Electronic Edition (link) BibTeX
• Keith Edwards:
  The complexity of some graph colouring problems. 131-140
  Electronic Edition (link) BibTeX
• Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski:
  Indexing functions and time lower bounds for sorting on a mesh-connected computer. 141-152
  Electronic Edition (link) BibTeX
• Martin Juvan, Bojan Mohar:
  Optimal linear labelings and eigenvalues of graphs. 153-168
  Electronic Edition (link) BibTeX
• Bojan Mohar:
  A domain monotonicity theorem for graphs and Hamiltonicity. 169-177
  Electronic Edition (link) BibTeX
• Uwe Zimmermann:
  Negative circuits for flows and submodular flows. 179-189
  Electronic Edition (link) BibTeX
• Luisa Gargano, János Körner, Ugo Vaccaro:
  Search problems for two irregular coins with incomplete feedback: the underweight model. 191-197
  Electronic Edition (link) BibTeX
• Yannis Manoussakis:
  A linear-time algorithm for finding Hamiltonian cycles in tournaments. 199-201
  Electronic Edition (link) BibTeX
• C. Pandu Rangan, Ramesh Govindan:
  An O(n log n) algorithm for a maxmin location problem. 203-205
  Electronic Edition (link) BibTeX
• Chi Wang, A. C. Williams:
  Addendum to the threshold order of a Boolean function. 207
  Electronic Edition (link) BibTeX

Volume 36, Number 3, May 1992

• Hocine Belouadah, Marc E. Posner, Chris N. Potts:
  Scheduling with release dates on a single machine to minimize total weighted completion time. 213-231
  Electronic Edition (link) BibTeX
• Srimat T. Chakradhar, Michael L. Bushnell:
  A solvable class of quadratic 0-1 programming. 233-251
  Electronic Edition (link) BibTeX
• Jan Kratochvíl, Svatopluk Poljak:
  Compatible 2-factors. 253-266
  Electronic Edition (link) BibTeX
• Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
  The point-to-point delivery and connection problems: complexity and algorithms. 267-292
  Electronic Edition (link) BibTeX
• Walter D. Morris Jr.:
  The maximum number of complementary facets of a simplicial polytope. 293-298
  Electronic Edition (link) BibTeX
• Luisa Gargano, V. Montouri, G. Setaro, Ugo Vaccaro:
  An improved algorithm for quantitative group testing. 299-306
  Electronic Edition (link) BibTeX
• Ferenc Gécseg, Balázs Imreh:
  Finite isomorphically complete systems. 307-311
  Electronic Edition (link) BibTeX
• Xuding Zhu:
  A simple proof of the multiplicativity of directed cycles of prime power length. 313-316
  Electronic Edition (link) BibTeX