1: Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
2: Towards a General Framework for Searching on a Line and Searching on $m$ Rays
3: Looking for vertex number one
4: The Advice Complexity of a Class of Hard Online Problems
5: Faster Computation of Expected Hypervolume Improvement
6: Computing Classic Closeness Centrality, at Scale
7: Quantum digital-to-analog conversion algorithm using decoherence
8: An optimal algorithm for the weighted backup 2-center problem on a tree
9: A Variant of the Maximum Weight Independent Set Problem