StringologyTimes

Data Structures and Algorithms: 2010/1/01-07

1: Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
2: Market Equilibrium with Transaction Costs
3: Computing the Least Fixed Point of Positive Polynomial Systems
4: An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
5: Optimal Exploration of Terrains with Obstacles
6: Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
7: Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
8: Document Clustering with K-tree
9: K-tree: Large Scale Document Clustering
10: Random Indexing K-tree
11: Asynchronous deterministic rendezvous in bounded terrains
12: How to meet asynchronously (almost) everywhere
13: Online Correlation Clustering
14: Computing a Frobenius Coin Problem decision problem in O(n^2)