In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices and m edges, ourâ€¦ (More)

This paper is concerned with the problem of partitioning a three-dimensional polytope into a small number of elementary convex parts. The need for such decompositions arises in tool design,â€¦ (More)

In this paper, we study the problems of detecting holes and antiholes in general undirected graphs and present algorithms for them, which, for a graph on <i>n</i> vertices and <i>m</i> edges, run inâ€¦ (More)

We show that the boundary of a three-dimensional polyhedron withr reflex angles and arbitrary genus can be subdivided intoO(r) connected pieces, each of which lies on the boundary of its convex hull.â€¦ (More)

We examine the hamiltonicity of the cartesian product P = G1 Ã—G2 of two graphs G1, G2. We provide necessary and/or sufficient conditions for P to be hamiltonian, depending on the hamiltonianâ€¦ (More)

We are interested in the problem of covering simple orthogonal polygons with the minimum number of r-stars; an orthogonal polygon is an r-star if it is orthogonally convex and star-shaped. Theâ€¦ (More)

We consider sparse (or toric) elimination theory in order to describe, by combinatorial means, the monomials appearing in the (sparse) resultant of a given overconstrained algebraic system. Aâ€¦ (More)

In this paper, we establish structural properties for the class of complement reducible graphs or cographs, which enable us to describe efficient parallel algorithms for recognizing cographs and forâ€¦ (More)