1: Dynamic Data Structures for Interval Coloring
2: Distributed Metropolis Sampler with Optimal Parallelism
3: Approximation algorithms and an integer program for multi-level graph spanners
4: Incorrect implementations of the Floyd–Warshall algorithm give correct solutions after three repeats
5: A rearrangement distance for fully-labelled trees
6: An Algorithmic Theory of Integer Programming
7: Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases
8: Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
9: Oriented coloring on recursively defined digraphs
10: Preference-Informed Fairness
11: On the classical complexity of sampling from quantum interference of indistinguishable bosons
12: SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search
13: Internal versus external balancing in the evaluation of graph-based number types
14: Graph based Nearest Neighbor Search: Promises and Failures
15: An Improved Upper Bound for the Ring Loading Problem
16: Monte Carlo algorithms are very effective in finding the largest independent set in sparse random graphs
17: Sublinear quantum algorithms for training linear and kernel-based classifiers
18: Orthogonal Voronoi Diagram and Treemap
19: Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs
20: Compact Error-Resilient Self-Assembly of Recursively Defined Patterns
21: Proving tree algorithms for succinct data structures
22: Taming the Knight’s Tour: Minimizing Turns and Crossings
23: Achieving Optimal Backlog in Multi-Processor Cup Games
24: Hitting Topological Minors is FPT
25: Knot Diagrams of Treewidth Two
26: Spectral analysis of matrix scaling and operator scaling
27: Network design for s-t effective resistance
28: Average Sensitivity of Graph Algorithms
29: On the computational tractability of statistical estimation on amenable graphs
30: Density-friendly Graph Decomposition
31: Quantum Speedup for the Minimum Steiner Tree Problem
32: Fast Grid Splitting Detection for N-1 Contingency Analysis by Graph Computing
33: Competitive ratio versus regret minimization: achieving the best of both worlds