Yessin M. NEGGAZ

Associate Professor - PhD in Computer Science.

All publications below are signed in the alphabetical order, as is the usage in our community.


  • 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 - [pdf] - [related talk] - [bibtex]


  • Computing Parameters of Sequence-based Dynamic Graphs

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

Theory of Computing Systems (Springer), 2018 - [pdf] - [bibtex]


  • 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 - [pdf] - [slides]


  • 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 - [pdf] - [slides]- [bib]


  • Automatic Classification of Dynamic Graphs

Yessin M. NEGGAZ

PhD thesis, University of Bordeaux, France, 2016 - [thesis] - [slides]


  • 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 - [pdf] - [slides] - [bib]


  • 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 - [pdf] - [slides] - [bib]


  • 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 - [pdf] - [slides] - [bib]


  • 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 - [pdf] - [slides] - [bib]


  • 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 - [pdf] - [slides] - [bib]




Contact

Email: yessin.neggaz@efrei.fr

EFREI-Paris

30-32, Av. de la République

94800 Villejuif France