Paul Bastide

According to our database, Paul Bastide authored at least 18 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2026

Random embeddings of bounded-degree trees with optimal spread.

Paul Bastide, Clément Legrand-Duchesne, Alp Müyesser

Comb. Probab. Comput., 2026

2025

Improved exploration of temporal graphs.

Paul Bastide, Carla Groenland, Lukas Michel, Clément Rambaud

CoRR, November, 2025

Cube Height, Cube Width and Related Extremal Problems for Posets.

Paul Bastide, Jedrzej Hodor, Hoang La, William T. Trotter

CoRR, October, 2025

Faithful universal graphs for minor-closed classes.

Paul Bastide, Louis Esperet, Carla Groenland, Claire Hilaire, Clément Rambaud, Alexandra Wesolek

CoRR, April, 2025

Local structure in combinatorics: reconstruction, saturation, spreadness and universality. (Structures locales en combinatoire: reconstruction, saturation, dispersion et universalité).

Paul Bastide

PhD thesis, 2025

Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles.

Paul Bastide, Carla Groenland

Random Struct. Algorithms, 2025

A polynomial upper bound for poset saturation.

Paul Bastide, Carla Groenland, Maria-Romina Ivan, Tom Johnston

Eur. J. Comb., 2025

Path eccentricity of k-AT-free graphs and application on graphs with the consecutive ones property.

Paul Bastide, Claire Hilaire, Eileen Robinson

Discret. Math., 2025

2024

Distance Reconstruction of Sparse Random Graphs.

Paul Bastide

CoRR, 2024

Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron.

Paul Bastide, Carla Groenland, Hugo Jacob, Tom Johnston

Comb. Theory, 2024

Quasi-Linear Distance Query Reconstruction for Graphs of Bounded Treelength.

Paul Bastide, Carla Groenland

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

Optimal distance query reconstruction for graphs without long induced cycles.

Paul Bastide, Carla Groenland

CoRR, 2023

Improved Pyrotechnics: Closer to the Burning Number Conjecture.

Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie

Electron. J. Comb., 2023

Reconstructing Graphs from Connected Triples.

Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2021

Improved pyrotechnics : Closer to the burning graph conjecture.

Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie

CoRR, 2021

On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models.

Paul Bastide, Pierre Fraigniaud

CoRR, 2021

Brief Annoucement: On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models.

Paul Bastide, Pierre Fraigniaud

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Self-Stabilizing Clock Synchronization with 1-bit Messages.

Paul Bastide, George Giakkoupis, Hayk Saribekyan

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021