1. Dimensionality reduction for approximate near neighbor search in the Manhattan metric

2. Approximation Algorithms for the Precedence Constrained Minimum Knapsack and Capacitated Covering Integer Programs

3. Lexicographic Sets

4. Fine-Grained Complexity: Exploring Reductions and their Properties

5. Minor­Obstructions for Apex Pseudoforests

6. Voting Rules for Expressing Conditional Preferences in Multiwinner Elections

7. Notions of Galois connections for Bilattices

8. Upper Bounds on the number of embeddings of minimally rigid graphs

9. Structural and Topological Graph Theory and Well-Quasi-Ordering

10. Decompositions and Algorithms for the Disjoint Paths Problem in Planar Graphs

11. Extendability of Graphs with Perfect Matchings

12. The Dynamic Complexity of Reachability and Related Problems

13. About Inspection Games

14. Non-constructive proof of a fixed point theorem on lexicographic lattice structures

15. Monero Mining: CryptoNight Analysis

16. Contributions of Graph Theory and Algorithms to Animal Behaviour and Neuroscience

17. Expanding Graphs and Balanced Separators

18. A Survey of Probabilistic Reasoning in Justification Logic

19. A Survey of Zero-Knowledge Succinct Non-Interactive Arguments with preprocessing

20. Simulation Relations among Message Passing and Mobile Agent Algorithms