An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
This paper presents the minimum-time sequences of rotations and translations that connect two configurations of a rigid body in the plane. The configuration of the body is its pos...
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulatio...
In this paper, we study k-noncrossing, -canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T OE4 k; .n/ denote the number of these structure...
This paper reports on the results of the Fifth International Workshop on Object-Oriented Reengineering in Oslo on June 15, 2004. It enumerates the presentations made, classifies t...