PhD defense of Nicolas Huin

Nicolas Huin

Title: “Energy Efficient Software Defined Networks” When: September 28, 2017 — 14:30 Where: Inria Sophia Antipolis, amphi Kahn Committee: Walid Dabbous, Inria, Sophia Antipolis, France Frédéric Giroire (Supervisor), CNRS, Sophia Antipolis, Brigitte Jaumard, Concordia University, Montréal, Canada Arie M.C.A Koster (Referee), RWTH Aachen, Germany Laurent Lefèvre (Referee), Inria, Lyon, France

Continue reading

Journées RESCOM 2017

GDR RSD

Participez aux Journées non thématiques RESCOM 2017 (12-13 janvier 2017) et à la journée thématique RESCOM Communication dans la ville intelligente (11 janvier 2017). Ces évènements sont organisés dans l’amphi Kahn de Inria Sophia Antipolis – Méditerranée et dans la salle E+131 de Polytech sur le Campus SophiaTech. Le programme

Continue reading

PhD defense of Guillaume Ducoffe

Guillaume Ducoffe

Title: “Metric properties of large graphs” When: December 9, 2016 — 14:30 Where: Inria Sophia Antipolis, amphi Kahn Committee: Victor Chepoi (Referee), LIF, Marseille, France David Coudert (Supervisor), Université Côte d’Azur, Inria, CNRS, I3S, France Michele Flammini, University of L’Aquila, Italie Cyril Gavoille, LaBRI – Université de Bordeaux, France Igor

Continue reading

Concurrent Disjoint Set Union

Robert E. Tarjan

Speaker: Robert E. Tarjan, Department of Computer Science, Princeton University and Intertrust Technologies Title: Concurrent Disjoint Set Union — (watch the video) When: December 9, 2016 — 10:30 Where: Inria Sophia Antipolis, amphi Kahn Abstract: The disjoint set union problem is a classical problem in data structures with a simple

Continue reading

Winner of the FHCP Challenge

Hamiltonian Cycle

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

Continue reading

Fatima Zahra Moataz recipient of an accessit to PhD prize Graphes “Charles Delorme”

Fatima Zahra Moataz

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.

Continue reading