1: Mining (maximal) span-cores from temporal networks
2: Shortest Paths with Ordinal Weights
3: Enumerating Top-k Quasi-Cliques
4: Approximately counting bases of bicircular matroids
5: Recent progress on scaling algorithms and applications
6: Level Planarity: Transitivity vs. Even Crossings
7: Submodular Maximization with Matroid and Packing Constraints in Parallel
8: Consistent Sampling with Replacement
9: Differentially Private Change-Point Detection
10: Capacity of Locally Recoverable Codes
11: Fully Dynamic MIS in Uniformly Sparse Graphs
12: Algorithms and Bounds for Drawing Directed Graphs
13: Improved approximation algorithms for hitting 3-vertex paths
14: On RAC Drawings of Graphs with one Bend per Edge
15: A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution
16: Hashing-Based-Estimators for Kernel Density in High Dimensions
17: Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity
18: Graph reduction with spectral and cut guarantees
19: Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs
20: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
21: An improved upper bound on the integrality ratio for the $s$-$t$-path TSP
22: Pole Dancing: 3D Morphs for Tree Drawings
23: Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators