1: Bit Complexity of Jordan Normal Form and Spectral Factorization
2: Connected domination in grid graphs
3: Extending the Time Horizon: Efficient Public Transit Routing on Arbitrary-Length Timetables
4: A Unifying Framework for Characterizing and Computing Width Measures
5: Ruler Wrapping
6: Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions
7: Density functions for QuickQuant and QuickVal
8: Breaking the hegemony of the triangle method in clique detection
9: Deterministic Graph Coloring in the Streaming Model
10: Robust Allocations with Diversity Constraints
11: Self-Adjusting Packet Classification
12: Submodular Optimization Beyond Nonnegativity: Adaptive Seed Selection in Incentivized Social Advertising