1: Finding the True Frequent Itemsets
2: Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
3: Short lists with short programs in short time
4: On the Complexity of $t$-Closeness Anonymization and Related Problems
5: On Pairwise Spanners
6: In-situ associative permuting
7: Efficient Approximation for Triangulation of Minimum Treewidth
8: Pre-processing for Triangulation of Probabilistic Networks
9: Efficient Stepwise Selection in Decomposable Models
10: A Clustering Approach to Solving Large Stochastic Matching Problems
11: A Linear Time Algorithm for the Feasibility of Pebble Motion on Graphs
12: Completely Positive formulation of the Graph Isomorphism Problem
13: A simple online competitive adaptation of Lempel-Ziv compression with efficient random access support
14: Connecting Terminals and 2-Disjoint Connected Subgraphs
15: Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time
16: ALGORITHM 937: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems
17: Robust Optimization under Multi-band Uncertainty - Part I: Theory
18: Constraint Expressions and Workflow Satisfiability
19: On Byzantine Broadcast in Planar Graphs
20: Confluently Persistent Sets and Maps