1: The weighted 2-metric dimension of trees in the non-landmarks model
2: Plug-and-play dual-tree algorithm runtime analysis
3: A speed and departure time optimization algorithm for the Pollution-Routing Problem
4: A Task-Type-Based Algorithm for the Energy-Aware Profit Maximizing Scheduling Problem in Heterogeneous Computing Systems
5: Smoothed Analysis of the Successive Shortest Path Algorithm
6: Mespotine-RLE-basic v0.9 - An overhead-reduced and improved Run-Length-Encoding Method
7: Stable matchings of teachers to schools
8: Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
9: A Reconfigurations Analogue of Brooks’ Theorem and its Consequences
10: Online Submodular Maximization with Preemption
11: An $O(n^{\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
12: Cooperative Greedy Pursuit Strategies for Sparse Signal Representation by Partitioning
13: Between Pure and Approximate Differential Privacy
14: Better Online Deterministic Packet Routing on Grids
15: A tie-break model for graph search
16: TSP with Time Windows and Service Time
17: Randomized sketches for kernels: Fast and optimal non-parametric regression
18: On Longest Repeat Queries
19: D-Iteration: diffusion approach for solving PageRank
20: On The Average-Case Complexity of Shellsort
21: Approximation Algorithms for P2P Orienteering and Stochastic Vehicle Routing Problem
22: Noisy Tensor Completion via the Sum-of-Squares Hierarchy
23: Improved Practical Matrix Sketching with Guarantees
24: Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets
25: Manipulating the Probabilistic Serial Rule
26: Big Data on the Rise: Testing monotonicity of distributions
27: Computing Functions of Random Variables via Reproducing Kernel Hilbert Space Representations
28: New Bounds on Optimal Sorting Networks
29: Kangaroo Methods for Solving the Interval Discrete Logarithm Problem
30: Quadratic-Time Hardness of LCS and other Sequence Similarity Measures
31: Planarity of Streamed Graphs