StringologyTimes

Data Structures and Algorithms: 2011/11/22-28

1: A Simple Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations
2: Wireless Capacity and Admission Control in Cognitive Radio
3: Fast Compressed Tries through Path Decompositions
4: On a Linear Program for Minimum-Weight Triangulation
5: Digraph Complexity Measures and Applications in Formal Language Theory
6: Range-limited Centrality Measures in Complex Networks
7: Edit Distance to Monotonicity in Sliding Windows
8: Randomized Speedup of the Bellman-Ford Algorithm
9: Improved Lower Bounds for the Shortest Superstring and Related Problems
10: Directed Steiner Tree and the Lasserre Hierarchy
11: Energy-aware scheduling under reliability and makespan constraints
12: Computation of generalized inverses using Php/MySql environment
13: Faster and More Accurate Sequence Alignment with SNAP
14: Tractability results for the Double-Cut-and-Join circular median problem
15: ANN queries: covering Voronoi diagram with hyperboxes
16: Threshold phenomena in k-dominant skylines of random samples
17: Shape and Trajectory Tracking of Moving Obstacles