1: Densest Subgraph in Dynamic Graph Streams
2: Optimal Online Algorithms for the Multi-Objective Time Series Search Problem
3: Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
4: Tree Compression with Top Trees Revisited
5: Applications of Uniform Sampling: Densest Subgraph and Beyond
6: Linear Algorithm for Conservative Degenerate Pattern Matching
7: Semi-canonical binary matrices
8: Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
9: EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
10: Efficient Reverse k Nearest Neighbor evaluation for hierarchical index
11: FM-index for dummies
12: Sequential Consistency and Concurrent Data Structures
13: Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
14: On Tightly Bounding the Dubins Traveling Salesman’s Optimum
15: An Improved Distributed Algorithm for Maximal Independent Set
16: CARGO: Effective format-free compressed storage of genomic information
17: Fast Multiple Order-Preserving Matching Algorithms
18: MRF-ZOOM: A Fast Dictionary Searching Algorithm for Magnetic Resonance Fingerprinting
19: A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments
20: A New Perspective on Clustered Planarity as a Combinatorial Embedding Problem
21: Blocking optimal arborescences
22: Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices
23: An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization
24: A Faster Algorithm for Fully Dynamic Betweenness Centrality
25: Enumerating Cyclic Orientations of a Graph
26: On Euclid’s Algorithm and Elementary Number Theory
27: The computational complexity of calculating partition functions of optimal medians with Hamming distance
28: Complexity of a Disjoint Matching Problem on Bipartite Graphs
29: Private Graphon Estimation for Sparse Graphs
30: Big Step Greedy Algorithm for Maximum Coverage Problem
31: Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method
32: Inapproximability of $H$-Transversal/Packing