1: Towards a provably resilient scheme for graph-based watermarking
2: A polynomial-time approximation scheme for Euclidean Steiner forest
3: Using cascading Bloom filters to improve the memory usage for de Brujin graphs
4: A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
5: An $O^(star)(1.1939^n)$ time algorithm for minimum weighted dominating induced matching
6: Scalable Cost-Aware Multi-Way Influence Maximization
7: Computable Compressed Matrices
8: Efficient long division via Montgomery multiply
9: New Online Algorithm for Dynamic Speed Scaling with Sleep State
10: Incremental Algorithms for Network Management and Analysis based on Closeness Centrality
11: Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
12: Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover
13: Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
14: Simple Curve Embedding
15: LabelRank: A Stabilized Label Propagation Algorithm for Community Detection in Networks
16: Space-Efficient Las Vegas Algorithms for K-SUM
17: Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions
18: On Resilient Graph Spanners
19: Testing Mutual Duality of Planar Graphs
20: $d$-COS-R is FPT via Interval Deletion
21: Another Disjoint Compression Algorithm for OCT