The complexity status of the maximum stable set problem in the class of <i>P</i>₅-free graphs is unknown. In this paper, we first propose a chara...

The maximum stable set problem is NP-hard, even when restricted to <i>banner</i>-free graphs. In this paper, we use the augmenting graph approach to attack ...

Exploiting an overlooked observation of Blum, Kiefer & Rosenblatt (1961), Dugué (1975) and Deheuvels (1981a) described a decomposition of empirical distribu...

This paper introduces new rank-based statistics for testing against serial dependence in a univariate time series context. These Kolmogorov-Smirnov and Cram...

We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...

We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.

A generalization of the Roy-Gallai theorem on the chromatic number of a graph is derived which is also an extension of several other results of Berge and of...

We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic chang...

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic ch...

This article reports on some recent algorithmic development for the <i>Rural Postman Problem</i> (CPP) and for the <i>Capacitated Arc Routing Problem</i> (C...

On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...

A fuzzy clustering problem consists in assigning a set of patterns to a given number of clusters with respect to some criteria such that each of them may be...

A generalization of the Roy-Gallai theorem is presented: it is based on the existence in any oriented graph of a stable set S such that for any node <i>w</i...

Maximum Clique is one of the most studied NP-hard optimization problem on graphs because of its simplicity and its numerous applications. A basic Variable N...

La Recherche à Voisinage Variable (RVV) est une métaheuristique récente basée sur l'idée d'un chargement systématique de voisinage, à la fois dans une phase...

Preapheresis quantification of circulating CD34+ cells (CD34) may be used to predict peripheral blood progenitor cell (PBPC) yield in subsequent leukapheres...

Given a set of logical sentences and probabilities that these sentences are true, the probabilistic logic problem consists in determining whethe...

Variable Neighborhood Search (VNS) is a recent metaheuristic which exploits systematically the idea of change of neighborhood within the search. After recal...

We review the work of B. Roy in graph theory and its posterity.