Arnaud Casteigts
Université de Bordeaux
H-index: 22
Europe-France
Top articles of Arnaud Casteigts
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
Sharp thresholds in random simple temporal graphs | SIAM Journal on Computing | Arnaud Casteigts Michael Raskin Malte Renken Viktor Zamaraev | 2024/4/30 |
Simple, strict, proper, happy: A study of reachability in temporal graphs | Theoretical Computer Science | Arnaud Casteigts Timothée Corsini Writika Sarkar | 2024/2/6 |
Freeze-Tag in has Wake-up Time Five | arXiv preprint arXiv:2402.03258 | Nicolas Bonichon Arnaud Casteigts Cyril Gavoille Nicolas Hanusse | 2024/2/5 |
Vers une cryptographie en boîte blanche | Interstices | Arnaud Casteigts Agathe Houzelot | 2023/7/13 |
Simple, strict, propre, happy: accessibilité et expressivité des graphes temporels | Arnaud Casteigts Timothée Corsini Writika Sarkar | 2023/5/22 | |
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs | arXiv preprint arXiv:2312.06260 | Arnaud Casteigts Timothée Corsini | 2023/12/11 |
Giant components in random temporal graphs | arXiv preprint arXiv:2205.14888 | Ruben Becker Arnaud Casteigts Pierluigi Crescenzi Bojana Kodric Malte Renken | 2022/5/30 |
Robustesse des distances et du diamètre dans un réseau fragile | Arnaud Casteigts Timothée Corsini Hervé Hocquard Arnaud Labourel | 2022/2/23 | |
Trouver des spanners peu denses dans les cliques temporelles | Jason Schoeters Arnaud Casteigts Joseph Peters | 2022/2/23 | |
Robustness of distances and diameter in a fragile network | Arnaud Casteigts Timothée Corsini Hervé Hocquard Arnaud Labourel | 2022 | |
Temporal graphs: Structure, algorithms, applications (dagstuhl seminar 21171) | Arnaud Casteigts Kitty Meeks George B Mertzios Rolf Niedermeier | 2021 | |
Dagstuhl Reports, Vol. 11, Issue 3 ISSN 2192-5283 | Katy Börner Stephen G Kobourov Arnaud Casteigts Kitty Meeks George B Mertzios | 2021/9 | |
Finding temporal paths under waiting time constraints | Algorithmica | Arnaud Casteigts Anne-Sophie Himmel Hendrik Molter Philipp Zschoche | 2021/6/4 |
VectorTSP: un problème de voyageur de commerce avec des contraintes d'accélération | Arnaud Casteigts Mathieu Raffinot Jason Schoeters | 2021/6/1 | |
A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions | arXiv e-prints | Luiz F Afra Brito Marcelo Albertini Arnaud Casteigts Bruno AN Travençolo | 2021/2 |
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition | arXiv preprint arXiv:2101.01409 | Arnaud Casteigts Yves Métivier John Michael Robson | 2021/1/5 |
Robustness: A new form of heredity motivated by dynamic networks | Theoretical Computer Science | Arnaud Casteigts Swan Dubois Franck Petit John M Robson | 2020/2/2 |
31st International Symposium on Algorithms and Computation (ISAAC 2020) | Sang-il Oum Ke Yi Louis Dublois Tesshu Hanaka Mehdi Khosravian Ghadikolaei | 2020 | |
VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints | Arnaud Casteigts Mathieu Raffinot Jason Schoeters | 2020 |
Co-Authors
