1: Engineering Exact Quasi-Threshold Editing
2: The Discrete Gaussian for Differential Privacy
3: Grammar-Compressed Indexes with Logarithmic Search Time
4: Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints
5: A polynomial time algorithm to compute the connected tree-width of a series-parallel graph
6: Parameterized Analysis of Assignment Under Multiple Preferences
7: On Locating Paths in Compressed Tries
8: No Repetition: Fast Streaming with Highly Concentrated Hashing
9: Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
10: Dots & Polygons
11: From Generic Partition Refinement to Weighted Tree Automata Minimization
12: Does Comma Selection Help To Cope With Local Optima
13: R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space
14: Relative Error Streaming Quantiles
15: A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs
16: Correction to: A Practical, Provably Linear Time, In-place and Stable Merge Algorithm via the Perfect Shuffle
17: Improved bounds for coloring locally sparse hypergraphs
18: Event Clustering & Event Series Characterization on Expected Frequency
19: A new hashing based nearest neighbors selection technique for big datasets
20: Maximum parsimony distance on phylogenetictrees: a linear kernel and constant factor approximation algorithm
21: The n-dimensional k-vector and its application to orthogonal range searching
22: The Tandem Duplication Distance Problem is hard over bounded alphabets
23: Random Sampling using k-vector
24: Nonlinear Function Inversion using k-vector
25: The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood
26: A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
27: Variable Shift SDD: A More Succinct Sentential Decision Diagram
28: A Fast Algorithm for the Product Structure of Planar Graphs
29: Simultaneously Achieving Ex-ante and Ex-post Fairness
30: Dynamic Ridesharing in Peak Travel Periods
31: Distributed Processing of k Shortest Path Queries over Dynamic Road Networks
32: Indexing Highly Repetitive String Collections
33: Near-linear convergence of the Random Osborne algorithm for Matrix Balancing
34: SOPanG 2: online searching over a pan-genome without false positives
35: The Impact of Message Passing in Agent-Based Submodular Maximization
36: Approximating Min-Mean-Cycle for low-diameter graphs in near-optimal time and memory
37: On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood
38: Zipping Segment Trees