1: Approximately Optimal Mechanism Design
2: Cluster Editing with Vertex Splitting
3: Clique-Width for Hereditary Graph Classes
4: Almost Optimal Distribution-free Junta Testing
5: Platoon Forming Algorithms for Intelligent Street Intersections
6: Towards the Locality of Vizing’s Theorem
7: Real-Time EEG Classification via Coresets for BCI Applications
8: Efficient Race Detection with Futures
9: A modified greedy algorithm to improve bounds for the vertex cover number
10: A Fast Sketch Method for Mining User Similarities over Fully Dynamic Graph Streams
11: The Product Knapsack Problem: Approximation and Complexity
12: Mergeable Dictionaries With Shifts
13: Sparsification of Binary CSPs
14: Text line Segmentation in Compressed Representation of Handwritten Document using Tunneling Algorithm
15: Quantum Insertion-Deletion Channels
16: About the Complexity of Two-Stage Stochastic IPs
17: Faster and Smaller Two-Level Index for Network-based Trajectories
18: Sheaves: A Topological Approach to Big Data
19: New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
20: Smaller Cuts, Higher Lower Bounds
21: Communication cost of consensus for nodes with limited memory
22: Approximate-Closed-Itemset Mining for Streaming Data Under Resource Constraint
23: Multiple Set Matching and Pre-Filtering with Bloom Multifilters