1: Theoretical and Practical Aspects of the Linear Tape Scheduling Problem
2: Massively Parallel Approximate Distance Sketches
3: Optimal terminal dimensionality reduction in Euclidean space
4: Mechanism Design for Social Good
5: A Systematic Framework and Characterization of Influence-Based Network Centrality
6: A belief propagation algorithm based on domain decomposition
7: Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming
8: Approximating the Quadratic Transportation Metric in Near-Linear Time
9: Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities
10: Smoothed Online Optimization for Regression and Control
11: Faster approximation algorithms for computing shortest cycles on weighted graphs
12: A Maximum Edge-Weight Clique Extraction Algorithm Based on Branch-and-Bound
13: Scheduling computations with provably low synchronization overheads
14: Minsum $k$-Sink Problem on Path Networks
15: Lower Bounds for Oblivious Data Structures
16: Batch-Parallel Euler Tour Trees
17: Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
18: Approximation of trees by self-nested trees
19: On Policies for Single-leg Revenue Management with Limited Demand Information
20: A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
21: Maximum Independent Sets in Subcubic Graphs: New Results
22: Fr'echet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
23: Optimizing Capacitated Vehicle Scheduling with Time Windows: A Case Study of RMC Delivery
24: Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information
25: Packing Returning Secretaries
26: Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics
27: Some comments on the structure of the best known networks sorting 16 elements
28: Interruptible Algorithms for Multiproblem Solving
29: Sub-O(log n) Out-of-Order Sliding-Window Aggregation
30: HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion
31: A fast algorithm for computing distance correlation
32: Mining Maximal Induced Bicliques using Odd Cycle Transversals
33: A privacy-preserving system for data ownership using blockchain and distributed databases
34: Minimizing Branching Vertices in Distance-preserving Subgraphs
35: Minimum Reload Cost Graph Factors