In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. Weâ€¦ (More)

A subset A of the edge set of a graph G =(V, E) is called a clique partitioning of G is there is a partition of the node set V into disjoint sets WI,... ,W k such that each W, induces a clique, i.e.,â€¦ (More)

There are various techniques for reconstructing phylogenetic trees from data, and in this context the problem of determining how distant two such trees are from each other arises naturally. Variousâ€¦ (More)

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms forâ€¦ (More)

The three-dimensional packing problem can be stated as follows. Given a list of boxes, each with a given length, width, and height, the problem is to pack these boxes into a rectangular box ofâ€¦ (More)

A dominating set of a graph is a set S of vertices such that every vertex in the graph is either in S or is adjacent to a vertex in S. The domination number of a graph G, denoted Î³ (G), is theminimumâ€¦ (More)