| Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL |
| Former team : | MLIA |
| Publications DELYS | 2018 | 2019 | 2020 | 2021 | 2022 | Total |
|---|---|---|---|---|---|---|
| Books | 0 | 1 | 3 | 7 | 0 | 11 |
| Edited books | 0 | 0 | 0 | 0 | 0 | 0 |
| Journal articles | 8 | 7 | 6 | 1 | 0 | 22 |
| Book chapters | 0 | 2 | 0 | 0 | 0 | 2 |
| Conference papers | 17 | 13 | 23 | 13 | 8 | 74 |
| Habilitations | 0 | 0 | 0 | 0 | 0 | 0 |
| Theses | 6 | 4 | 2 | 5 | 1 | 18 |
- S. Devismes, A. Lamani, F. Petit, P. Raymond, S. Tixeuil : “Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots”, The Computer Journal, vol. 64 (1), The Computer Journal, pp. 132-154, (Oxford University Press (UK)) [Devismes 2021]