1: Quantifying topological invariants of neuronal morphologies
2: Incremental Voronoi Diagrams
3: Submodular Variational Inference for Network Reconstruction
4: On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem
5: Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time
6: Quantum Recommendation Systems
7: Encoding Arguments
8: The SCJ small parsimony problem for weighted gene adjacencies (Extended version)
9: Network dismantling
10: Local Search Yields a PTAS for k-Means in Doubling Metrics
11: Routing under Balance
12: A comprehensive theory of cascading via-paths and the reciprocal pointer chain method
13: Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs
14: An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
15: Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics