1: Group Activity Selection with Few Agent Types
2: Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location
3: Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem
4: Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
5: Capacity-Achieving Private Information Retrieval Codes with Optimal Message Size and Upload Cost
6: One (more) line on the most Ancient Algorithm in History
7: An Issue in the Martingale Analysis of the Influence Maximization Algorithm IMM
8: Ranked Schr"oder Trees
9: The Complexity of $(\Delta + 1)$Coloring inCongested Clique, Massively Parallel Computation,and Centralized Local Computation
10: Detecting strong cliques
11: Towards Tight Approximation Bounds for Graph Diameter and Eccentricities
12: Empirical Analysis of Common Subgraph Isomorphism Approaches to the Lost-in-Space Star Identification Problem
13: Explicit 3-colorings for exponential graphs
14: Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
15: Fair redistricting is hard
16: Turning Cliques into Paths to Achieve Planarity
17: On Some Combinatorial Problems in Cographs
18: A Quantum Interior Point Method for LPs and SDPs
19: Finding events in temporal networks: Segmentation meets densest-subgraph discovery