In this paper, a strict formulation of a generalization of the classical pickup and delivery problem formulation is presented, which adds the extra flexibility of providing the option for passengers to transfer at specific locations.Expand

We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color.Expand

Let G be a graph with maximum degree d≥ 3 and ω(G)≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G has… Expand

We consider the problem of coloring a grid using $k$ colors with the restriction that each row and each column has a specific number of cells of each color.Expand

We consider the problem of finding the minimum diameter among all strong orientations of a given connected, bridgeless, undirected graph for different classes of AT-free graphs.Expand

In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and links may indicate telephone calls).Expand