1: Online Search with Maximum Clearance
2: On Parameterized Complexity of Liquid Democracy
3: Erasure-Resilient Sublinear-Time Graph Algorithms
4: Approximation algorithms for hitting subgraphs
5: AWLCO: All-Window Length Co-Occurrence
6: Batch Optimization for DNA Synthesis
7: Robust and Private Learning of Halfspaces
8: Distributed Algorithms from Arboreal Ants for the Shortest Path Problem
9: Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
10: On structural parameterizations of the selective coloring problem
11: Parameterized algorithms for locating-dominating sets