1: Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing
2: Simultaneous approximation for scheduling problems
3: The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable
4: Range Counting Coresets for Uncertain Data
5: Navigability on Networks: A Graph Theoretic Perspective
6: Polar Codes: Speed of polarization and polynomial gap to capacity
7: Tree-Independent Dual-Tree Algorithms
8: Efficient Computation of Mean Truncated Hitting Times on Very Large Graphs
9: A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data
10: Leaderless deterministic chemical reaction networks
11: A New Perspective on Vertex Connectivity
12: On the Benefits of Sampling in Privacy Preserving Statistical Analysis on Distributed Databases
13: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
14: PAC Quasi-automatizability of Resolution over Restricted Distributions
15: When Distributed Computation is Communication Expensive
16: Personalized PageRank to a Target Node
17: Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
18: A New Analysis of Compressive Sensing by Stochastic Proximal Gradient Descent
19: On the Approximation of Submodular Functions
20: Constraint Satisfaction over Generalized Staircase Constraints
21: MinMax-Profiles: A Unifying View of Common Intervals, Nested Common Intervals and Conserved Intervals of K Permutations
22: An optimal lower bound for monotonicity testing over hypergrids
23: Compact q-gram Profiling of Compressed Strings
24: A SAT Approach to Clique-Width
25: Upper and Lower Bounds for Weak Backdoor Set Detection
26: Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs
27: Parameterized Complexity of 1-Planarity
28: Online Makespan Minimization with Parallel Schedules
29: Tighter Upper Bounds for the Minimum Number of Calls and Rigorous Minimal Time in Fault-Tolerant Gossip Schemes
30: Tree Compression with Top Trees
31: On the structure and syntactic complexity of generalized definite languages
32: Synchronous Counting and Computational Algorithm Design