1: A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
2: Some Results on the Target Set Selection Problem
3: On the Integrality Gap of the Directed-Component Relaxation for Steiner Tree
4: Fast Balanced Partitioning is Hard, Even on Grids and Trees
5: Fast Private Data Release Algorithms for Sparse Queries
6: Efficient Discovery of Association Rules and Frequent Itemsets through Sampling with Tight Performance Guarantees
7: Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs
8: Correlation Decay up to Uniqueness in Spin Systems