1: Inapproximability of Dominating Set in Power Law Graphs
2: Every locally characterized affine-invariant property is testable
3: Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds
4: Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
5: Online Bin Packing with Advice
6: A Hierarchical Exact Accelerated Stochastic Simulation Algorithm
7: Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More
8: Sliding Windows with Limited Storage
9: New Algorithms for Position Heaps
10: One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
11: Necklaces, Convolutions, and X+Y
12: A Practical Algorithm for Topic Modeling with Provable Guarantees
13: StaticGreedy: solving the scalability-accuracy dilemma in influence maximization
14: On Dynamics in Selfish Network Creation
15: Polynomial time factoring algorithm using Bayesian arithmetic
16: A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
17: The Inverse Shapley Value Problem
18: Convex Hull and Linear Programming in Read-only Setup with Limited Work-space