1: Graph Sparsification in the Semi-streaming Model
2: Non-monotone submodular maximization under matroid and knapsack constraints
3: Compressed Representations of Permutations, and Applications
4: Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
5: On the Average Complexity of Moore’s State Minimization Algorithm