1: The Cascading Haar Wavelet algorithm for computing the Walsh-Hadamard Transform
2: Improving and extending the testing of distributions for shape-restricted properties
3: PSVR - Self-stabilizing Publish/Subscribe Communication for Ad-hoc Networks
4: Nash Social Welfare, Matrix Permanent, and Stable Polynomials
5: Clifford algebras meet tree decompositions
6: A Topological Algorithm for Determining How Road Networks Evolve Over Time
7: Random Popular Matchings with Incomplete Preference Lists
8: Scheduling Under Power and Energy Constraints
9: Finding long simple paths in a weighted digraph using pseudo-topological orderings
10: Low-complexity Image and Video Coding Based on an Approximate Discrete Tchebichef Transform
11: Popularity in the generalized Hospital Residents Setting
12: A Practical Algorithm for Packing Tubes and Boxes
13: Separating Overlapped Intervals on a Line
14: Linear kernels for edge deletion problems to immersion-closed graph classes
15: On Intersection of Conjugate Subgoups
16: Differentially-Private Counting of Users’ Spatial Regions
17: Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm
18: How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
19: On the Group and Color Isomorphism Problems
20: Multi-label Methods for Prediction with Sequential Data
21: Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs
22: Scenic Routes Now: Efficiently Solving the Time-Dependent Arc Orienteering Problem
23: Exponential Separations in the Energy Complexity of Leader Election
24: Median-of-k Jumplists and Dangling-Min BSTs
25: Efficient Algorithms for Scheduling Moldable Tasks
26: Cut Tree Construction from Massive Graphs
27: The Subset Assignment Problem for Data Placement in Caches
28: On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion
29: Anytime Discovery of a Diverse Set of Patterns with Monte Carlo Tree Search
30: The Power of Data Reduction for Matching
31: Graph partitioning and a componentwise PageRank algorithm