Other titles and affiliations
In June 2015, Eglantine Camby obtained a PhD in Science from the Université Libre de Bruxelles, Belgium, under the supervision of Samuel Fiorini and Jean Cardinal. Her research is in graph theory, at the intersection of computer science and mathematics. More specifically, during her thesis, she studied the dominating set problem, the vertex cover problem and the coloration problem.
The first year of her three-year postdoctoral fellowship at the Université Libre de Bruxelles is dedicated to a one-year internship in Montréal (HEC Montréal and GERAD). The two main goals of her visit are to broaden her skills, particularly in algorithmics and programming, and to gain some expertise in complex network. She will reach these goals thanks to the expertise and the supervision of Professor Gilles Caporossi.
More specifically, Eglantine’s internship will focus first on an empirical study of certain complex networks, and second, on the development of tools to study these networks.
Élise Vandomme – LACIM, Université du Québec à Montréal
Eglantine Camby – Université libre de Bruxelles
Cahiers du GERAD
A parallel algorithm using VNS with shared memory and message passing interface for community detection in complex networks
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
\(P_k\)-hitting set problem consists in removing a minimum number
\(\psi_k(G)\) of vertices of a given graph
\(G\) so that the resulting graph does...
\(\iota(G)\) be the domination and independent domination numbers of a graph
In this paper, we define the ...