1: Random generation of combinatorial structures: Boltzmann samplers and beyond
2: Tight Bounds for Distributed Functional Monitoring
3: Bilateral Random Projections
4: Cycle killer… qu’est-ce que c’est? On the comparative approximability of hybridization number and directed feedback vertex set
5: AdCell: Ad Allocation in Cellular Networks
6: Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property
7: Fast Approximate Quadratic Programming for Large (Brain) Graph Matching
8: Tight lower bounds for online labeling problem
9: Testing $k$-Modal Distributions: Optimal Algorithms via Reductions
10: Partially Symmetric Functions are Efficiently Isomorphism-Testable