| 1 | -- | 16 | Srinivasa Rao Arikati, Anil Maheshwari, Christos D. Zaroliagis. Efficient Computation of Implicit Representations of Sparse Graphs |
| 17 | -- | 26 | Tiffany M. Barnes, Carla D. Savage. Efficient Generation of Graphical Partitions |
| 27 | -- | 40 | Kenneth A. Berman, Yanpei Liu. Generalized Bicycles |
| 41 | -- | 50 | Maw-Shang Chang, Chung-Chang Hsu. On Minimum Intersection of Two Minimum Dominating Sets of Interval Graphs |
| 51 | -- | 60 | Ding-Zhu Du, Biao Gao, Weili Wu. A Special Case for Subset Interconnection Designs |
| 61 | -- | 74 | Josep Fàbrega, Marisa Zaragozá. Fault-tolerant Routings in Double Fixed-step Networks |
| 75 | -- | 87 | Peter C. Fishburn, Frank K. Hwang, Ding-Zhu Du, Biao Gao. On 1-rate Wide-sense Nonblocking for 3-stage Clos Networks |
| 89 | -- | 102 | Pierre Hansen, Giovanni Storchi, Tsevi Vovor. Paths with Minimum Range and Ratio of Arc Lengths |
| 103 | -- | 116 | Toru Hasunuma, Yukio Shibata. Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books |
| 117 | -- | 132 | Kevin I.-J. Ho, Joseph Y.-T. Leung, W.-D. Wei. Scheduling Imprecise Computation Tasks with 0/1-constraint |
| 133 | -- | 152 | Gyula Y. Katona. Edge Disjoint Polyp Packing |
| 153 | -- | 162 | Suh-Ryung Kim, Fred S. Roberts. Competition Numbers of Graphs with a Small Number of Triangles |
| 163 | -- | 174 | Khee Meng Koh, Eng Guan Tay. Optimal Orientations of Products of Paths and Cycles |
| 175 | -- | 187 | George J. Kyparisis, Christos Koulamas. Open Shop Scheduling with Maximal Machines |
| 189 | -- | 205 | Haiko Müller. Recognizing Interval Digraphs and Interval Bigraphs in Polynomial Time |
| 207 | -- | 226 | Madan Natu, Shu-Cherng Fang. The Point-to-point Connection Problem - Analysis and Algorithms |
| 227 | -- | 233 | Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi. k-Path Partitions in Trees |
| 235 | -- | 249 | Bernhard von Stengel, Ralph Werchner. Complexity of Searching an Immobile Hider in a Graph |
| 251 | -- | 282 | Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen. A Potential Reduction Approach to the Frequency Assignment Problem |
| 283 | -- | 289 | Ryan B. Hayward. Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac |
| 291 | -- | 298 | Wing Ning Li. Two-segmented Channel Routing Is Strong NP-complete |