StringologyTimes

Data Structures and Algorithms: 2015/12/15-21

1: Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets
2: Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/\epsilon)$ Time Per Alignment
3: Efficient Algorithms for Personalized PageRank
4: Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
5: Data Driven Resource Allocation for Distributed Learning
6: On the Total Number of Bends for Planar Octilinear Drawings
7: Optimal Las Vegas reduction from one-way set reconciliation to error correction
8: Streaming Kernel Principal Component Analysis
9: Small Model $2$-Complexes in $4$-space and Applications
10: Computing the Complete Pareto Front
11: Improved kernels for Signed Max Cut parameterized above lower bound on (r,l)-graphs
12: Improved Bounds for 3SUM, $k$-SUM, and Linear Degeneracy
13: Non-Local Probes Do Not Help with Graph Problems
14: ADMM for the SDP relaxation of the QAP
15: Fast computation of all maximum acyclic agreement forests for two rooted binary phylogenetic trees
16: Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests
17: A faster fixed parameter algorithm for two-layer crossing minimization
18: Complexity and Approximation of the Fuzzy K-Means Problem
19: Improved Balanced Flow Computation Using Parametric Flow
20: Advice Complexity of the Online Induced Subgraph Problem
21: On the shelling antimatroids of split graphs
22: Algorithms for Provisioning Queries and Analytics
23: The Limitations of Optimization from Samples
24: Online Matroid Intersection: Beating Half for Random Arrival
25: Chinese Postman Problem on Edge-Colored Multigraphs
26: A Polynomial-Time Approximation Scheme for The Airplane Refueling Problem
27: Optimizing Spread of Influence in Weighted Social Networks via Partial Incentives
28: Building a Balanced k-d Tree with MapReduce
29: Towards Integrated Glance To Restructuring in Combinatorial Optimization
30: From Discrepancy to Majority
31: Path computation in multi-layer multi-domain networks: A language theoretic approach
32: Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane