1: Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem
2: Popular conjectures imply strong lower bounds for dynamic problems
3: Reliable Communication in a Dynamic Network in the Presence of Byzantine Faults
4: Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms
5: Customizable Contraction Hierarchies
6: A Bound on the Expected Optimality of Random Feasible Solutions to Combinatorial Optimization Problems
7: Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games
8: Optimal Rectangle Packing: An Absolute Placement Approach
9: NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
10: A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
11: Quantum Algorithm for Linear Regression
12: Interval scheduling and colorful independent sets
13: Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes (extended version)
14: Approximation Algorithms for Covering and Packing Problems on Paths
15: The Analysis of Kademlia for random IDs
16: Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond
17: A Three-Phase Search Approach for the Quadratic Minimum Spanning Tree Problem
18: Dual Query: Practical Private Query Release for High Dimensional Data
19: A note on ‘Exact and approximate methods for a one-dimensional minimax bin-packing problem’ [Annals of Operations Research (2013) 206:611-626]