Abstract is missing.
- Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded ProcessorsSze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Peng Zhang. 3-10 [doi]
- Approximation Algorithms for Min-Max Capacitated Path CoversZhou Xu, Liang Xu. 11-18 [doi]
- Notes on Large Angle Crossing GraphsVida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle. 19-24 [doi]
- On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once FormulasKazuyuki Amano. 25-30 [doi]
- A Fixed-Parameter Algorithm for String-to-String CorrectionFaisal N. Abu-Khzam, Henning Fernau, Michael A. Langston, Serena Lee-Cultura, Ulrike Stege. 31-38 [doi]
- Control Complexity in Fallback VotingGábor Erdélyi, Jörg Rothe. 39-48 [doi]
- Kruskalian GraphsLing-Ju Hung, Ton Kloks. 49-54 [doi]
- Probe Distance-Hereditary GraphsMaw-Shang Chang, Ling-Ju Hung, Peter Rossmanith. 55-64 [doi]
- Advances on the List Stubborn ProblemSimone Dantas, Luerbio Faria, C. M. H. de Figueiredo, Sulamita Klein, Loana Tito Nogueira, Fábio Protti. 65-70 [doi]
- Simpler Backward Simulation ProofsSimon Doherty, Lindsay Groves. 71-78 [doi]
- Linear Uniform Receptiveness in a Pi-Calculus with Location FailuresPeter Finderup, Hans Hüttel, Jakob Svane Knudsen, Johannes Garm Nielsen. 79-88 [doi]
- A Relational Model of Incomplete Data without NULLsMichael Johnson, Stefano Kasangian. 89-94 [doi]