1: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
2: A simple and practical algorithm for differentially private data release
3: Multiple-source multiple-sink maximum flow in planar graphs
4: Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems
5: Join-Reachability Problems in Directed Graphs
6: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
7: Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks
8: No-Break Dynamic Defragmentation of Reconfigurable Devices
9: Quasirandom Rumor Spreading
10: Quasirandom Rumor Spreading: An Experimental Analysis
11: Mining Multi-Level Frequent Itemsets under Constraints