1: Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations
2: Neighborhoods are good communities
3: Maximum Matching in Semi-Streaming with Few Passes
4: Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
5: Computing on Binary Strings
6: On the Complexity of Approximate Sum of Sorted List
7: The interval ordering problem
8: Approximating Low-Dimensional Coverage Problems
9: The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
10: A New Approach to Incremental Cycle Detection and Related Problems
11: Scaling algorithms for approximate and exact maximum weight matching
12: Clustering under Perturbation Resilience
13: I/O efficient bisimulation partitioning on very large directed acyclic graphs
14: Worst-Case Optimal Priority Queues via Extended Regular Counters
15: Approximating the Diameter of Planar Graphs in Near Linear Time
16: Secretary Problems with Convex Costs
17: Quantum Verification of Minimum Spanning Tree
18: Highly-Concurrent Doubly-Linked Lists
19: Optimal Server Assignment in Multi-Server Queueing Systems with Random Connectivities
20: Efficient Computation of Distance Sketches in Distributed Networks
21: On the Optimal Scheduling of Independent, Symmetric and Time-Sensitive Tasks
22: The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis
23: On the complexity of strongly connected components in directed hypergraphs
24: Jungles, bundles, and fixed parameter tractability