1: Quantum Algorithm to Solve a Maze: Converting the Maze Problem into a Search Problem
2: Adaptive Protocols for Interactive Communication
3: Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors
4: An improved Branch-and-cut code for the maximum balanced subgraph of a signed graph
5: Near-optimal labeling schemes for nearest common ancestors
6: eXamine: a Cytoscape app for exploring annotated modules in networks
7: A distributed prime sieving algorithm based on Scheduling by Multiple Edge Reversal
8: Counting Triangulations and other Crossing-free Structures via Onion Layers
9: A Functional Approach to Standard Binary Heaps
10: Simple, compact and robust approximate string dictionary
11: A Statistical Peek into Average Case Complexity
12: On $r$-Simple $k$-Path
13: Local correlation clustering
14: Maximal induced matchings in triangle-free graphs
15: Diversities and the Geometry of Hypergraphs
16: Sparse similarity-preserving hashing
17: Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
18: A Framework for Self-Tuning Optimization Algorithm
19: A Comprehensive Analysis of Polyhedral Lift-and-Project Methods
20: Undecidability in binary tag systems and the Post correspondence problem for four pairs of words
21: Succinct representation of labeled trees
22: Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall
23: Volumetric Spanners: an Efficient Exploration Basis for Learning