Volume 2,
Number 1,
February 1989
- Jean-Paul Allouche, Péter Hajnal, Jeffrey Shallit:
Analysis of an Infinite Product Algorithm.
1-15
- Paolo M. Camerini, Horst W. Hamacher:
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking.
16-27
- Ying Cheng, N. J. A. Sloane:
Codes from Symmetry Groups, and A [32, 17, 8] Code.
28-37
- Hyeong-Ah Choi, Kazuo Nakajima, Chong S. Rim:
Graph Bipartization and via Minimization.
38-47
- Dominique de Caen, D. G. Hoffman:
Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs.
48-50
- Philippe Delsarte, Y. Kamp:
Low Rank Matrices with a Given Sign Pattern.
51-63
- S. Louis Hakimi, Edward F. Schmeichel:
A Note on the Vertex Arboricity of a Graph.
64-67
- Cor A. J. Hurkens, Alexander Schrijver:
On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems.
68-72
- Gerhard Jeaschke:
On Solving Rational Congruences.
73-90
- Howard J. Karloff:
How Long can a Euclidean Traveling Salesman Tour Be?
91-99
- Joseph W. H. Liu, Andranik Mirzaian:
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs.
100-107
- Noam Nisan, Danny Soroker:
Parallel Algorithms for Zero-One Supply-Demand Problems.
108-125
- Kazuo Sugihara, Ichiro Suzuki:
Optimal Algorithms for a Pursuit-Evasion Problem in Grids.
126-143
Volume 2,
Number 2,
May 1989
- Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Universal Graphs for Bounded-Degree Trees and Planar Graphs.
145-155
- Jonathan F. Buss, Arnold L. Rosenberg, Judson D. Knott:
Vertex Types in Book-Embeddings.
156-175
- Jianzhong Du, Joseph Y.-T. Leung:
Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length.
176-196
- Joan Feigenbaum, Ramsey W. Haddad:
On Factorable Extensions and Subgraphs of Prime Graphs.
197-218
- Dale R. Fox, S. Kingsley Gnanendran:
Recursive Solutions for the Generalized Erlang Queueing Systems.
219-230
- Gregory F. Lawler, John Sylvester:
Determining Resistances from Boundary Measurements in Finite Networks.
231-239
- Michael E. Saks:
A Robust Noncryptographic Protocol for Collective Coin Flipping.
240-244
- Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment and Partial Orders.
245-254
- Philip Todd:
A k-Tree Generalization that Characterizes Consistency of Dimensioned Engineering Drawings.
255-261
- James Allen Fill:
The Radon Transform on Zn.
262-283
Volume 2,
Number 3,
August 1989
- Miklós Ajtai, D. Karabeg, János Komlós, Endre Szemerédi:
Sorting in Average Time o(log) n.
285-292
- Stephen F. Altschul:
Leaf Pairs and Tree Dissections.
293-299
- G. M. Constantine:
On the Invertibility of the Discrete Radon Transform.
300-306
- Deborah S. Franzblau:
Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles.
307-321
- Mark K. Goldberg, Thomas H. Spencer:
Constructing a Maximal Independent Set in Parallel.
322-328
- Jeff Kahn, J. C. Lagarias, Hans S. Witsenhausen:
Single-Suit Two-Person Card Play III. The Misère Game.
329-343
- Daniel J. Kleitman:
Divisors Without Unit-Congruent Ratios.
344-349
- D. A. Lind:
Perturbations of Shifts of Finite Type.
350-365
- C. L. Mallows:
Identities Satisfied by Iterated Polynomials and (Q, x)-Binomial Coefficients.
366-370
- Rajeev Motwani, Arvind Raghunathan, Huzur Saran:
Perfect Graphs and Orthogonally Convex Covers.
371-392
- Nicholas Pippenger:
Random Sequential Adsorption on Graphs.
393-401
- Vojtech Rödl, Peter Winkler:
A Ramsey-Type Theorem for Orderings of a Graph.
402-406
- S. K. Tipnis, Leslie E. Trotter Jr.:
Node-Packing Problems with Integer Rounding Properties.
407-412
- Stephen A. Vavasis:
Gaussian Elimination with Pivoting is P-Complete.
413-423
Volume 2,
Number 4,
November 1989
- Egon Balas:
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph.
425-451
- Jean-Claude Bermond, Claudine Peyrat:
Induced Subgraphs of the Power of a Cycle.
452-455
- Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, A. Schwenk:
A Matter of Degree.
456-466
- Fan R. K. Chung:
Pebbling in Hypercubes.
467-472
- Jianzhong Du, Joseph Y.-T. Leung:
Complexity of Scheduling Parallel Task Systems.
473-487
- Geoffrey Exoo:
On Two Classical Ramsey Numbers of the Form R(3, n).
488-490
- Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
Pair Labeelings with Given Distance.
491-499
- Frank K. Hwang:
Y. C. Yao: Cutoff Point and Monotonicity Properties for Multinomial Group Testing.
500-507
- Rajeev Kohli, Ramesh Krishnamurti:
Average Performance of Heuristics for Satisfiability.
508-523
- Hanno Lefmann, Bernd Voigt:
Partitions of Aomega.
524-529
- Boris Pittel:
The Average Number of Stable Matchings.
530-549
- Paolo Serafini, Walter Ukovich:
A Mathematical Model for Periodic Scheduling Problems.
550-581
- Brigitte Servatius:
Birigidity in the Plane.
582-599
Copyright © Mon Nov 2 21:51:50 2009
by Michael Ley (ley@uni-trier.de)
