1: On the Displacement for Covering a Unit Interval with Randomly Placed Sensors
2: Snow Globe: An Advancing-Front 3D Delaunay Mesh Refinement Algorithm
3: On non-canonical solving the Satisfiability problem
4: Online Contention Resolution Schemes
5: A Provably, Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
6: Coding for interactive communication correcting insertions and deletions
7: Sparse PCA via Bipartite Matchings
8: Non-commutative Edmonds’ problem and matrix semi-invariants
9: The k-mismatch problem revisited
10: Fast Consensus under Eventually Stabilizing Message Adversaries
11: Offline and Online Models of Budget Allocation for Maximizing Influence Spread
12: Symmetries of matrix multiplication algorithms. I
13: Bin Packing Problem: Two Approximation Algorithms
14: An O(1)-Approximation for Minimum Spanning Tree Interdiction
15: Resource Oblivious Sorting on Multicores
16: A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack