1: Ruling out FPT algorithms for Weighted Coloring on forests
2: Efficient Private ERM for Smooth Objectives
3: Engineering DFS-Based Graph Algorithms
4: Asymptotic Enumeration of Compacted Binary Trees of Bounded Right Height
5: Autonomous Recharging and Flight Mission Planning for Battery-operated Autonomous Drones
6: Priv’IT: Private and Sample Efficient Identity Testing
7: Recursive Method for the Solution of Systems of Linear Equations
8: Preserving Distances in Very Faulty Graphs
9: Finding Even Cycles Faster via Capped k-Walks
10: A Polynomial-time Algorithm to Achieve Extended Justified Representation
11: Gelly-Scheduling: Distributed Graph Processing for Network Service Placement in Community Networks
12: Fleet management for autonomous vehicles: Online PDP under special constraints
13: The Dynamics of Rank-Maximal and Popular Matchings
14: Study on Resource Efficiency of Distributed Graph Processing
15: Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs
16: An analysis of budgeted parallel search on conditional Galton-Watson trees
17: Treewidth distance on phylogenetic trees