Caporossi, Gilles
Gilles Caporossi professeur à HEC Montréal, Canada (en 2014)
VIAF ID: 106043796 ( Personal )
Permalink: http://viaf.org/viaf/106043796
Preferred Forms
- 200 _ | ‡a Caporossi ‡b Gilles
- 100 1 _ ‡a Caporossi, Gilles
- 100 1 _ ‡a Caporossi, Gilles
-
-
- 100 0 _ ‡a Gilles Caporossi ‡c professeur à HEC Montréal, Canada (en 2014)
4xx's: Alternate Name Forms (2)
Works
Title | Sources |
---|---|
2000 cahiers du GERAD | |
Aggregator : automating feature aggregation with graph neural networks | |
An algorithm for qualifying eye movements during handwriting | |
Arbitrary-norm hyperplane separation by variable neighborhood search | |
Automated comparison of graph invariants | |
Binary, unrelaxable and hidden constraints in blackbox optimization | |
Bounds and relations involving adjusted centrality of the vertices of a tree | |
Centrality and betweenness : vertex and edge decomposition of the Wiener index | |
Comparing Zagreb indices of cyclic graphs | |
A comparison of integer and constraint programming models for the deficiency problem | |
Constraint scaling in the Mesh Adaptative Direct Search algorithm | |
A constructive enumeration of fusenes and benzenoids | |
Découverte par ordinateur en théorie des graphes. | |
Design of highly-synchronizable and robust networks | |
DGR-ELM -- Distributed generalized regularized ELM for classification | |
Distance matrices, Wiener indices and related invariants of fullerenes | |
Dynamic point selection for the L₁ norm hyperplane separation problem | |
Edge realizability of connected simple graphs | |
Efficiency evolution of coal-fired electricity generation in China, 1999-2007 | |
Enumeration of polyhex hydrocarbons to h = 21 | |
Exhaustive and metaheuristic exploration of two new structural irregularity measures | |
Exploring centrality measures and their extensions through an influence network | |
The extended Jaccard distance in complex networks | |
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression | |
Finding conjectures in graph theory with AutoGraphiX | |
Finding relations in polynomial time | |
Génération de rotations d'équipage en transport aérien méthodes d'accélération par réduction des réseaux. | |
Globally optimal clusterwise regression by mixed logical-quadratic programming | |
Identification of the Minkowski parameter for multidimensional scaling | |
A learning optimization algorithm in graph theory : versatile search for extremal graphs using a learning algorithm | |
L'écriture manuscrite : analyse comparative et méthodes d'études de leur dynamique : l'exemple du logiciel Eye and Pen | |
Network descriptors based on betweenness centrality and transmission and their extremal values | |
A new centrality-based approach for fast community detection in graphs | |
On compact k-edge-colorings : a polynomial time reduction from linear to cyclic | |
On the impact of one vertex or edge removal on distance-based invariants for Cartesian product graphs | |
On the number of shortest paths in Cartesian product graphs and its robustness | |
On the separator of fullerenes | |
Online writing data representation : a graph theory approach | |
Open problems on graph eigenvalues studied with AutoGraphiX | |
Optimizing C-RAN backhaul topologies : a resilience-oriented approach using graph invariants | |
A parallel algorithm using VNS with shared memory and message passing interface for community detection in complex networks | |
Performance of n-Grams for a question retrieval system in the context of approximated spelling | |
The progressive visualization, a new tool for analyzing the writing process | |
La recherche à voisinages variables | |
Refutations, results and conjectures about the Balaban Index | |
Représentation de la genèse d'un texte par un graphe | |
The RW index : a new distance measure based on random walks | |
RWA problem with geodesics in realistic OTN topologies | |
Some conjectures and properties on distance energy | |
Spectral reconstruction and isomorphism of graphs using variable neighbourhood search | |
Studying graphs and their induced subgraphs with the computer : GraphsInGraphs | |
Temps de l'écriture : enregistrements et représentations | |
Trees with palindromic Hosoya polynomials | |
Twin graphs for OTN physical topology design | |
Using the computer to study the dynamics of the handwriting processes | |
Variable neighborhood search for extremal graphs : 4 : chemical trees with extremal connectivity index | |
Variable neighborhood search for least squares clusterwise regression | |
Vertex and edge residual mean distances : new resilience measures for telecommunication networks | |
A visual environment to study and find communities in networks |