1: An improved formalism for the Grover search algorithm
2: Abstract unordered and ordered trees CRDT
3: Sitting closer to friends than enemies, revisited
4: Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
5: Dynamic Scope-Based Dijkstra’s Algorithm
6: Faster deterministic integer factorization
7: Relationships in Large-Scale Graph Computing
8: On Quantification of Anchor Placement
9: Nearly Optimal Sparse Fourier Transform
10: Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time
11: Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
12: Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
13: Division algorithms for the fixed weight subset sum problem
14: Linear Kernels on Graphs Excluding Topological Minors
15: Algebraic Relaxations and Hardness Results in Polynomial Optimization and Lyapunov Analysis
16: An Information-Theoretic Approach to PMU Placement in Electric Power Systems
17: Finding Convex Hulls Using Quickhull on the GPU
18: SparseDTW: A Novel Approach to Speed up Dynamic Time Warping
19: Spring Embedders and Force Directed Graph Drawing Algorithms