EN FR
EN FR


Section: Dissemination

Teaching

  • Licence:

    - ASR5 - Networks, 150h, Level L1, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Introduction to Operating Systems, 40h, Level L1, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Informatique, 20h, Level L1 (classe préparatoire MPSI), Lycée International de Valbonne.

    - IT Tools, 32h, Level L1, IUT Nice Côte d’Azur, University of Nice Sophia Antipolis.

    - Programmation fonctionnelle (Scheme), 18h, Level L1, UFR Sciences, University of Nice Sophia Antipolis.

    - Database and advanced information system, 36h, Level L2, IUT Nice Côte d’Azur, University of Nice Sophia Antipolis.

    - Operating Systems : Advanced Programming, 63h, Level L2, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Algorithmique et Programmation, 35h, Cycle Initial Polytechnique 2, École Polytech'Nice, University of Nice Sophia Antipolis.

    - Mathématiques discrètes, 64h, Level L3, Ecole Polytech'Nice, University of Nice Sophia Antipolis.

    - Advanced Networks, 15h, Level L3, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Object-Oriented Programming, 54h, L3, Licence Miage, Université de Nice, France.

    - Graph Theory, 18h, Level L3, Mathematics Department, RWTH Aachen, Germany.

    - Introduction to Algorithms, 36h, Level L3, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Bash Scripting, 15h, Level L3, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Linux Systems Administration, 24h, Level L3, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

    - Algorithmique et complexité, 25h, Level L3, IUT Nice Côte d'Azur, University of Nice Sophia Antipolis.

  •    

  • Master:

    - Théorie des graphes, 24h, M1 PENSUNS, University of Nice Sophia Antipolis.

    - Combinatoire des graphes, 25h, Level M2, Master MDFI, Université de la Méditerranée - Faculté des sciences de Luminy.

    - Probabilistoc method, 18h, Master 2 Mathematics, Lebanese University, Beyruth, Lebanon.

    - Algorithms for telecommunications, 42h, Level M2, Master IFI (international stream Ubinet), University of Nice Sophia Antipolis.

Administration

Collaboration INRIA-Lycée International de Valbonne:

N. Nisse is co-responsible of the Computer Science course of MPSI.

IUT Nice Côte d'Azur:

M. Syska is responsible of the Computer Science Department of IUT since september 2011.

Ubinet, Master IFI:

J.-C. Bermond is member of the scientific committee.

J. Moulierac was responsible of the International stream Ubinet, Master IFI (http://ubinet.unice.fr ), until August 2011.

F. Giroire is responsible of the Internships within international stream Ubinet, Master IFI (http://ubinet.unice.fr ), since October 2011.

International Master 1:

J.-C. Bermond is member of the scientific committee of the international track of the M1.

PhD & HdR

  • PhD:

  • Nathann Cohen, Three years of graphs and music: some results in graph theory and its applications, Université de Nice Sophia Antipolis, October 20, 2011, F. Havet.

  • J.-C. Maureira, Internet on rails, Université de Nice Sophia Antipolis, January 21, 2011, J.-C. Bermond and O. Dalle.

  • D. Mazauric, Optimisation discrète dans les réseaux de télécommunication: reconfiguration du routage, routage efficace en énergie, ordonnancement de liens et placement de données, Université de Nice Sophia Antipolis, November 7, 2011, P. Nain and J.-C. Bermond.

  • J. Ribault, Reuse and Scalability in Modeling and Simulation Software Engineering, Université de Nice Sophia Antipolis, January 20, 2011, O. Dalle.

  •    

  • PhD in progress:

  • 3rd year:

  • J. Araújo, Dynamic network routing, since December 2009, J.-C. Bermond, C. Linhares Sales and F. Giroire.

  • L. Sampaio, Algorithmic aspects of graph colorings, since November 2009, F. Havet.

  • I. Tahiri, Optimisation dans les réseaux de collecte IP sans fils, since November 2009, D. Coudert.

  • M. Toko Worou, Outils algorithmiques pour la détection des communautés, since November 2009, J.-C. Bermond and J. Galtier.

  •    

  • 2nd year:

  • S. Félix, Smart transports : optimisation du trafic dans les villes, since January 2011, J.-C. Bermond and J. Galtier.

  • A. Lancin, Study of network properties for efficient routing algorithms, since January 2011, D. Coudert.

  • R. Modrzejewski, Systèmes pair-à-pair de partage de données, since November 2010, S. Pérennes and F. Giroire.

  • R. Pardo Soares, Routing reconfiguration in WDM networks, since November 2010, D. Coudert and N. Nisse.

  •    

  • 1st year:

  • A. Kodjo, Design and optimization of multi-operators wireless backhaul networks, since October 2011, D. Coudert.

  • B. Li, Study of Internet model and its properties for efficient routing algorithms, since October 2011, D. Coudert and N. Nisse.

  • A. K. Maia, Partitions of directed graphs, since September 2011, F. Havet.

  • T. K. Phan, Design and Management of networks with low-power Consumption, since October 2011, D. Coudert and J. Moulierac.