Volume 1,
Number 1,
February 1988
- Pierre Baldi:
Neural Networks, Acyclic Orientations of the Hypercube, and Sets of Orthogonal Vectors.
1-13
- Daniel Bienstock:
Asymptotic Analysis of some Network Reliability Models.
14-21
- David A. Carlson:
Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded fas Fourier Transforms.
22-37
- Xian M. Chang, Frank K. Hwang, J. F. Weng:
Optimal Detection of Two Defectives with a Parity Check Device.
38-44
- Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham:
On the Fractional Covering Number of Hypergraphs.
45-49
- M. Haimovich, Thomas L. Magnanti:
Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location.
50-64
- Ker-I Ko:
Searching for Two Objects by Underweight Feedback.
65-70
- János Körner, Katalin Marton:
Graphs that Split Entropies.
71-79
- Mike Paterson:
Universal Chains and Wiring Layouts.
80-85
- Gregory J. E. Rawlins, Peter Widmayer, Derick Wood:
Hole Problems for Rectangles in the Plane.
86-97
- Dwijendra K. Ray-Chaudhuri, N. M. Singhi:
On Existence of t-Designs with Large v and lambda.
98-104
- Bruce E. Sagan:
A Note on Independent Sets in Trees.
105-108
- Ákos Seress:
Quick Gossiping by Conference Calls.
109-120
- Bernd Sturmfels:
Some Applications of Affine Gale Diagrams to Polytopes with few Vertices.
121-133
- Roderick T. Worley:
The Voronoi Region of E*7.
134-141
- Martin Dowd:
Questions Related to the Erdös-Turan Conjecture.
142-150
Volume 1,
Number 2,
May 1988
- Jason I. Brown, Charles J. Colbourn:
A Set System Polynomial with Colouring and Reliability Applications.
151-157
- Paul Feldman, Joel Friedman, Nicholas Pippenger:
Wide-Sense Nonblocking Networks.
158-173
- Peter L. Hammer, Bruno Simeone, Thomas M. Liebling, Dominique de Werra:
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions.
174-184
- Joan P. Hutchinson:
On Short Noncontractible Cycles in Embedded Graphs.
185-192
- Abraham Lempel, Marcelo J. Weinberger:
Self-Complementary Normal Bases in Finite Fields.
193-198
- Fred S. Roberts, Yonghua Xu:
On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids.
199-222
- J. M. S. Simoes Pereira:
An Optimality Criterion for Graph Embeddings of Metrics.
223-229
- Douglas R. Stinson, Scott A. Vanstone:
A Combinatorial Approach to Threshold Schemes.
230-236
- Walter Whiteley:
The Union of Matroids and the Rigidity of Frameworks.
237-255
- Y. C. Yao, Frank K. Hwang:
A Fundamental Monotonicity in Group Testing.
256-259
- Bing Zhou:
Almost Every Randomly Near-Traceable Graph Has Diameter at Most Two.
260-268
Volume 1,
Number 3,
August 1988
- Noga Alon, Yossi Azar:
Sorting, Approximate Sorting, and Searching in Rounds.
269-280
- Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray:
The Complexity of Colouring by Semicomplete Digraphs.
281-298
- Earl R. Barnes, Anthony Vannelli, James Q. Walker:
A New Heuristic for Partitioning the Nodes of a Graph.
299-305
- Paola Bertolazzi, Antonio Sassano:
A Class of Polynomially Solvable Set-Covering Problems.
306-316
- Alan A. Bertossi, Allessandro Gori:
Total Domination and Irredundance in Weighted Interval Graphs.
317-327
- Béla Bollobás, Fan R. K. Chung:
The Diameter of a Cycle Plus a Random Matching.
328-333
- Peter C. Fishburn, Helen M. Marcus-Roberts, Fred S. Roberts:
Unique Finite Difference Measurement.
334-354
- János Körner, Gábor Simonyi:
Separating Partition System and Locally Different Sequences.
355-359
- Carl Langenhop, William E. Wright:
Certain Occupancy Numbers via an Algorithm for Computing Their Ratios.
360-371
- Svatopluk Poljak, Vojtech Rödl, Joel Spencer:
Tournament Ranking with Expected Profit in Polynomial Time.
372-376
- Arie Tamir:
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures.
377-396
- Gábor Tardos:
Polynomial Bound for a Chip Firing Game on Graphs.
397-398
- Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson:
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).
399-410
Volume 1,
Number 4,
November 1988
- Benny Chor, Mihály Geréb-Graus:
On the Influence of Single Participant in Coin Flipping Schemes.
411-415
- Ding-Zhu Du, Zevi Miller:
Matroids and Subset Interconnection Design.
416-424
- Dominique Foata, Doron Zeilberger:
Laguerre Polynomials, Weighted Derangements, and Positivity.
425-433
- Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs.
434-446
- Ramsey W. Haddad, Alejandro A. Schäffer:
Recognizing Bellman-Ford-Orderable Graphs.
447-471
- Pavol Hell, David G. Kirkpatrick, Jan Kratochvíl, Igor Kríz:
On Restricted Two-Factors.
472-484
- G. A. Heuer, W. Dow Rieder:
Silverman Games on Disjoint Discrete Sets.
485-525
- Hal A. Kierstead:
The Linearity of First-Fit Coloring of Interval Graphs.
526-530
- Arthur L. Liestman, Joseph G. Peters:
Broadcast Networks of Bounded Degree.
531-540
- Michael Anthony Steel:
Distribution of the Symmetric Difference Metric on Phylogenetic Trees.
541-551
- Peter Winkler:
The Complexity of Metric Realization.
552-559
Copyright © Fri Dec 4 20:35:11 2009
by Michael Ley (ley@uni-trier.de)
