Best paper awards, PhD awards, etc.
William Lochet, former PhD student of COATI, is the recipient of the PhD prize Graphes “Charles Delorme” 2019, for his PhD thesis entitled Sub-structures in digraphs. Congratulations !
The prize will be announced during Journées Graphes et Algorithmes — Bruxelles, November 13-15, 2019.
François Dross, former postdoc at COATI, is recipient of an accessit to the PhD prize Graphes “Charles Delorme” 2019, for his PhD thesis entitled Vertex partition of sparse graphs and defended at Université de Montpellier (LIRMM) in 2018. Congratulations !
The prize will be announced during Journées Graphes et Algorithmes — Bruxelles, November 13-15, 2019.
Emanuele Natale as been awarded the “Best Italian Young Researcher in Theoretical Computer Science” by the Italian Chapter of the EATCS. He will receive the prize during the 20th Italian Conference on Theoretical Computer Science (ICTCS), Como (Italy), September 9-11, 2019, where he will also be keynote speaker.
Congratulations !
The paper Optimal placement of drones for fast sensor energy replenishment using wireless power transfer [1] won the best paper award at Wireless Days 2019
Congratulation to the authors!
See also: Wireless Days 2019, news on Inria web site
@inproceedings{caillouet:hal-02043123,
TITLE = {{Optimal placement of drones for fast sensor energy replenishment using wireless power transfer}},
AUTHOR = {Caillouet, Christelle and Razafindralambo, Tahiry and Zorbas, Dimitrios},
URL = {https://hal.inria.fr/hal-02043123},
NOTE = {Best Paper Award},
BOOKTITLE = {{WD 2019 - Wireless Days 2019}},
ADDRESS = {Manchester, United Kingdom},
YEAR = {2019},
MONTH = Apr,
DOI = {10.1109/WD.2019.8734203},
PDF = {https://hal.inria.fr/hal-02043123/file/cameraReady.pdf},
HAL_ID = {hal-02043123},
HAL_VERSION = {v1},
}
Guillaume Ducoffe is the recipient of second PhD prize delivered jointly by GDR RSD and Association ACM SIGOPS France (ASF), edition 2018, for his PhD thesis entitled Metric properties of large graphs. Congratulations !
The prize will be announced during Compas 2018 — Toulouse, July 3-6, 2018.
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!
