1: Testing Uniformity of Stationary Distribution
2: Reversible Logic Synthesis by Quantum Rotation Gates
3: Sparse Fault-Tolerant BFS Trees
4: Thrifty Algorithms for Multistage Robust Optimization
5: Transit Node Routing Reconsidered
6: An exact algorithm with the time complexity of $O^(star)(1.299^m)$ for the weighed mutually exclusive set cover problem
7: Ising formulations of many NP problems
8: Parallel Suffix Array Construction by Accelerated Sampling
9: The Budgeted Transportation Problem
10: A Stochastic Probing Problem with Applications
11: Non-classical Correlations in the Quantum Search Algorithm
12: Directed closure measures for networks with reciprocity
13: Parallel Maximum Clique Algorithms with Applications to Network Analysis and Storage
14: Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract)
15: Near-optimal separators in string graphs
16: Why some heaps support constant-amortized-time decrease-key operations, and others do not
17: The Unified Segment Tree and its Application to the Rectangle Intersection Problem
18: Large Scale Real-time Ridesharing with Service Guarantee on Road Networks
19: Approximation Algorithms for the Loop Cutset Problem
20: Kernelization Using Structural Parameters on Sparse Graph Classes
21: Exploiting Independent Subformulas: A Faster Approximation Scheme for #k-SAT
22: The Fresh-Finger Property
23: Parallel Peeling Algorithms