1: Prediction strategies without loss
2: Social interaction as a heuristic for combinatorial optimization problems
3: Fully Automatic Trunk Packing with Free Placements
4: Consecutive ones property testing: cut or swap
5: Combinatorial Approximation Algorithms for MaxCut using Random Walks
6: A Full Derandomization of Schoening’s k-SAT Algorithm
7: Hybrid tractability of soft constraint problems
8: Cluster Editing: Kernelization based on Edge Cuts
9: Evacuation of rectilinear polygons