1: Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
2: BEEM : Bucket Elimination with External Memory
3: Algorithms and Complexity Results for Exact Bayesian Structure Learning
4: The Cost of Troubleshooting Cost Clusters with Inside Information
5: acc-Motif Detection Tool
6: Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
7: Ad Serving Using a Compact Allocation Plan
8: Picture-Hanging Puzzles
9: SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising
10: How to Attack the NP-complete Dag Realization Problem in Practice
11: Linear vertex-kernels for several dense ranking r-CSPs
12: A note on the fast power series’ exponential
13: When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks
14: A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
15: High Speed Compressed Sensing Reconstruction in Dynamic Parallel MRI Using Augmented Lagrangian and Parallel Processing
16: Online Load Balancing on Unrelated Machines with Startup Costs
17: Truthfulness, Proportional Fairness, and Efficiency