1: Statistical physics of optimization under uncertainty
2: An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems
3: CONCISE: Compressed ‘n’ Composable Integer Set
4: Restricted Common Superstring and Restricted Common Supersequence
5: A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and its Algorithmic Applications
6: Querying for the Largest Empty Geometric Object in a Desired Location
7: Exact Ramsey Theory: Green-Tao numbers and SAT
8: Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures
9: On building minimal automaton for subset matching queries
10: Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature
11: The Graph Traversal Pattern