A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

This paper addresses a multirobot scheduling problem in which autonomous unmanned
aerial vehicles (UAVs) must be recharged during a long-term mission. The proposal is to …

In this work, we introduce the notion of time to some well-known combinatorial optimization
problems. In particular, we study problems defined on temporal graphs. A temporal graph …

Nowadays the term monochromatic and heterochromatic (or rainbow, multicolored)
subgraphs of an edge-colored graph appeared frequently in literature, and many results on …

A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

We introduce a general method for obtaining fixed-parameter algorithms for problems about
finding paths in undirected graphs, where the length of the path could be unbounded in the …

Abstract Let G=(V, E) be a connected multigraph, whose edges are associated with labels
specified by an integer-valued function ℒ: E→ ℕ. In addition, each label ℓ∈ ℕ has a non …

Abstract We study the Minimum Labelling Spanning Tree Problem: Given a graph G with a
color (label) assigned to each edge (not necessarily properly) we look for a spanning tree of …

Several variants of the classical Constrained Shortest Path Problem have been presented in
the literature so far. One of the most recent is the k-Color Shortest Path Problem (k k-CSPP) …

We investigate a natural combinatorial optimization problem called the Label Cut problem.
Given an input graph G with a source s and a sink t, the edges of G are classified into …