1: Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
2: Spatial mixing and approximation algorithms for graphs with bounded connective constant
3: Editing to a Connected Graph of Given Degrees
4: Parameterized Algorithms for Load Coloring Problem
5: Social optimum in Social Groups with Give-and-Take criterion
6: Tree dynamics for peer-to-peer streaming
7: A New Heuristic Synchronizing Algorithm
8: In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond
9: Parallel Triangle Counting in Massive Streaming Graphs
10: Coding for Random Projections
11: An Adaptable Fast Matrix Multiplication Algorithm, Going Beyond the Myth of Decimal War
12: On the Parameterized Complexity of Reconfiguration Problems
13: Super-Fast Distributed Algorithms for Metric Facility Location
14: Achieving Speedup in Aggregate Risk Analysis using Multiple GPUs
15: A Simple Circle Discretization Algorithm With Applications
16: Parameterized Rural Postman Problem
17: Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
18: Parameterized Algorithms for Modular-Width
19: Trace Complexity of Network Inference