Sitting closer to friends than enemies, revisited

Sketching and Streaming Entropy via Approximation Theory

Skip Graphs

Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks

Small $\ell$-edge-covers in $k$-connected graphs

Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

Small Maximal Independent Sets and Faster Exact Graph Coloring

Small Vertex Cover makes Petri Net Coverability and Boundedness Easier

Smart Sort: Design and Analysis of a Fast, Efficient and Robust Comparison Based Internal Sort Algorithm

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time

Smoothed Analysis of Balancing Networks

Smoothed Analysis of Interior-Point Algorithms: Condition Number

Smoothed Analysis of Interior-Point Algorithms: Termination

Smoothed Performance Guarantees for Local Search

Social interaction as a heuristic for combinatorial optimization problems

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems

Solving Classical String Problems on Compressed Texts

Solving connectivity problems parameterized by treewidth in single exponential time

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels

Solving MAX-r-SAT Above a Tight Lower Bound