# Gilles Caporossi

Back## Cahiers du GERAD

### 86 results — page 1 of 5

Détection de communautés dynamiques dans les réseaux évolutifs de développeurs au sein de Chrome

The time-stamped database provided by Google traces the code contributions to Chrome browser on the period from September 2008 to January 2014. It describes ...

BibTeX referenceGenoGraphiX-Log version 2.0 user guide

GenoGraphiX-Log 2.0 (abbreviation GGXLog) is a keystroke logging software that was developed as a collaboration between <a href="" title="https://www.h...

BibTeX reference

Aggregator is an open-source python package which aims to facilitate the exploitation of relational datasets by automating feature aggregation.

BibTeX reference

This work proposes strategies to handle three types of constraints in the context of blackbox optimization: binary constraints that simply indicate if they a...

BibTeX reference

In an optimization problem, multiplying an inequality constraint by a positive scalar has no effect on the domain. However, such a transformation might have...

BibTeX reference

In this paper, we establish the maximum number of basic shortest paths in Cartesian product graphs and bounds on the maximum number of the vertex-disjoint sh...

BibTeX reference

For the last decades, community detection is a well-studied problem because it has applications in various fields. Variable Neighborhood Search (VNS) is an e...

BibTeX reference

Distance measures play an important role in data analysis, mainly for clustering purpose, but also for data representation (for instance using multidimension...

BibTeX referenceVertex and edge residual mean distances: New resilience measures for telecommunication networks

Any telecommunication network is subject to a node or link failure at any given time. Such a failure may impact the quality of the services provided by the n...

BibTeX reference

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 ...

Considering a graph as a network of resistances, Klein and Randić (1993) proposed the definition of a distance measure. Indeed, if each edge of the graph re...

BibTeX reference

Graph theoretical heuristics are used extensively in many fields to solve approximately large scale optimization problems. Graph theoretical heuristics can a...

BibTeX referenceOptimizing C-RAN backhaul topologies: A resilience-oriented approach using graph invariants

Trends in wireless networks are proceeding toward increasingly dense deployments, supporting resilient interconnection for applications that carry ever highe...

BibTeX reference

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

BibTeX reference

In this paper, we propose a new scheme for building algorithms to detect communities in networks. This new approach is based upon a vertex centrality measur...

BibTeX reference

This paper presents the results of two explorations: one, exhaustive, of the graph sets from 4 to 10 vertices, and other, using AGX-III program on graphs fro...

BibTeX reference

In the literature, graphs are often studied in terms of invariants, for instance the number of vertices or edges, the stability number, the chromatic number ...

BibTeX reference

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 `(...

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...

BibTeX reference

In this paper, the first steps toward the use of the Variable Neighborhood Search metaheuristic are explained. The method is presented step by step using an...

BibTeX reference