1: Improved ARV Rounding in Small-set Expanders and Graphs of Bounded Threshold Rank
2: Nearly Maximum Flows in Nearly Linear Time
3: Learning Coverage Functions and Private Release of Marginals
4: An Improved GEF Fast Addition Algorithm
5: A Probabilistic Algorithm for Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
6: Backward Path Growth for Efficient Mobile Sequential Recommendation
7: An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
8: Approximation algorithms for Euler genus and related problems
9: Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice
10: A memetic algorithm for the minimum sum coloring problem
11: Balanced offline allocation of weighted balls into bins
12: Centrality of Trees for Capacitated k-Center
13: Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems
14: Principal Component Analysis and Higher Correlations for Distributed Data
15: Buffer Management of Multi-Queue QoS Switches with Class Segregation
16: Towards a better approximation for sparsest cut?
17: A modified dna computing approach to tackle the exponential solution space of the graph coloring problem
18: On Model-Based RIP-1 Matrices
19: Algorithms for Cut Problems on Trees
20: Faster Private Release of Marginals on Small Databases
21: An Improved ACS Algorithm for the Solutions of Larger TSP Problems
22: Time-Optimal Interactive Proofs for Circuit Evaluation
23: Annotations for Sparse Data Streams
24: Network Design with Coverage Costs