StringologyTimes

Data Structures and Algorithms: 2009/7/08-14

1: Online Sorting via Searching and Selection
2: Towards an $O(\sqrt[3]{\log n})$-Approximation Algorithm for {\sc Balanced Separator}
3: Classified Stable Matching
4: A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters
5: Randomised Buffer Management with Bounded Delay against Adaptive Adversary
6: On the maximal number of highly periodic runs in a string
7: Kernels for Feedback Arc Set In Tournaments
8: Layered Working-Set Trees