1: A Faster Counting Protocol for Anonymous Dynamic Networks
2: Per-bucket concurrent rehashing algorithms
3: Quantum walk speedup of backtracking algorithms
4: Optimizing Static and Adaptive Probing Schedules for Rapid Event Detection
5: Absorbing random-walk centrality: Theory and algorithms
6: Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs
7: Practical and Optimal LSH for Angular Distance
8: On the Multidimensional Stable Marriage Problem
9: Explicit Bounds for Nondeterministically Testable Hypergraph Parameters
10: Two betweenness centrality measures based on Randomized Shortest Paths
11: Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs
12: Online Buy-at-Bulk Network Design
13: Multi-Attribute Proportional Representation
14: Local structure can identify and quantify influential global spreaders in large scale social networks
15: A comparative analysis of progressive multiple sequence alignment approaches using UPGMA and neighbor joining based guide trees
16: Hardness of Online Sleeping Combinatorial Optimization Problems
17: Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width
18: Minimum parametric flow over time
19: An Impossibility Result for Housing Markets with Fractional Endowments
20: Dropping Convexity for Faster Semi-definite Optimization
21: Approximability of TSP on Power Law Graphs
22: Fast Greedy Approaches for Compressive Sensing of Large-Scale Signals
23: Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee