We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
In this article, we argue that a program transformation approach is a good way to solve the tyranny of the primary decomposition. We illustrate our transformation-based approach o...
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...