1: Gaussian Cooling and O(star)(n^3) Algorithms for Volume and Gaussian Volume
2: A fast algorithm for computing irreducible triangulations of closed surfaces in $E^d$
3: Computing the $p$-adic Canonical Quadratic Form in Polynomial Time
4: Approximating Betweenness Centrality in Large Evolving Networks
5: 2-Vertex Connectivity in Directed Graphs
6: Lift & Project Systems Performing on the Partial-Vertex-Cover Polytope
7: Linearizable special cases of the QAP
8: Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees
9: On Uniform Capacitated $k$-Median Beyond the Natural LP Relaxation
10: Document Counting in Practice
11: Generating a Quadratic Forms from a Given Genus
12: A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs
13: Symmetric Submodular Clustering with Actionable Constraint
14: Shortest Paths in Nearly Conservative Digraphs
15: A note on the longest common substring with $k$-mismatches problem
16: Optimal decremental connectivity in planar graphs
17: Polynomial Kernels and User Reductions for the Workflow Satisfiability Problem
18: Stream quantiles via maximal entropy histograms
19: Beyond Maximum Likelihood: from Theory to Practice
20: Approximation algorithms for the Transportation Problem with Market Choice and related models
21: Irrelevant Components and Exact Computation of the Diameter Constrained Reliability
22: A (Somewhat Dated) Comparative Study of Betweenness Centrality Algorithms on GPU
23: Global Information Sharing under Network Dynamics
24: Generalized Rybicki Press algorithm