Quasi-linear distance query reconstruction for graphs of bounded treelength
Bastide, P
Groenland, C
(16 Oct 2024)
https://arxiv.org/abs/2410.12594v1
Circular sorting, strong complete mappings and wreath product constructions
Bastide, P
Bishnoi, A
Groenland, C
Gijswijt, D
Joshi, R
(21 Oct 2025)
https://arxiv.org/abs/2510.18529v3
Improved exploration of temporal graphs
Bastide, P
Groenland, C
Michel, L
Rambaud, C
(27 Nov 2025)
https://arxiv.org/abs/2511.22604v1
Optimal distance query reconstruction for graphs without long induced cycles
Bastide, P
Groenland, C
(09 Jun 2023)
https://arxiv.org/abs/2306.05979v4
A Polynomial Upper Bound for Poset Saturation
Bastide, P
Groenland, C
Ivan, M
Johnston, T
(07 Oct 2023)
https://arxiv.org/abs/2310.04634v2
Distance Reconstruction of Sparse Random Graphs
Bastide, P
(24 Jul 2024)
https://arxiv.org/abs/2407.17376v1
Cube Height, Cube Width and Related Extremal Problems for Posets
Bastide, P
Hodor, J
La, H
Trotter, W
(01 Oct 2025)
https://arxiv.org/abs/2510.00928v1
Covering graphs by isometric trees
Bastide, P
Duron, J
Hodor, J
Liu, W
Nie, X
(05 Nov 2025)
https://arxiv.org/abs/2511.03524v2
On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models
Bastide, P
Fraigniaud, P
(04 Aug 2021)
https://arxiv.org/abs/2108.01989v1
Random embeddings of bounded degree trees with optimal spread
Bastide, P
Legrand-Duchesne, C
Müyesser, A
(10 Sep 2024)
https://arxiv.org/abs/2409.06640v1