1: Modulated String Searching
2: One-variable word equations in linear time
3: On Polynomial Kernels for Sparse Integer Linear Programs
4: On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
5: Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
6: A Polynomial Time Algorithm for Finding Area-Universal Rectangular Layouts
7: Energy-aware checkpointing of divisible tasks with soft or hard deadlines
8: Improved upper and lower bound techniques for monotone switching networks for directed connectivity
9: Faster exponential-time algorithms in graphs of bounded average degree
10: Power Strip Packing of Malleable Demands in Smart Grid
11: Approximating the optimal competitive ratio for an ancient online scheduling problem
12: Full-fledged Real-Time Indexing for Constant Size Alphabets
13: Order Preserving Matching
14: A Robust AFPTAS for Online Bin Packing with Polynomial Migration
15: Online Checkpointing with Improved Worst-Case Guarantees
16: Large Neighborhood Local Search for the Maximum Set Packing Problem
17: Constructing a genome assembly that has the maximum likelihood
18: A new algorithm for Many to Many Matching with Demands and Capacities
19: A o(n) monotonicity tester for Boolean functions over the hypercube
20: Distributed Random Walks
21: Random-walk domination in large graphs: problem definitions and fast solutions
22: Efficient Parallel and External Matching
23: Optimal information rate of secret sharing schemes on trees
24: Compactified Horizontal Visibility Graph for the Language Network
25: Constrained Signaling in Auction Design
26: Bar 1-Visibility Drawings of 1-Planar Graphs
27: Three-coloring triangle-free planar graphs in linear time
28: On the k-Independence Required by Linear Probing and Minwise Independence