1: A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
2: Void Traversal for Guaranteed Delivery in Geometric Routing
3: Improved Lower Bounds for Constant GC-Content DNA Codes
4: Succinct Data Structures for Retrieval and Approximate Membership
5: Cluster Approach to the Domains Formation