Volume 4,
Number 1,
February 1991
- James Abello:
The Weak Bruhat Order of SSigma, Consistent Sets, and Catalan Numbers.
1-16 BibTeX
- Daniel Bienstock, Ervin Györi:
An Extremal Problem on Sparse 0-1 Matrices.
17-27 BibTeX
- Maurizio A. Bonuccelli:
A Polynomial Time Optimal Algorithm for Satellite-Switched Time-Division Multiple Access Satellite Communications with General Switching Modes.
28-35 BibTeX
- Benny Chor, Eyal Kushilevitz:
A Zero-One Law for Boolean Privacy.
36-47 BibTeX
- Edward G. Coffman Jr., Peter W. Shor:
A Simple Proof of the O(sqrt(n log3/4 n) Upright Matching Bound.
48-57 BibTeX
- Philippe Flajolet, Michèle Soria:
The Cycle Construction.
58-60 BibTeX
- Donald K. Friesen, Michael A. Langston:
Analysis of a Compound bin Packing Algorithm.
61-79 BibTeX
- Hortensia Galeana-Sánchez, L. Pastrana Ramírez, H. A. Rincón-Mejía:
Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph.
80-83 BibTeX
- Toshihide Ibaraki, Svatopluk Poljak:
Weak Three-Linking in Eulerian Digraphs.
84-98 BibTeX
- Daniel J. Kleitman, Douglas B. West:
Spanning Trees with Many Leaves.
99-106 BibTeX
- Tomasz Luczak, Andrzej Rucinski:
Tree-Matchings in Graph Processes.
107-120 BibTeX
- Nicholas Pippenger:
The Expected Capacity of Concentrators.
121-129 BibTeX
- Alexander Schrijver:
Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs.
130-138 BibTeX
- Roberto Tamassia, Ioannis G. Tollis:
Representations of Graphs on a Cylinder.
139-149 BibTeX
Volume 4,
Number 2,
May 1991
- Fawzi Al-Thukair, Andrzej Pelc, Ivan Rival, Jorge Urrutia:
Motion Planning, Two-Directional Point Representations, and Ordered Sets.
151-163 BibTeX
- Ian F. Blake, Khun Kith:
On the Complete Weight Enumerator of Reed-Solomon Codes.
164-171 BibTeX
- Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems.
172-181 BibTeX
- Tuvi Etzion, Alan Hartman:
Towards a Large Set of Steiner Quadruple Systems.
182-195 BibTeX
- Zoltán Füredi:
Maximal Independent Subsets in Steiner Systems and in Planar Sets.
196-199 BibTeX
- Eric Goles Ch., Servet Martínez A.:
Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions.
200-206 BibTeX
- Michelangelo Grigni, David Peleg:
Tight Bounds on Minimum Broadcast Networks.
207-222 BibTeX
- Jan Kratochvíl, Anna Lubiw, Jaroslav Nesetril:
Noncrossing Subgraphs in Topological Layouts.
223-244 BibTeX
- Cheng Ng, Daniel S. Hirschberg:
Three-Dimensional Stable Matching Problems.
245-252 BibTeX
- Jeffrey B. Remmel, Mei Yang:
Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series.
253-274 BibTeX
- Louis W. Shapiro, A. B. Stephens:
Bootstrap Percolation, the Schröder Numbers, and the N-Kings Problem.
275-280 BibTeX
- Philip K. McKinley, N. Hasan, Ran Libeskind-Hadas, C. L. Liu:
Disjoint Covers in Replicated Heterogeneous Arrays.
281-292 BibTeX
- Martin Dowd:
An Integer Program for Codes.
293-303 BibTeX
Volume 4,
Number 3,
August 1991
Volume 4,
Number 4 November 1991
- Peter Alles, Jaroslav Nesetril, Svatopluk Poljak:
Extendability, Dimensions, and Diagrams of Cycle Orders.
453-471 BibTeX
- Shay Assaf, Eli Upfal:
Fault Tolerant Sorting Networks.
472-480 BibTeX
- Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Deterministic Decomposition of Recursive Graph Classes.
481-501 BibTeX
- Ernest F. Brickell, Douglas R. Stinson:
The Detection of Cheaters in Threshold Schemes.
502-510 BibTeX
- Mee Yee Chan, Shiang-Jen Lee:
On the Existence of Hamiltonian Circuits in Faulty Hypercubes.
511-527 BibTeX
- Dominique de Werra, Ph. Solot:
Compact Cylindrical Chromatic Scheduling.
528-534 BibTeX
- Andreas W. M. Dress, Timothy F. Havel:
Bound Smoothing under Chirality Constraints.
535-549 BibTeX
- Arie Tamir:
Obnoxious Facility Location on Graphs.
550-567 BibTeX
- Clara Chan:
Plane Trees and H-Vectors of Shellable Cubical Complexes.
568-574 BibTeX
- Stanley Xi Wang, Edward C. Waymire:
A Large Deviation Rate and Central Limit Theorem for Horton Ratios.
575-588 BibTeX
Copyright © Sun May 17 00:18:59 2009
by Michael Ley (ley@uni-trier.de)
