Add to ORKGAbstract. In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a longstanding open question
We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
Disk intersection (respectively, touching) graphs are the inersection graphs of closed disks in the ...
Abstract. In this paper we prove that the Min-Bisection problem is NP-hard on unit disc graphs, thus...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a...
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. Thi...
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, us...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which s...
Abstract. A bisection of a graph with n vertices is a partition of its vertices into two sets, each ...
We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
Disk intersection (respectively, touching) graphs are the inersection graphs of closed disks in the ...
Abstract. In this paper we prove that the Min-Bisection problem is NP-hard on unit disc graphs, thus...
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommo...
In this paper we prove that the Min-Bisection problem is NP-hard on unit disk graphs, thus solving a...
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show t...
AbstractWe prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We als...
A unit disk graph is the intersection graph of a family of unit disks in the plane. If the disks do ...
AbstractUnit disk graphs are the intersection graphs of unit diameter closed disks in the plane. Thi...
AbstractWe characterize the complexity of a number of basic optimization problems for unit disk grap...
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, us...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
Given a set of points in the plane and a set of disks (that we think of as wireless sensors) which s...
Abstract. A bisection of a graph with n vertices is a partition of its vertices into two sets, each ...
We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The...
AbstractWe show that the Min Cut Linear Arrangement Problem (Min Cut) is NP-complete for trees with ...
Disk intersection (respectively, touching) graphs are the inersection graphs of closed disks in the ...