1: Holographic Algorithms Beyond Matchgates
2: Relative Errors for Deterministic Low-Rank Matrix Approximations
3: An Approach Finding Frequent Items In Text Or Transactional Data Base By Using BST To Improve The Efficiency Of Apriori Algorithm
4: Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique
5: From Landscape to Portrait: A New Approach for Outlier Detection in Load Curve Data
6: Local, Smooth, and Consistent Jacobi Set Simplification
7: On NP-Hardness of the Paired de Bruijn Sound Cycle Problem
8: A Novel Combinatorial Method for Estimating Transcript Expression with RNA-Seq: Bounding the Number of Paths
9: A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data
10: Faster Algorithms for RNA-folding using the Four-Russians method
11: Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
12: The generalized Robinson-Foulds metric
13: Computing the Skewness of the Phylogenetic Mean Pairwise Distance in Linear Time
14: Unifying Parsimonious Tree Reconciliation
15: A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
16: Detecting Superbubbles in Assembly Graphs
17: A Rational Convex Program for Linear Arrow-Debreu Markets
18: A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension