The inherent computational complexity of polygon decomposition problems is of importance in the field of computational geometry. For one of these problems it is shown that the three-dimensional version is NP-complete whereas its two-dimensional version is polynomial. This provides an example for the conjecture posed by O'Rourke and Supowit
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
AbstractList partitions generalize list colourings. Sandwich problems generalize recognition problem...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
The inherent computational complexity of polygon decomposition problems is of importance in the fiel...
AbstractWe classify into polynomial time or NP-complete all three nonempty part sandwich problems. T...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)We study integer programming (IP...
The three-partition problem is one of the most famous strongly NP-complete combinatorial problems. W...
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard ...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
[[abstract]]An O(n log log n) algorithm is proposed for minimally rectangular partitioning a simple ...
We complete the complexity classification by degree of minimizing a polynomial in two variables over...
Assume that a rectangle R is given on the Euclidean plane together with a finite set P of points tha...
We study integer programming models for the problem of finding a rectangular partition of a rectilin...
In this paper we show that it is impossible to solve a number of "natural" 2-dimensional g...
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
AbstractList partitions generalize list colourings. Sandwich problems generalize recognition problem...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
The inherent computational complexity of polygon decomposition problems is of importance in the fiel...
AbstractWe classify into polynomial time or NP-complete all three nonempty part sandwich problems. T...
AbstractThis paper is mainly concerned with the computational complexity of determining whether or n...
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)We study integer programming (IP...
The three-partition problem is one of the most famous strongly NP-complete combinatorial problems. W...
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard ...
AbstractThe partition problem concerns the partitioning of n given vectors in d-space into p parts, ...
[[abstract]]An O(n log log n) algorithm is proposed for minimally rectangular partitioning a simple ...
We complete the complexity classification by degree of minimizing a polynomial in two variables over...
Assume that a rectangle R is given on the Euclidean plane together with a finite set P of points tha...
We study integer programming models for the problem of finding a rectangular partition of a rectilin...
In this paper we show that it is impossible to solve a number of "natural" 2-dimensional g...
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For ...
AbstractList partitions generalize list colourings. Sandwich problems generalize recognition problem...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
DOI
Add to ORKG