Publications

Preprints

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition
A. Casteigts, Y. Métivier, J.M. Robson
arXiv:2101.01409, 2021 - [pdf]

Autour des algorithmes distribués.
A. Casteigts, J. Chalopin, E. Godard, Y. Métivier, M. Mosbah, J.M. Robson, A. Zemmari.
Textbook (not stabilized yet), 2018 - [pdf] - [bibtex]


2026

Giant Components in Random Temporal Graphs
R. Becker, A. Casteigts, P. Crescenzi, B. Kodric, M. Raskin, M. Renken, V. Zamaraev
SIAM Journal on Discrete Mathematics, Vol. 40, Issue 2, 2026 - [journal] - [conference]


2025

Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
A. Casteigts, M. Raffinot, M. Raskin, J. Schoeters
Discrete Applied Mathematics (Elsevier), Vol. 368, 135-152, 2025 - [online] - [pdf]

Dismountability in Temporal Cliques Revisited
D. Carnevale, A. Casteigts, T. Corsini
4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND), 2025 - [pdf]

Realization of Temporally Connected Graphs Based on Degree Sequences
A. Casteigts, M. Döring, N. Morawietz
36th Symposium on Algorithms and Computation (ISAAC), 2025 - [pdf]


2024

Simple, strict, proper, happy: A study of reachability in temporal graphs
A. Casteigts, T. Corsini, W. Sarkar
Theoretical Computer Science (Elsevier), Vol. 991, 114434, 2024 - [pdf journal] - [author's pdf]

Sharp Thresholds in Random Simple Temporal Graphs
A. Casteigts, M. Raskin, M. Renken, V. Zamaraev
SIAM Journal of Computing, Vol. 53, Issue 2, 2024 - [pdf (journal)] - [pdf (arxiv)]

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs
A. Casteigts, N. Morawietz, P. Wolf
49th Symposium on Mathematical Foundations of Computer Science (MFCS), 2024 - [pdf]

Freeze-Tag in L1 Has Wake-Up Time Five with Linear Complexity
N. Bonichon, A. Casteigts, C. Gavoille, N. Hanusse
38th Symposium on Distributed Computing (DISC), 2024 - [pdf]

In Search of the Lost Tree: Hardness and Relaxation of Spanning Trees in Temporal Graphs
A. Casteigts, T. Corsini
31th Conference on Structural Information and Communication Complexity (SIROCCO), 2024 - [pdf]


2023

Giant Components in Random Temporal Graphs
R. Becker, A. Casteigts, P. Crescenzi, B. Kodric, M. Raskin, M. Renken, V. Zamaraev
27th Conference on Randomization and Computation (RANDOM), 2023 - [pdf conf] - [pdf full]


2022

Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs
A. Casteigts, T. Corsini, W. Sarkar
24th Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2022 - [pdf]

Robustness of Distances and Diameter in a Fragile Network
A. Casteigts, T. Corsini, H. Hocquard, A. Labourel
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND), 2022 - [pdf]

A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions
L. F. Afra Brito, M. Albertini, A. Casteigts and B. A. N. Travençolo
Social Network Analysis and Mining, 2022 - [pdf]


2021

Sharp Thresholds in Random Simple Temporal Graphs
A. Casteigts, M. Raskin, M. Renken, V. Zamaraev
62nd Symposium on Foundations of Computer Science (FOCS), 2021 - [pdf] - [bibtex]

Finding Temporal Paths under Waiting Time Constraints
A. Casteigts, A.-S. Himmel, H. Molter, P. Zschoche
Algorithmica (Springer), Vol. 83, Issue 9, 2754-2802, 2021. - [preliminary version] - [published version] - [bibtex]

Temporal Cliques Admit Sparse Spanners
A. Casteigts, J.G. Peters, J. Schoeters
Journal of Computer Systems and Science (Elsevier), Vol. 121, 1-17, 2021. - [preliminary version] - [published version] - [bibtex]


2020

A. Casteigts, A.-S. Himmel, H. Molter, P. Zschoche, Finding Temporal Paths under Waiting Time Constraints
31st International Symposium on Algorithms and Computation (ISAAC), 2020 - [pdf] - [bibtex]

A. Casteigts, M. Raffinot, J. Schoeters, VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
16th Int. Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), 2020 - [conf version, long version] - [bibtex]

A. Casteigts, S. Dubois, F. Petit, J.M. Robson, Robustness: a New Form of Heredity Motivated by Dynamic Networks
Theoretical Computer Science (Elsevier), Vol. 806, 429-445, 2020 - [preliminary version] - [published version] - [bibtex]


2019

A. Casteigts, J.G. Peters, J. Schoeters, Temporal Cliques Admit Sparse Spanners
46th Int. Colloquium on Automata, Languages, and Programming (ICALP), 2019 - [pdf] - [bibtex]

A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari, Deterministic Leader Election Takes $\Theta(D+\log n)$ Bit Rounds
Algorithmica (Springer), Vol. 81, Issue 5, 1901-1920, 2019. - [pdf (editor) or pdf (author)] - [slides] - [bibtex]

A. Casteigts, R. Klasing, M.Y. Neggaz, J.G. Peters, Computing Parameters of Sequence-based Dynamic Graphs
Theory of Computing Systems (Springer), Vol. 63, Issue 3, 394-417, 2019. - [pdf] - [bibtex]

A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari, Counting in One-Hop Beeping Networks
Theoretical Computer Science (Elsevier), Vol. 780, 20-28, 2019 - [pdf] - [bibtex]

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Y.M. Neggaz, Maintaining a Distributed Spanning Forest in Highly Dynamic Networks
The Computer Journal (Oxford University Press), Vol. 62, Issue 2, 231-249, 2019. - [pdf] - [related talk] - [bibtex]

A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari, Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis
Information and Computation (Elsevier), Vol. 264, 32-51, 2019. - [pdf] - [bibtex]


2018

A. Casteigts, A Journey through Dynamic Networks (with Excursions),
Habilitation thesis, Université de Bordeaux, June 4, 2018 - [pdf] - [slides] - [bibtex]
Part I also available as: Finding Structure in Dynamic Networks, CoRR, abs/1807.07801, 2018 - [pdf] - [bibtex]


2017

A. Casteigts, R. Klasing, M.Y. Neggaz, J.G. Peters, A Generic Framework for Computing Parameters of Sequence-based Dynamic Graphs
19th Intl. Conference on Structural Information and Communication Complexity (SIROCCO), 2017 - [pdf] - [bibtex]

A. Casteigts, R. Klasing, M.Y. Neggaz, J.G. Peters, Calcul de Paramètres Minimaux dans les Graphes Dynamiques
16th Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 2017 - [pdf] - [bibtex]


2016

A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari, Deterministic Leader Election Algorithm in O(D + log n) Time with Messages of Size O(1)
30th Int. Symposium on Distributed Computing (DISC), 2016 - [conf version] - [long version] - [slides] - [bibtex]

A. Casteigts, Y. Métivier, J.M. Robson, A. Zemmari, Design Patterns in Beeping Algorithms (extended abstract)
20th Int. Conference on Principles of Distributed Systems (OPODIS), 2016 - [conf version] - [long version] - [bibtex]


2015

A. Casteigts, JBotSim: a Tool for Fast Prototyping of Distributed Algorithms in Dynamic Networks
8th Int. Conference on Simulation Tools and Techniques (SIMUTOOLS), 2015 - [pdf] - [slides] - [bibtex]

A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
Int. Journal of Foundations of Computer Science, Vol. 26, Issue 4, 499-522, 2015. - [pdf] - [bibtex]

C. Gómez-Calzado, A. Casteigts, A. Lafuente, M. Larrea, A Connectivity Model for Agreement in Dynamic Systems
21st Int. Conference on Parallel Processing (EUROPAR), 2015 - [pdf] - [bibtex]

A. Casteigts, P. Flocchini, E. Godard, N. Santoro, M. Yamashita, On the Expressivity of Time-Varying Graphs
Theoretical Computer Science, Vol. 590, 27-37, 2015. - [pdf] - [bibtex]

A. Casteigts, R. Klasing, M.Y. Neggaz, J.G. Peters, Efficiently Testing T-Interval Connectivity in Dynamic Graphs
9th Int. Conference on Algorithms and Complexity (CIAC), 2015 - [pdf] - [slides] - [bibtex]


2014

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Y.M. Neggaz, Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case
18th Int. Conference on Principles of Distributed Systems (OPODIS), 2014 - [pdf] - [slides] - [bibtex]

A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Measuring Temporal Lags in Delay-Tolerant Networks
IEEE Transactions on Computers, Vol. 63, Issue 2, 397-410, 2014. - [pdf] - [bibtex]

J.-M. Berthelot, L. Bouchard, A. Casteigts, M. Chartier, A. Trugeon, J. Warnke, Les systèmes d'information sociosanitaire à l'appui de la planification locale de la santé: défis et enjeux
Global Health Promotion, Vol. 21, Issue 1, 15-22, 2014 - [pdf] - [bibtex]

M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, Y.M. Neggaz, Testing Temporal Connectivity in Sparse Dynamic Graphs
2nd AETOS Int. Conf. on Research Challenges for Future RPAS/UAV Systems (RCFRUS), 2014 - [English version] - [bibtex]


16èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 2014 - [French version] - [bibtex]

A. Jedda, A. Casteigts, G.-V. Jourdan, H. Mouftah, Bluetooth Scatternet Formation from a Time-Efficiency Perspective
Wireless Networks, Vol. 21, Issue 1, 15-22, Springer, 2014 - [pdf] - [bibtex]


2013

A. Casteigts, Impact of network dynamics on the feasibility of distributed problems: an overview of early results,
21 Jornadas de Concurrencia y Sistemas Distribuidos (JCSD), Opening Talk, 2013 - [slides]

A. Casteigts, P. Flocchini, E. Godard, N. Santoro, M. Yamashita, Expressivity of Time-Varying Graphs
19th International Symposium on Fundamentals of Computation Theory (FCT), LNCS 8070, 95-106, 2013 - [pdf] - [bibtex]

A. Casteigts, S. Chaumette, F. Guinand, Y. Pigné, Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks
10th International Conference on Adhoc, Mobile, and Wireless Networks (ADHOC-NOW), 12p, 2013 - [pdf] - [slides] - [bibtex]

A. Jedda, A. Casteigts, G.-V. Jourdan, H. Mouftah, BSF-UED: A Novel Time-Efficient Bluetooth Scatternet Formation algorithm based on Unnecessary Edges Deletion
18th IEEE Symposium on Computers and Communications (ISCC), pages 886-891, 2013 - [pdf] - [bibtex]

A. Casteigts, P. Flocchini, Deterministic Algorithms in Dynamic Networks: Formal Models and Metrics
Commissioned by Defense Research and Development Canada (DRDC), 82p, 2013 - [pdf] - [bibtex]

A. Casteigts, P. Flocchini, Deterministic Algorithms in Dynamic Networks: Problems, Analysis, and Algorithmic Tools
Commissioned by Defense Research and Development Canada (DRDC), 92p, 2013 - [pdf] - [bibtex]


2012

A. Casteigts, P. Flocchini, E. Godard, N. Santoro, M. Yamashita, Brief Announcement: Waiting in Dynamic Networks
31st ACM Symposium on Principles of Distributed Computing (PODC), 99-100, 2012 - [pdf] - [bibtex]

A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro, Time-Varying Graphs and Dynamic Networks
International Journal of Parallel, Emergent and Distributed Systems, Vol. 27, Issue 5, 387-408, Taylor & Francis, 2012. (Invited paper.) - [pdf] - [bibtex]

A. Casteigts, M.-H. Chomienne, L. Bouchard, G.-V. Jourdan, Differential Privacy in Tripartite Interaction: A Case Study with Linguistic Minorities in Canada
7th International Workshop on Data Privacy Management (DPM), Co-located with ESORICS, LNCS 7731, 75-88, 2012 - [pdf] - [slides] - [bibtex]

A. Casteigts, J. Albert, S. Chaumette, A. Nayak, I. Stojmenovic, Biconnecting a Network of Mobile Robots using Virtual Angular Forces
Computer Communications, Vol. 35, Issue 9, 1038-1046, Elsevier, 2012 - [pdf] - [bibtex]

A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Building Fastest Broadcast Trees in Periodically-Varying Graphs
CoRR, abs/1204.3058, 12p - [pdf] - [bibtex]


2011

A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Measuring Temporal Lags in Delay-Tolerant Networks
25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 209-218, 2011 - [pdf] - [bibtex]

A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro, Time-Varying Graphs and Dynamic Networks (short version)
10th International Conference on Adhoc, Mobile, and Wireless Networks (ADHOC-NOW), 346-359, 2011. (Invited paper.) - [pdf] - [slides] - [bibtex] - [long version]

A. Casteigts, A. Nayak, I. Stojmenovic, Communication Protocols for Vehicular Ad hoc Networks
Wireless Communications and Mobile Computing, Vol. 11, Issue 5, 567-582, Wiley InterScience, 2011 - [pdf] - [bibtex]

F. Amblard, A. Casteigts, P. Flocchini, W. Quattrociocchi, N. Santoro, On the Temporal Analysis of Scientific Network Evolution
3rd International Conference on Computational Aspects of Social Networks (CASoN), 169-174, 2011 - [pdf] - [bibtex]

N. Santoro, W. Quattrociocchi, P. Flocchini, A. Casteigts, F. Amblard, Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics
3rd AISB Social Networks and Multiagent Systems Symposium (SNAMAS), 32-38, 2011 - [pdf] - [bibtex]

A. Casteigts, White-Box Elliptic Curve Diffie-Hellman
Commissioned by Irdeto Canada, 8p, 2011 - [pdf]

A. Casteigts, M.-H. Chomienne, L. Bouchard, G.-V. Jourdan, Enabling Dynamic Linkage of Linguistic Census Data at Statistics Canada
Commissioned by the Institute of Population Health of Ottawa, 8p, 2011 - [pdf] - [slides] - [poster] - [bibtex]

A. Casteigts, B. Mans, L. Mathieson, On the Feasibility of Maintenance Algorithms in Dynamic Graphs
CoRR, abs/1107.2722, 11p - [pdf] - [bibtex]


2010

A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
in 6th IFIP International Conference on Theoretical Computer Science (IFIP TCS), 111-124, 2010 - [pdf] - [bibtex]

A. Casteigts, J. Albert, S. Chaumette, A. Nayak, I. Stojmenovic, Biconnecting a Network of Mobile Robots using Virtual Angular Forces
in 72nd IEEE Vehicular Technology Conference (VTC-Fall), 5p, 2010 - [pdf] - [bibtex] - [long version]

Y. Pigné, A. Casteigts, F. Guinand, S. Chaumette, Construction et maintien d'une forêt couvrante dans un réseau dynamique
in 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 4p, 2010 - [pdf] - [bibtex]

A. Casteigts, L. Bouchard, Intégration de la Dimension Temporelle dans l'Analyse des Réseaux de Santé en Français,
Commissioned by the Institute of Population Health of Ottawa, 10p, 2010 - [pdf] - [bibtex]

A. Casteigts, A. Nayak, I. Stojmenovic, Multicasting, Geocasting and Anycasting in Sensor and Actuator Networks,
Chapter 5 of Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication, A. Nayak and I. Stojmenovic (Eds.), 28p, Wiley, 2010 - [pdf] - [bibtex]

A. Casteigts, A. Nayak, I. Stojmenovic, Topology Control in Sensor, Actuator and Mobile Robot Networks,
Chapter 7 of Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication, A. Nayak and I. Stojmenovic (Eds.), 25p, Wiley, 2010 - [pdf] - [bibtex]


2009

A. Casteigts, S. Chaumette, A. Ferreira, Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks,
in 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO), LNCS 5869, 126-140, 2009 - [long version] - [bibtex] - [slides]

X. Liu, A. Casteigts, N. Goel, A. Nayak, I. Stojmenovic, Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks,
in 2nd IEEE Intl. Conference on Computer Science and its Applications (CSA), 6p, 2009 - [pdf] - [bibtex]. (Best paper award.)


2007

A. Casteigts, Contribution à l'Algorithmique Distribuée dans les Réseaux Mobiles Ad Hoc - Calculs Locaux et Réétiquetages de Graphes Dynamiques,
PhD thesis, Université de Bordeaux, 2007 - [pdf] - [slides] - [bibtex]


2006

L. Barrère, A. Casteigts, S. Chaumette, A Totally Decentralized Document Sharing System for Mobile Ad Hoc Networks,
in 4thACM Intl. Workshop on Mobility Management and Wireless Access (MobiWAC), Poster Session, 116-120, 2006.

A. Casteigts, S. Chaumette, DA-GRS and the Constraint Based Synchronization: a Unifying Approach to Deal With Dynamic Networks,
in 1st Intl. Conference on Wireless Algorithms, Systems and Applications (WASA), LNCS 4138, 688-697, 2006.

A. Casteigts, Model Driven Capabilities of the DA-GRS Model,
in 1st IEEE Intl. Conference on Autonomic and Autonomous Systems (ICAS), 24-32, 2006 - [pdf] - [bibtex]


2005

A. Casteigts, S. Chaumette, Dynamicity Aware Graph Relabeling Systems (DA-GRS) - A local computation-based model to describe MANet algorithms,
in 17th Intl. Conference on Parallel and Distributed Computing Systems (PDCS), 231-236, 2005.

A. Casteigts, S. Chaumette, Exemple d'exploitation d'un modèle en couches pour la prise en compte transparente des caractéristiques de dynamicité d'un MANet,
Research Report (RR-1349-05 LaBRI), University of Bordeaux, 2005