( en | de | ru )

 

Disambiguation of "Casteigts, Arnaud"

Author of the publication

copydeleteadd this publication to your clipboard
Sharp Thresholds in Random Simple Temporal Graphs.

, , , and . CoRR, (2020)https://arxiv.org/abs/2011.03738.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arnaud Casteigts

Arnaud Mende

Arnaud Moris

Julien Arnaud

Arnaud Dewalque

 

Other publications of authors with the same name

Sharp Thresholds in Random Simple Temporal Graphs, , , and . 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), page 319-326. (February 2022)Robustness of Distances and Diameter in a Fragile Network., , , and . SAND, volume 221 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Giant Components in Random Temporal Graphs., , , , , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs., and . SIROCCO, volume 14662 of Lecture Notes in Computer Science, page 138-155. Springer, (2024)Sharp Thresholds in Random Simple Temporal Graphs., , , and . CoRR, (2020)https://arxiv.org/abs/2011.03738.Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs., , and . CoRR, (2024)Temporal cliques admit sparse spanners., , and . J. Comput. Syst. Sci., (2021)Simple, strict, proper, happy: A study of reachability in temporal graphs., , and . CoRR, (2022)Sharp Thresholds in Random Simple Temporal Graphs., , , and . FOCS, page 319-326. IEEE, (2021)Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs., , and . SSS, volume 13751 of Lecture Notes in Computer Science, page 3-18. Springer, (2022)