Given a point set P in the Euclidean plane and a parameter t, we define
...
We investigate structural and algorithmic advantages of a directed versi...
In this article we consider the Directed Steiner Path Cover problem on
d...
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the
...
The subset sum problem is one of the simplest and most fundamental NP-ha...
Undirected co-graphs are those graphs which can be generated from the si...
Coloring is one of the most famous problems in graph theory. The colorin...
In this paper we introduce the linear clique-width, linear NLC-width,
ne...
Computing the directed path-width of a directed graph is an NP-hard prob...
In this paper we consider the directed path-width and directed tree-widt...