1: BROUTE: a benchmark suite for the implementation of standard vehicle routing algorithms
2: Load Balancing: The Long Road from Theory to Practice
3: On Families of Planar DAGs with Constant Stack Number
4: A New Lossless Data Compression Algorithm Exploiting Positional Redundancy
5: The Complexity of Growing a Graph
6: Can’t See The Forest for the Trees: Navigating Metric Spaces by Bounded Hop-Diameter Spanners
7: The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
8: A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
9: Assistance and Interdiction Problems on Interval Graphs
10: Fast direct access to variable length codes
11: An iterative coordinate descent algorithm to compute sparse low-rank approximations
12: Cache Replacement Algorithm
13: Algorithms for Energy Conservation in Heterogeneous Data Centers
14: Efficient Sparse Spherical k-Means for Document Clustering
15: Algorithms for Right-Sizing Heterogeneous Data Centers
16: Local certification of graph decompositions and applications to minor-free classes
17: Near-Optimal Spanners for General Graphs in (Nearly) Linear Time