Discrete Applied Mathematics, Volume 75

Volume 75, Number 1, May 1997

• Béla Bollobás, Imre Leader:
  Matchings and Paths in the Cube. 1-8
  Electronic Edition (link) BibTeX
• Alice M. Dean, Joan P. Hutchinson:
  Rectangle-visibility Representations of Bipartite Graphs. 9-25
  Electronic Edition (link) BibTeX
• Peter Firby, Julie Haviland:
  Independence and Average Distance in Graphs. 27-37
  Electronic Edition (link) BibTeX
• Peter C. Fishburn, Peter Schwander, Larry A. Shepp, Robert J. Vanderbei:
  The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming. 39-61
  Electronic Edition (link) BibTeX
• Martin Gavalec:
  Computing Matrix Period in Max-min Algebra. 63-70
  Electronic Edition (link) BibTeX
• Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
  Stage-graph Representations. 71-80
  Electronic Edition (link) BibTeX
• Sang Kyu Lee, A. Duksu Oh, Hongsik Choi, Hyeong-Ah Choi:
  Optimal Transmission Schedules in TWDM Optical Passive Star Networks. 81-91
  Electronic Edition (link) BibTeX
• Abraham P. Punnen, Yash P. Aneja:
  Minimum Dispersion Problems. 93-102
  Electronic Edition (link) BibTeX
• Zhi-Long Chen:
  Parallel Machine Scheduling with Time Dependent Processing Times. 103
  Electronic Edition (link) BibTeX

Volume 75, Number 2, May 1997

• Roberto De Prisco, Alfredo De Santis:
  Catastrophic Faults in Reconfigurable Systolic Linear Arrays. 105-123
  Electronic Edition (link) BibTeX
• Christine Garcia, Claudine Peyrat:
  Large Cayley Graphs on an Abelian Group. 125-133
  Electronic Edition (link) BibTeX
• Klaus Jansen, Petra Scheffler:
  Generalized Coloring for Tree-like Graphs. 135-155
  Electronic Edition (link) BibTeX
• Roger Labahn, André Raspaud:
  Periodic Gossiping in Back-to-back Trees. 157-168
  Electronic Edition (link) BibTeX
• Silvano Martello, François Soumis, Paolo Toth:
  Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines. 169-188
  Electronic Edition (link) BibTeX
• Alex D. Scott:
  Better Bounds for Perpetual Gossiping. 189-197
  Electronic Edition (link) BibTeX
• T. J. N. Brown, Roger B. Mallion, Paul Pollak, Arnd Roth:
  Some Methods for Counting the Spanning Trees in Labelled Molecular Graphs, Examined in Relation to Certain Fullerenes. 199-200
  Electronic Edition (link) BibTeX

Volume 75, Number 3, June 1997

• Igor Averbakh, Oded Berman:
  (p - 1)/(p + 1)-approximate Algorithms for P-traveling Salesmen Problems on a Tree with Minmax Objective. 201-216
  Electronic Edition (link) BibTeX
• Yves Crama, Oya Ekin, Peter L. Hammer:
  Variable and Term Removal From Boolean Formulae. 217-230
  Electronic Edition (link) BibTeX
• Isabelle Fagnot:
  On the Subword Equivalence Problem for Morphic Words. 231-253
  Electronic Edition (link) BibTeX
• Satoshi Fujita, Arthur M. Farley:
  Minimum-cost Line Broadcast in Paths. 255-268
  Electronic Edition (link) BibTeX
• Jan Gorodkin:
  Orbits of Boolean Functions. 269-275
  Electronic Edition (link) BibTeX
• Yehuda Roditty, Barack Shoham:
  On Broadcasting Multiple Messages in a D-dimensional Grid. 277-284
  Electronic Edition (link) BibTeX
• Constantine Stivaros, Klaus Sutner:
  Computing Optimal Assignments for Residual Network Reliability. 285-295
  Electronic Edition (link) BibTeX