Volume 84, Number 1-3, May 1998
- Luitpold Babel, Stephan Olariu:
On the Structure of Graphs with Few P4s.
1-13
- Bruno Beauquier, Pavol Hell, Stephane Perennes:
Optimal Wavelength-routed Multicasting.
15-20
- Jean-Claude Bermond, Olivier Delmas, Éric Darrot, Stephane Perennes:
Hamilton Circuits in the Directed Wrapped Butterfly Network.
21-42
- Anne Berry, Jean Paul Bordat:
Separability Generalizes Dirac's Theorem.
43-53
- Xiaoqiang Cai, T. C. Edwin Cheng:
Multi-machine Scheduling with Variance Minimization.
55-70
- Manoel B. Campêlo, Sulamita Klein:
Maximum Vertex-weighted Matching in Strongly Chordal Graphs.
71-77
- Elias Dahlhaus, Marek Karpinski:
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs.
79-91
- David C. Fisher, Patricia A. McKenna, Elizabeth D. Boyer:
Hamiltonicity, Diameter, Domination, Packing, and Biclique Partitions of Mycielski's Graphs.
93-105
- Komei Fukuda, Makoto Namiki, Akihisa Tamura:
EP Theorems and Linear Complementarity Problems.
107-119
- Roberto Grossi, Elena Lodi:
Simple Planar Graph Partition into Three Forests.
121-132
- Suk-Geun Hwang, Arnold R. Kräuter:
Comparison of Permanental Bounds of (0, 1)-matrices.
133-144
- Alexandru Mateescu, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa:
Simple Splicing Systems.
145-163
- Fred R. McMorris, Henry Martyn Mulder, Fred S. Roberts:
The Median Procedure on Median Graphs.
165-181
- Andreas Parra:
Triangulating Multitolerance Graphs.
183-197
- Palash Sarkar, Rana Barua:
The Set of Reversible 90/150 Cellular Automata Is Regular.
199-213
- Akiyoshi Shioura:
Minimization of an M-convex Function.
215-220
- Ladislav Stacho, Imrich Vrto:
Bisection Width of Transposition Graphs.
221-235
- Helen Verrall:
Compatible Euler Tours of Kn**.
237-251
- Mikhail Y. Kovalyov, Yakov M. Shafransky:
Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints.
253-257
Last update Fri May 24 20:14:50 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
