1: Efficient and exact sampling of simple graphs with given arbitrary degree sequence
2: Selective Call Out and Real Time Bidding
3: Range Reporting for Moving Points on a Grid
4: Rumor Spreading on Random Regular Graphs and Expanders
5: Finite Volume Spaces and Sparsification
6: An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree
7: Improved bounds for stochastic matching
8: Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
9: Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial