1: Engineering Faster Sorters for Small Sets of Items
2: Multi-level Graph Drawing using Infomap Clustering
3: Interactive Duplicate Search in Software Documentation
4: Covering convex bodies and the Closest Vector Problem
5: Generalized Metric Repair on Graphs
6: Clustered Hierarchical Entropy-Scaling Search of Astronomical and Biological Data
7: Exact inference under the perfect phylogeny model
8: On VR Spatial Query for Dual Entangled Worlds
9: The QuaSEFE Problem
10: Revisiting Consistent Hashing with Bounded Loads
11: Simultaneous Representation of Proper and Unit Interval Graphs
12: Maximizing Ink in Partial Edge Drawings of k-plane Graphs
13: Parameterized Algorithms for Book Embedding Problems
14: Mixed Linear Layouts: Complexity, Heuristics, and Experiments
15: A Center in Your Neighborhood: Fairness in Facility Location
16: When a Dollar Makes a BWT
17: Subadditive Load Balancing
18: Circle Graph Isomorphism in Almost Linear Time
19: Optimization over Degree Sequences of Graphs
20: Graph Stories in Small Area
21: Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
22: A parallel priority queue with fast updates for GPU architectures
23: Constraint Generation Algorithm for the Minimum Connectivity Inference Problem
24: Multi-stage and Multi-customer Assortment Optimization with Inventory Constraints
25: Private Stochastic Convex Optimization with Optimal Rates
26: Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth
27: Partial Sums on the Ultra-Wide Word RAM
28: Learning Very Large Graphs with Unknown Vertex Distributions
29: Statistical and Computational Trade-Offs in Kernel K-Means
30: Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds
31: Streaming and Batch Algorithms for Truss Decomposition
32: One-Exact Approximate Pareto Sets
33: Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries
34: Bloom filter variants for multiple sets: a comparative assessment
35: DDSketch: A fast and fully-mergeable quantile sketch with relative-error guarantees