1: Efficient Algorithms for Geometric Partial Matching
2: Matching strings in encoded sequences
3: Determining satisfiability of 3-SAT in polynomial time
4: Two Mutual Exclusion Algorithms for Shared Memory
5: A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings
6: Algorithms to compute the Burrows-Wheeler Similarity Distribution
7: On the tractability of the maximum clique problem
8: Syntactic View of Sigma-Tau Generation of Permutations
9: Testing isomorphism of circular-arc graphs in polynomial time
10: A Tight Runtime Analysis for the cGA on Jump Functions—EDAs Can Cross Fitness Valleys at No Extra Cost
11: Malleable scheduling beyond identical machines
12: Probabilistic Analysis of Facility Location on Random Shortest Path Metrics