Volume 66,
Number 1,
15 April 1998
Volume 66,
Number 2,
29 April 1998
Volume 66,
Number 3,
15 May 1998
- Ernst Althaus, Kurt Mehlhorn:
Maximum Network Flow with Floating Point Arithmetic.
109-113
Electronic Edition (link) BibTeX
- Chongkye Rhee:
On the Chromatic Index of Graphs with 2m + 1 Vertices and 2m2 Edges.
115-118
Electronic Edition (link) BibTeX
- Nakhoon Baek, Sung Yong Shin:
On Circularly-Hidden Surface Removal.
119-123
Electronic Edition (link) BibTeX
- Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia:
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments.
125-126
Electronic Edition (link) BibTeX
- Guoliang Xue, Shangzhi Sun, J. Ben Rosen:
Fast Data Transmission and Maximal Dynamic Flow.
127-132
Electronic Edition (link) BibTeX
- Chan-Su Shin, Sung Kwon Kim, Sung-Ho Kim, Kyung-Yong Chwa:
Algorithms for Drawing Binary Trees in the Plane.
133-139
Electronic Edition (link) BibTeX
- Seongyeol Kim, Ilyong Chung:
Application of the Special Latin Square to a Parallel Routing Algorithm on a Recursive Circulant Network.
141-147
Electronic Edition (link) BibTeX
- Bruce E. Litow, Bernard Mans:
A Note on the Ádám Conjecture for Double Loops.
149-153
Electronic Edition (link) BibTeX
- Vassil S. Dimitrov, Graham A. Jullien, William C. Miller:
An Algorithm for Modular Exponentiation.
155-159
Electronic Edition (link) BibTeX
- Carlos Cabrelli, Ursula Molter:
A Linear Time Algorithm for a Matching Problem on the Circle.
161-164
Electronic Edition (link) BibTeX
Volume 66,
Number 4,
29 May 1998
- Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara:
On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram.
165-170
Electronic Edition (link) BibTeX
- Sándor P. Fekete, William R. Pulleyblank:
Traveling the Boundary of Minkowski Sums.
171-174
Electronic Edition (link) BibTeX
- Esteban Feuerstein, Stefano Leonardi, Alberto Marchetti-Spaccamela, Nicola Santoro:
Efficient Token-Based Control in Rings.
175-180
Electronic Edition (link) BibTeX
- Krzysztof Diks, Stefan Dobrev, Evangelos Kranakis, Andrzej Pelc, Peter Ruzicka:
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
181-186
Electronic Edition (link) BibTeX
- Youzou Miyadera, Koushi Anzai, Hiroshi Unno, Takeo Yaku:
Depth-First Layout Algorithm for Trees.
187-194
Electronic Edition (link) BibTeX
- Hiroshi G. Okuno, Shin-ichi Minato, Hideki Isozaki:
On the Properties of Combination Set Operations.
195-199
Electronic Edition (link) BibTeX
- Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu:
Fault Tolerant Token Ring Embedding in Double Loop Networks.
201-207
Electronic Edition (link) BibTeX
- Hiro Ito, Mitsuo Yokoyama:
Linear Time Algorithms for Graph Search and Connectivity Determination on Complement Graphs.
209-213
Electronic Edition (link) BibTeX
- Wei-Kuo Chiang, Rong-Jaye Chen:
On the Arrangement Graph.
215-219
Electronic Edition (link) BibTeX
Volume 66,
Number 5,
16 June 1998
Special Issue on Parallel Models
Volume 66,
Number 6,
30 June 1998
- Christos Makris, Athanasios K. Tsakalidis:
Algorithms for Three-Dimensional Dominance Searching in Linear Space.
277-283
Electronic Edition (link) BibTeX
- Masaaki Mizuno, Mikhail Nesterenko:
A Transformation of Self-Stabilizing Serial Model Programs for Asynchronous Parallel Computing Environments.
285-290
Electronic Edition (link) BibTeX
- S. Schwarz, Sven Oliver Krumke:
On Budget-Constrained Flow Improvement.
291-297
Electronic Edition (link) BibTeX
- A. Salhi, Hugh Glaser, David De Roure:
Parallel Implementation of a Genetic-Programming Based Tool for Symbolic Regression.
299-307
Electronic Edition (link) BibTeX
- Jiun-Liang Chen, Feng-Jian Wang:
An Inheritance Flow Model for Class Hierarchy Analysis.
309-315
Electronic Edition (link) BibTeX
- Tsu-Miin Hsieh, Yi-Shiung Yeh, Yung-Cheng Hsieh, Chan-Chi Wang:
A Homophonic DES.
317-320
Electronic Edition (link) BibTeX
- Gianluca De Marco, Ugo Vaccaro:
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults.
321-326
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:04:04 2009
by Michael Ley (ley@uni-trier.de)
