StringologyTimes

Data Structures and Algorithms: 2010/5/29-31

1: Bidimensionality and EPTAS
2: Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
3: The potential to improve the choice: list conflict-free coloring for geometric hypergraphs
4: Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem
5: Provenance Views for Module Privacy