Given a directed graph \(G=(V,A)\), capacity and cost functions on \(A\), a root \(r\), a subset \(T \subset V\) of terminals, and an integer \(k\)...

Most papers on digital advertising focus on the point of view of Internet companies such as Google and Microsoft, and were written by people working for thos...

We consider the problems of determining the metric dimension and the minimum cardinality of doubly resolving sets in \(n\)-cubes. Most heuristics develope...

Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers \(m_{ij}\) of edges ...

This article discusses the problem of unloading a sequence of boxes from a single conveyor line with a minimum number of moves. The problem under study is ef...

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring of \(G\) is an assignment of...

The maximum \(k\)-colorable subgraph problem (\(k\)-MCSP) is to color as many vertices as possible with at most \(k\) colors, such that no two adjacent...

In this article we consider a real-world problem submitted to us by the Hatch company. This problem consists of designing a collection network for a wind f...

Given a graph \(G=(V,E)\) with a root \(r\in V\), positive capacities \(\{c(e) | e\in E\}\), and non-negative lengths \(\{\ell(e) | e\in E\}\), the m...

This paper addresses the problem of minimizing the number of moves to unload a set of boxes off a gravity conveyor by a forklift. If the input data is known ...

An edge-coloring of a graph \(G=(V,E)\) is a function \(c\) that assigns an integer \(c(e)\) (called color) in \(\{0,1,2,\dotsc\}\) to every edge `(...

In recent years, a growing interest has been observed in research on RNA (ribonucleic acid), primarily due to the discovery of the role of RNA molecules in ...

Writing is a complex process and it is difficult to know how to write well in order to make a good text. Many fields and techniques are combined to analyze h...

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring is an assignment of at most `...

An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M. The **dominating induced matchin...

In the present paper, we are interested in bounding differences between graph invariants as well as in characterizing the corresponding extremal graphs. This...

Two vertex colorings of a graph \(G\) are equivalent if they induce the same partition of the vertex set into color classes. The graphical Bell number `(...

Until recently, graph coloring being a computationally difficult problem, completely dynamic channel allocation was not considered in large scale networks. T...

An edge-coloring of a graph \(G=(V,E)\) is a function \(c\) that assigns an integer \(c(e)\) (called color) in \(\{0,1,2,\dotsc\}\) to every edge `(...

The Recursive Largest First (RLF) algorithm is one of the most popular greedy heuristics for the vertex coloring problem. It sequentially builds color clas...