1: From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions
2: A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization
3: Hypergraph Partitioning through Vertex Separators on Graphs
4: An exact and O(1) time heaviest and lightest hitters algorithm for sliding-window data streams
5: A Linear Approximation Algorithm for 2-Dimensional Vector Packing
6: Listing All Maximal Cliques in Large Sparse Real-World Graphs
7: Refinements of Miller’s Algorithm over Weierstrass Curves Revisited
8: Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types
9: Solving connectivity problems parameterized by treewidth in single exponential time
10: Span-program-based quantum algorithm for the rank problem
11: Locating Depots for Capacitated Vehicle Routing
12: Near-Optimal Column-Based Matrix Reconstruction
13: A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs)
14: Fully dynamic maximal matching in O(log n) update time
15: Polynomial cases of the Discretizable Molecular Distance Geometry Problem