Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topo...

Researchers around the globe attend the International Symposium on Mathematical Programming (ISMP) to share their latest results in mathematics, algorithms, ...

We consider chemical graphs that are defined as connected graphs of maximum degree at most 3. We characterize the extremal ones, that is, those that maximize...

The arithmetic-geometric index is a newly proposed degree-based graph invariant in mathematical chemistry. We give a sharp upper bound on the value of this ...

We consider the set of graphs that can be constructed from a one-vertex graph by repeatedly adding a clique or a stable set linked to all or none of the vert...

Tactical wireless networks are used in cases where standard telecommunication networks are unavailable or unusable, e.g. disaster relief operations. We fully...

Recommender systems provide personalized recommendations to their users for items and services. They do that using a model that is tailored to each user to i...

Le Douzième atelier de résolution de problèmes industriels de Montréal, qui eut lieu du 22 au 26 août 2022, fut organisé conjointement par le Centre de reche...

Recommender systems provide recommendations to their users for items and services by creating a model tailored to each user to infer their preferences based ...

We investigate the ratio $\mathcal{I}(G)$ of the average size of a maximal matching to the size of a maximum matching in a graph G. If many maximal mat...

Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learnin...

A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...

We study the average number $A(G)$ of colors in the non-equivalent colorings of a graph $G$. We show some general properties of this graph invariant ...

The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalen...

Let $G=(V,E)$ be a graph and let $S\subseteq V$ be a subset of its vertices. If the subgraph of $G$ induced by $V\setminus S$ is acyclic, the...

Given a set $\mathcal{R}$ of m disjoint finite regions in the 2-dimensional plane, all regions having polygonal boundaries, and given a set `(\mathc...

Les algorithmes de partitionnement de données aident à identifier des sous-groupes homogènes en ce sens que les données de chaque groupe partagent des caract...

This article discusses the precedence-constrained class sequencing problem (PCCSP). In scheduling terms, this is a one-machine scheduling problem with preced...

We consider three colouring problems which are variations of the basic vertex-colouring problem, and are motivated by applications from various domains. We g...

Recommender systems make use of different sources of information for providing users with recommendations of items. Such systems are often based on collabor...