| Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | Phare |
| Publications NPA | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Books | 0 | 0 | 0 | 0 | 0 | 1 | 0 | 1 |
| Edited books | 2 | 0 | 3 | 2 | 0 | 1 | 0 | 8 |
| Journal articles | 15 | 15 | 10 | 8 | 12 | 10 | 7 | 77 |
| Book chapters | 6 | 0 | 2 | 0 | 2 | 2 | 0 | 12 |
| Conference papers | 34 | 27 | 32 | 29 | 32 | 33 | 7 | 194 |
| Habilitations | 0 | 1 | 0 | 1 | 1 | 0 | 0 | 3 |
| Theses | 6 | 4 | 1 | 5 | 2 | 3 | 3 | 24 |
- L. Blin, L. Feuilloley, G. Le Bouder : “Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms”, Discrete Mathematics and Theoretical Computer Science, vol. 25 (1), LIPIcs, pp. 5, (DMTCS) [Blin 2023b]
- S. Bouchard, Y. Dieudonné, A. Labourel, A. Pelc : “Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs”, ACM Transactions on Algorithms, vol. 19 (3), pp. 1-32, (Association for Computing Machinery) [Bouchard 2023]
- Q. Bramas, A. Lamani, S. Tixeuil : “Stand up indulgent gathering”, Theoretical Computer Science, vol. 939, pp. 63-77, (Elsevier) [Bramas 2023b]
- Q. Bramas, A. Lamani, S. Tixeuil : “The agreement power of disagreement”, Theoretical Computer Science, vol. 954, pp. 113772, (Elsevier) [Bramas 2023d]
- X. Défago, A. Heriban, S. Tixeuil, K. Wada : “Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space”, Robotics and Autonomous Systems, vol. 163, pp. 104378, (Elsevier) [Défago 2023]
- Y. Liu, K. Zhang, B. Hou, Q. Li, J. Feng, Th.‑M.‑T. Nguyen, A. De La Fortelle : “Real-time traffic impedance and priority based cooperative path planning mechanism for SOC-ITS: Efficiency and equilibrium”, Simulation Modelling Practice and Theory, vol. 122, pp. 102683, (Elsevier) [Liu 2023]
- E. Papanastasiou, A. Giovanidis : “Constrained Expectation-Maximisation for inference of social graphs explaining online user-user interactions”, Social Network Analysis and Mining, vol. 13 (1), pp. 41, (Springer) [Papanastasiou 2023]