Abstract is missing.
- Computational Geometric and Combinatorial Approaches to Digital HalftoningTetsuo Asano. 3 [doi]
- Geometric spanners with few edges and degree fiveMichiel H. M. Smid. 7-9 [doi]
- Graph Orientation Algorithms to Minimize the Maximum OutdegreeYuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo. 11-20 [doi]
- Multilayer Grid Embeddings of Iterated Line DigraphsToro Hasunuma. 21-26 [doi]
- Compositional Type Systems for Stack-Based Low-Level LanguagesAndo Saabas, Tarmo Uustalu. 27-39 [doi]
- Mechanically Verifying Correctness of CPS CompilationYe Henry Tian. 41-51 [doi]
- Formalising the L4 microkernel APIRafal Kolanski, Gerwin Klein. 53-68 [doi]
- Combinatorial Generation by Fusing Loopless AlgorithmsTadao Takaoka, Stephen Violich. 69-77 [doi]
- The Busy Beaver, the Placid Platypus and other Crazy CreaturesJames Harland. 79-86 [doi]
- A Polynomial Algorithm for Codes Based on Directed GraphsA. V. Kelarev. 87-92 [doi]
- On the complexity of the DNA Simplified Partial Digest ProblemJacek Blazewicz, Marta Kasprzak. 93-100 [doi]
- On the Approximability of Maximum and Minimum Edge Clique Partition ProblemsAnders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson. 101-105 [doi]
- Faster Algorithms for Finding Missing PatternsShuai Cheng Li. 107-111 [doi]
- On the Logical Implication of Multivalued Dependencies with Null ValuesSebastian Link. 113-122 [doi]
- Boolean equation solving as graph traversalBrian Herlihy, Peter Schachte, Harald Søndergaard. 123-132 [doi]
- Learnability of Term Rewrite Systems from Positive ExamplesM. R. K. Krishna Rao. 133-137 [doi]
- On-demand Bounded Broadcast Scheduling with Tight DeadlinesChung Keung Poon, Feifeng Zheng, Yinfeng Xu. 139-143 [doi]
- Greedy algorithms for on-line set-covering and related problemsGiorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos. 145-151 [doi]