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