1: Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions
2: Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees
3: The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
4: The matching relaxation for a class of generalized set partitioning problems
5: Online Packet Scheduling with Bounded Delay and Lookahead
6: Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
7: Clique-Width and Directed Width Measures for Answer-Set Programming
8: Generating massive complex networks with hyperbolic geometry faster in practice