1: Graph colouring algorithms
2: Nearest Neighbor based Clustering Algorithm for Large Data Sets
3: Counting, generating and sampling tree alignments
4: Variable Neighborhood Search for solving Bandwidth Coloring Problem
5: Diffusion Methods for Classification with Pairwise Relationships
6: A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems
7: Research on Solution Space of Bipartite Graph Vertex-Cover by Maximum Matchings
8: Local Ranking Problem on the BrowseGraph
9: An algorithm for multipication of Kaluza numbers
10: An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
11: MSPKmerCounter: A Fast and Memory Efficient Approach for K-mer Counting
12: Towards Realistic Team Formation in Social Networks based on Densest Subgraphs
13: An Improved Combinatorial Algorithm for Boolean Matrix Multiplication
14: Robust recoverable and two-stage selection problems
15: Times series averaging from a probabilistic interpretation of time-elastic kernel
16: New characterizations of minimum spanning trees and of saliency maps based on quasi-flat zones
17: A Limit Theorem for Radix Sort and Tries with Markovian Input
18: A Practical Oblivious Map Data Structure with Secure Deletion and History Independence