1: Computing minimum cuts in hypergraphs
2: A flow based pruning scheme for enumerative equitable coloring algorithms
3: Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
4: Trimming and gluing Gray codes
5: Complexity of Discrete Energy Minimization Problems
6: Improved stochastic trace estimation using mutually unbiased bases
7: Local Testing for Membership in Lattices
8: New MDS codes with small sub-packetization and near-optimal repair bandwidth
9: An Approximation Algorithm for Maximum Internal Spanning Tree
10: Optimal Distance Labeling Schemes for Trees