Volume 75,
Number 1,
May 1997
- Béla Bollobás, Imre Leader:
Matchings and Paths in the Cube.
1-8
- Alice M. Dean, Joan P. Hutchinson:
Rectangle-visibility Representations of Bipartite Graphs.
9-25
- Peter Firby, Julie Haviland:
Independence and Average Distance in Graphs.
27-37
- Peter C. Fishburn, Peter Schwander, Larry A. Shepp, Robert J. Vanderbei:
The Discrete Radon Transform and Its Approximate Inversion Via Linear Programming.
39-61
- Martin Gavalec:
Computing Matrix Period in Max-min Algebra.
63-70
- Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Stage-graph Representations.
71-80
- Sang Kyu Lee, A. Duksu Oh, Hongsik Choi, Hyeong-Ah Choi:
Optimal Transmission Schedules in TWDM Optical Passive Star Networks.
81-91
- Abraham P. Punnen, Yash P. Aneja:
Minimum Dispersion Problems.
93-102
- Zhi-Long Chen:
Parallel Machine Scheduling with Time Dependent Processing Times.
103
Volume 75,
Number 2,
May 1997
- Roberto De Prisco, Alfredo De Santis:
Catastrophic Faults in Reconfigurable Systolic Linear Arrays.
105-123
- Christine Garcia, Claudine Peyrat:
Large Cayley Graphs on an Abelian Group.
125-133
- Klaus Jansen, Petra Scheffler:
Generalized Coloring for Tree-like Graphs.
135-155
- Roger Labahn, André Raspaud:
Periodic Gossiping in Back-to-back Trees.
157-168
- Silvano Martello, François Soumis, Paolo Toth:
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
169-188
- Alex D. Scott:
Better Bounds for Perpetual Gossiping.
189-197
- 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
Volume 75,
Number 3,
June 1997
Copyright © Thu Nov 26 19:40:18 2009
by Michael Ley (ley@uni-trier.de)
