1: Split Scheduling with Uniform Setup Times
2: A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
3: Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace
4: Convergence to Equilibrium of Logit Dynamics for Strategic Games
5: Fast Algorithms for Reconciliation under Hybridization and Incomplete Lineage Sorting
6: Root optimization of polynomials in the number field sieve
7: Core stability in hedonic coalition formation
8: A space efficient streaming algorithm for triangle counting using the birthday paradox
9: The Complexity of Planar Boolean #CSP with Complex Weights
10: Reconstruction of Integers from Pairwise Distances
11: Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs
12: Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
13: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
14: New Invariants for the Graph Isomorphism Problem
15: Constant-Competitive Prior-Free Auction with Ordered Bidders
16: Polynomial Value Iteration Algorithms for Detrerminstic MDPs
17: Optimal Time Bounds for Approximate Clustering
18: An Efficient Algorithm to Calculate the Center of the Biggest Inscribed Circle in an Irregular Polygon
19: Approximation Algorithms for the Joint Replenishment Problem with Deadlines
20: A Parameterized Approximation Algorithm for The Shallow-Light Steiner Tree Problem
21: Optimal Cuts and Partitions in Tree Metrics in Polynomial Time