StringologyTimes

Data Structures and Algorithms: 2011/2/08-14

1: Algorithms for Implicit Hitting Set Problems
2: A Constant Factor Approximation Algorithm for Boxicity of Circular Arc Graphs
3: Restructuring in Combinatorial Optimization
4: Algorithms for Jumbled Pattern Matching in Strings
5: Graph Coalition Structure Generation
6: Don’t Rush into a Union: Take Time to Find Your Roots
7: How the result of graph clustering methods depends on the construction of the graph
8: Multicriteria Steiner Tree Problem for Communication Network
9: The total path length of split trees
10: Yield Optimization of Display Advertising with Ad Exchange
11: Multi-skill Collaborative Teams based on Densest Subgraphs
12: A New Method for Variable Elimination in Systems of Inequations