StringologyTimes

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

1: Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized Above Average
2: VRAC: Theory #1
3: Minimum and maximum against k lies
4: An Optimal Algorithm for the Indirect Covering Subtree Problem
5: MADMX: A Novel Strategy for Maximal Dense Motif Extraction
6: Heuristic Contraction Hierarchies with Approximation Guarantee
7: Odds-On Trees
8: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets
9: Random sampling of lattice paths with constraints, via transportation
10: Mod/Resc Parsimony Inference