1: Learning restricted Bayesian network structures
2: Engineering Multilevel Graph Partitioning Algorithms
3: Domination When the Stars Are Out
4: Testing of sequences by simulation
5: Modelling dynamic programming problems by generalized d-graphs
6: An Algorithm for the Graph Crossing Number Problem
7: Weighted Random Sampling over Data Streams
8: (\alpha, \beta) Fibonacci Search
9: String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)
10: Infinite computable version of Lovasz Local Lemma
11: Real-Time Sorting of Binary Numbers on One-Dimensional CA
12: A Simulation of Oblivious Multi-Head One-Way Finite Automata by Real-Time Cellular Automata
13: A tight bound on the worst-case number of comparisons for Floyd’s heap construction algorithm
14: Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models
15: Lower Bounds for the Smoothed Number of Pareto optimal Solutions
16: On Tuning the Bad-Character Rule: the Worst-Character Rule