Best paper awards, PhD awards, etc.
Members of COATI participates to the 2017 edition of Cérémonie des Lauréats de prix d’excellence d’Université Côte d’Azur.
More pictures here.
An article by Nathann Cohen and David Coudert, entitled Le défi des 1001 graphes, has been published in Interstices (in french). It relates our approach to address (and win) the Flinders Hamiltonian Cycle Problem (FHCP) Challenge organized by the Flinders Hamiltonian Cycle Project (Flinders University, Adelaide, Australia).
Guillaume Ducoffe is the recipient of an accessit to the PhD prize Graphes “Charles Delorme” 2017 for his PhD thesis entitled Metric properties of large graphs. Congratulations !
The prize will be announced during the next Journées Graphes et Algorithmes — Bordeaux, November 15-17, 2017.
The paper Energy Efficient Content Distribution [1] won the Wilkes Award 2017 (The Wilkes Award is given once a year to the authors of the best paper published in the volume of The Computer Journal from the previous year)
Congratulation to the authors!
@article{araujo:hal-01238051,
TITLE = {{Energy Efficient Content Distribution}},
AUTHOR = {Araujo, J and Giroire, Fr{\'e}d{\'e}ric and Moulierac, J and Liu, Yi and Modrzejewski, R},
URL = {https://hal.inria.fr/hal-01238051},
JOURNAL = {{The Computer Journal}},
PUBLISHER = {{Oxford University Press (UK)}},
VOLUME = {59},
NUMBER = {2},
PAGES = {192-207},
YEAR = {2016},
MONTH = Feb,
DOI = {10.1093/comjnl/bxv095},
KEYWORDS = {Energy Efficiency ; Integer Linear Programming ; Content Deliv-ery Network ; In-network Caching ; Future Internet},
PDF = {https://hal.inria.fr/hal-01238051/file/compj.pdf},
HAL_ID = {hal-01238051},
HAL_VERSION = {v1},
}
The team composed of Nathann Cohen (CNRS, LRI, Paris XI) and David Coudert won the Flinders Hamiltonian Cycle Problem (FHCP) Challenge organized by the Flinders Hamiltonian Cycle Project (Flinders University, Adelaide, Australia).
The challenge consisted in solving 1001 instances of the Hamiltonian Cycle Problem over a one year period (September 30 2015 till September 30 2016). The FHCP Challenge Set is a collection of 1001 instances of the Hamiltonian Cycle Problem, ranging in size from 66 vertices up to 9528 vertices, with an average size of just over 3000 vertices.
We were able to solve 985 instances!
Fatima Zahra Moataz is the recipient of an accessit to the PhD prize Graphes “Charles Delorme” 2016 for her PhD thesis entitled Towards Efficient and Fault-Tolerant Optical Networks: Complexity and Algorithms. Congratulations !
The prize will be announced during the next Journées Graphes et Algorithmes — Paris, November 17, 2016.
Fatima Zahra Moataz received the best student paper award of the conference ALGOTEL 2015 for her paper entitled “On Spectrum Assignment in Elastic Optical Tree-Networks“.
Abstract: To face the explosion of the Internet traffic, a new generation of optical networks is being developed; the Elastic optical Networks (EONs). The aim with EONs is to use the optical spectrum efficiently and flexibly. The benefit of the flexibility is accompanied by more difficulty in the resource allocation problems. In this report, we study the problem of Spectrum Allocation in Elastic Optical Tree-Networks. In trees, even though the routing is fixed, the spectrum allocation is NP-hard. We survey the complexity and approximability results that have been established for the SA in trees and prove new results for stars and binary trees.
Keywords: Interval coloring; Optical networks; Routing and Spectrum Assignment; Approximation algorithms.
Bi Li (李碧) is recipient of the Chinese government award for outstanding self-financed students abroad, edition 2014, for her PhD thesis entitled “Tree Decompositions and Routing Problems“. Congratulation !
More details can be found here and here (in chinese).
