Abstract is missing.
- Register Allocation via Coloring of Chordal GraphsJens Palsberg. 3
- Constructing Optimal HighwaysHee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff. 7-14 [doi]
- Computing a Minimum-Dilation Spanning Tree is NP-hardOtfried Cheong, Herman J. Haverkort, Mira Lee. 15-24 [doi]
- On The Complexity of Manipulating ElectionsTom Coleman, Vanessa Teague. 25-33 [doi]
- Termination of Abstract Reduction SystemsJeremy E. Dawson, Rajeev Goré. 35-43 [doi]
- On the Power of Structural Violations in Priority QueuesAmr Elmasry, Claus Jensen, Jyrki Katajainen. 45-53 [doi]
- A Linear Time Algorithm for Pricing European Sequential Barrier OptionsPeng Gao, Ron van der Meyden. 55-62 [doi]
- Fast Exponential-Time Algorithms for the Forest Counting in Graph ClassesHeidi Gebauer, Yoshio Okamoto. 63-69 [doi]
- Analysis of Busy Beaver Machines via Induction ProofsJames Harland. 71-78 [doi]
- An Optimal Broadcasting Protocol for Mobile Video-on-DemandRegant Y. S. Hung, Hing-Fung Ting. 79-84 [doi]
- Some Structural and Geometric Properties of Two-Connected Steiner NetworksK. Hvam, L. Reinhardt, Pawel Winter, Martin Zachariasen. 85-90 [doi]
- Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected GraphsToshimasa Ishii. 91-100 [doi]
- Probabilistic Logic under UncertaintyAudun Jøsang. 101-110 [doi]
- Constructing Strictly Positive FamiliesPeter Morris, Thorsten Altenkirch, Neil Ghani. 111-121 [doi]
- An efficient solution method for relaxed variants of the nesting problemBenny K. Nielsen. 123-130 [doi]
- Planning with Time Limits in BDI Agent Programming LanguagesLavindra de Silva, Anthony Dekker, James Harland. 131-139 [doi]
- An open problem: (4; g)-cages with odd g /gt;= 5 are tightly connectedJianmin Tang, Camino Balbuena, Yuqing Lin, Mirka Miller. 141-144 [doi]
- Effective Prediction and its Computational ComplexityRichard Taylor. 145-151 [doi]
- Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small RateTomoyuki Yamakami. 153-162 [doi]