Volume 3,
Number 1,
February 1990
- Hans-Jürgen Bandelt:
Recognition of Tree Metrics.
1-6 BibTeX
- Amotz Bar-Noy, Joseph Naor:
Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments.
7-20 BibTeX
- Béla Bollobás, Graham Brightwell:
Parallel Selection with High Probability.
21-31 BibTeX
- Béla Bollobás, Imre Leader:
An Isoperimetric Inequality on the Discrete Torus.
32-37 BibTeX
- M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald:
On the Distribution of Lengths of Evolutionary Trees.
38-47 BibTeX
- Olivier Goldschmidt, Dorit S. Hochbaum:
A Fast Perfect-Matching Algorithm in Random Graphs.
48-57 BibTeX
- Olivier Goldschmidt, Dorit S. Hochbaum:
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph.
58-73 BibTeX
- Péter Hajnal, Endre Szemerédi:
Brooks Coloring in Parallel.
74-80 BibTeX
- Maria M. Klawe, Daniel J. Kleitman:
An Almost Linear Time Algorithm for Generalized Matrix Searching.
81-97 BibTeX
- Anna Lubiw:
The Boolean Basis Problem and How to Cover Some Polygons by Rectangles.
98-115 BibTeX
- Jean-Luc Petit, Eric Térouanne:
A Theory of Proportional Representation.
116-139 BibTeX
- Muzhong Wang, Ian F. Blake:
Bit Serial Multiplication in Finite Fields.
140-148 BibTeX
- Jiang Zeng:
Calcul Saalschützien des Partitions et des Dérangements Colorés.
149-156 BibTeX
Volume 3,
Number 2,
May 1990
Volume 3,
Number 3,
August 1990
- Kenneth A. Berman, Mokhtar H. Konsowa:
Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains.
311-319 BibTeX
- Daniel Bienstock, Ernest F. Brickell, Clyde L. Monma:
On the Structure of Minimum-Weight k-Connected Spanning Networks.
320-329 BibTeX
- Nader H. Bshouty, Gadiel Seroussi:
Generalizations of the Normal Basis Theorem of Finite Fields.
330-337 BibTeX
- John Cremona, Susan Landau:
Shrinking Lattice Polyhedra.
338-348 BibTeX
- Ding-Zhu Du, Frank K. Hwang:
Optimal Assembly of an s-Stage k-OUT-OF-n System.
349-354 BibTeX
- Peter Frankl:
Canonical Antichains on the Circle and Applications.
355-363 BibTeX
- Gholamreza B. Khosrovshahi, S. Ajoodani-Namini:
A New Basis for Trades.
364-372 BibTeX
- Daniel J. Kleitman, Rakesh Vohra:
Computing the Bandwidth of Interval Graphs.
373-375 BibTeX
- Shlomo Moran, Yaron Wolfstahl:
One-Page Book Embedding Under Vertex-Neighborhood Constraints.
376-390 BibTeX
- Takao Nishizeki, Kenichi Kashiwagi:
On the 1.1 Edge-Coloring of Multigraphs.
391- BibTeX
410
- Hanif D. Sherali, Warren P. Adams:
A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems.
411-430 BibTeX
- Cun-Quan Zhang:
Finding Critical Independent Sets and Critical Vertex Subsets are Polynomial Problems.
431-438 BibTeX
Volume 3,
Number 4,
November 1990
Copyright © Wed Jun 4 19:18:27 2008
by Michael Ley (ley@uni-trier.de)
