1: Edge Elimination in TSP Instances
2: Quantum Inference on Bayesian Networks
3: Parameterized Algorithms for Graph Partitioning Problems
4: Additive Spanners: A Simple Construction
5: Experimental Study of A Novel Variant of Fiduccia Mattheyses(FM) Partitioning Algorithm
6: A Back-to-Basics Empirical Study of Priority Queues
7: A 4-approximation for scheduling on a single machine with general cost function
8: Efficient Representation for Online Suffix Tree Construction
9: Online Algorithms for Machine Minimization
10: A packing problem approach to energy-aware load distribution in Clouds
11: Clique counting in MapReduce: theory and experiments
12: Profile-based optimal matchings in the Student/Project Allocation problem
13: Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
14: Most Recent Match Queries in On-Line Suffix Trees (with appendix)
15: Counting the Number of Minimum Roman Dominating Functions of a Graph
16: Compressed Subsequence Matching and Packed Tree Coloring
17: Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm
18: Corrections to the results derived in “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”’; and a comparison of four restricted integer composition generation algorithms
19: Design, Implementation and Evaluation of MTBDD based Fuzzy Sets and Binary Fuzzy Relations
20: A Suffix Tree Or Not A Suffix Tree?
21: How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions
22: Parameterized Complexity of the $k$-Arc Chinese Postman Problem
23: Linear Recognition of Almost Interval Graphs
24: Massively parallel read mapping on GPUs with PEANUT