Yessin NEGGAZ
Assistant Professor and Head of Network and Virtualization

 

 

Yessin NEGGAZ
Assistant Professor and Head of Network and Virtualization
  • Partager sur Twitter
  • Partager sur Facebook
  • Partager sur Linkedin
  • Partager sur Google+

Bio

I obtained my PhD in Computer Science from the University of Bordeaux (France) in October 2016. I then held a Teaching and Research Associate position at INP ENSEIRB-MATMECA (teaching institution) and LaBRI (Bordeaux CS dept.), and at INSA Toulouse (national institute of applied sciences) and LAAS-CNRS (Laboratory for Analysis and Architecture of Systems). I am mainly interested in dynamic networks and distributed algorithms.
I currently hold an Associate Professor position in Computer Science at EFREI Paris.

Interests & Projects

Fields of interest

I am currently working within the team Connected Objects team at the AllianSTIC lab on dynamic communication network.

I am interested in Communication and distributed algorithms in dynamic networks. Dynamic networks consist of entities making contact over time with one another. A major challenge in dynamic networks is to predict dynamics patterns and decide whether the evolution of the topology satisfies requirements for the success of given algorithms. The types of dynamics resulting from these networks are varied in scale and nature. For instance, some of these networks remain connected at all times; others are always disconnected but still offer some kind of connectivity over time and space (temporal connectivity); others are recurrently connected, periodic,etc. All of these contexts can be represented as dynamic graph classes corresponding to necessary or sufficient conditions for given distributed problems or algorithms. Given a dynamic graph, a natural question to ask is to which of the classes this graph belongs. I mainly worked on the automation of dynamic graphs classification, proposing strategies for dynamic graph analysis, and developing frameworks and algorithms for testing relevant properties and computing parameters in dynamic graphs. I also attempt to understand what can still be done in a context where no property on the network is guaranteed and no assumption on the evolution of the network dynamics is made through the study of distributed problems.

Lecture Program

Since September 2018, EFREI – Paris:

  • Network and Protocols
  • Network Services
  • Advanced Operating Systems
  • Cyber Security
  • Java
  • Network monitoring

2017 – 2018, INSA-Toulouse:

  • Network Design Office
  • Introduction to Networks
  • Network Programming
  • Network and Internet Applications
  • Programming in C
  • System and Multi-threading Programming
  • Operating Systems
  • Algorithms
  • Graphs
  • Graphic Design Office
  • Databases
  • C++ programming
  • Integrator project (big data and cloud)

2013 – 2017, Bordeaux INP ENSEIRB-MATMECA:

  • TCP/IP Network Applications
  • TCP/IP Network Architecture
  • Introduction to Networks
  • Network Application Project
  • Algorithmic and Data structure
  • Working Environment
  • Introduction to UNIX
  • Algorithmic Project and Programming

Publications

  • Maintaining a Distributed Spanning Forest in Highly Dynamic Networks

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Yessin M. Neggaz.

The computer Journal (Oxford University Press), 2018

 

  • Computing Parameters of Sequence-based Dynamic Graphs

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, and Joseph G. Peters

Theory of Computing Systems (Springer), 2018 

 

  • Temporal Property Testing in Dynamic Networks: Application to Software-Defined Vehicular Networks

Yessin M. Neggaz and Soufian Toufga

27th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises WETICE – AROSA, 2018

 

  • A Generic Framework for Computing Parameters of Sequence-based Dynamic Graphs

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, and Joseph G. Peters.

24rd International Colloquium on Structural Information and Communication Complexity SIROCCO, 2017

 

  • Calcul de paramètres minimaux dans les graphes dynamiques

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, and Joseph G. Peters.

19èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications ALGOTEL, 2017

 

  • Automatic Classification of Dynamic Graphs

Yessin M. NEGGAZ

PhD thesis, University of Bordeaux, France, 2016

 

  • Tester efficacement la T-intervalle connexité dans les graphes dynamiques

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, and Joseph G. Peters.

17èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications ALGOTEL, Beaune, France, 2015

 

  • Efficiently Testing T-Interval Connectivity in Dynamic Graphs

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, and Joseph G. Peters.

9th Int. Conference on Algorithms and Complexity CIAC 2015, Paris, France, 2015

 

  • Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Yessin M. Neggaz.

18th Int. Conference on Principles of Distributed Systems OPODIS 2014

 

  • Testing Temporal Connectivity in Sparse Dynamic Graphs

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Yessin M. Neggaz.

2nd international conference on Research challenges for future RPAS/UAV systems, AETOS 2014

 

  • Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Yessin M. Neggaz.

16èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications ALGOTEL, 2014