1: Reticulation-visible networks
2: Approximation Algorithm for Minimum Weight $(k,m)$-CDS Problem in Unit Disk Graph
3: Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions
4: A Practical O(R\log\log n+n) time Algorithm for Computing the Longest Common Subsequence
5: Dual-Based Approximation Algorithms for Cut-Based Network Connectivity Problems
6: Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer
7: On the Displacement for Covering a $d-$dimensional Cube with Randomly Placed Sensors
8: Formulations and algorithms for the multiple depot, fuel-constrained, multiple vehicle routing problem
9: Dense Subset Sum may be the hardest
10: Cardinality Estimation Meets Good-Turing
11: A Parallel Algorithm to Test Chordality of Graphs
12: The Stable Fixtures Problem with Payments
13: Deterministic Broadcasting and Gossiping with Beeps
14: Full-text and Keyword Indexes for String Searching
15: Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?
16: Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis
17: A dual descent algorithm for node-capacitated multiflow problems and its applications
18: On the tails of the limiting Quicksort distribution