Dynamicity Aware Graph Relabeling Systems (DA-GRS), A Local Computation based Model to Describe Manet Algorithms. - Arnaud Casteigts; Serge Chaumette (IASTED PDCS, 2005)

Model Driven capabilities of the DA-GRS model. - Arnaud Casteigts (ICAS, 2006)

A totally decentralized document sharing system for mobile ad hoc networks. - Lionel Barrère; Arnaud Casteigts; Serge Chaumette (MOBIWAC, 2006)

Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks. - Arnaud Casteigts; Serge Chaumette (WASA, 2006)

Contribution à l'algorithmique distribuée dans les réseaux mobiles ad hoc - Calculs locaux et réétiquetages de graphes dynamiques. (Distributed algorithmics in mobile ad hoc networks - Local computations and dynamic graph relabelling systems). - Arnaud Casteigts (2007)

Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks. - Xuehong Liu; Arnaud Casteigts; Nishith Goel; Amiya Nayak; Ivan Stojmenovic (CSA, 2009)

Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. - Arnaud Casteigts; Serge Chaumette; Afonso Ferreira (SIROCCO, 2009)

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (IFIP TCS, 2010)

The JBotSim Library - Arnaud Casteigts (CoRR, 2010)

Construction et maintien d'une forêt couvrante dans un réseau dynamique - Yoann Pigné; Arnaud Casteigts; Frédéric Guinand; Serge Chaumette (CoRR, 2010)

On the temporal analysis of scientific network evolution. - Frédéric Amblard; Arnaud Casteigts; Paola Flocchini; Walter Quattrociocchi; Nicola Santoro (CASoN, 2011)

Enabling dynamic linkage of linguistic census data at Statistics Canada (extended abstract). - Arnaud Casteigts; Marie-Hélène Chomienne; Louise Bouchard; Guy-Vincent Jourdan (ISI, 2011)

Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics - Nicola Santoro; Walter Quattrociocchi; Paola Flocchini; Arnaud Casteigts; Frédéric Amblard (CoRR, 2011)

On the Assumptions about Network Dynamics in Distributed Computing - Arnaud Casteigts; Serge Chaumette; Afonso Ferreira (CoRR, 2011)

On the Feasibility of Maintenance Algorithms in Dynamic Graphs - Arnaud Casteigts; Bernard Mans; Luke Mathieson (CoRR, 2011)

Communication protocols for vehicular ad hoc networks. - Arnaud Casteigts; Amiya Nayak; Ivan Stojmenovic (Wirel. Commun. Mob. Comput., 2011)

Differential Privacy in Tripartite Interaction: A Case Study with Linguistic Minorities in Canada. - Arnaud Casteigts; Marie-Hélène Chomienne; Louise Bouchard; Guy-Vincent Jourdan (DPM/SETOP, 2012)

Brief announcement: waiting in dynamic networks. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (PODC, 2012)

Biconnecting a network of mobile robots using virtual angular forces. - Arnaud Casteigts; Jeremie Albert; Serge Chaumette; Amiya Nayak; Ivan Stojmenovic (Comput. Commun., 2012)

Building Fastest Broadcast Trees in Periodically-Varying Graphs - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (CoRR, 2012)

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (CoRR, 2012)

A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (CoRR, 2012)

Time-varying graphs and dynamic networks. - Arnaud Casteigts; Paola Flocchini; Walter Quattrociocchi; Nicola Santoro (Int. J. Parallel Emergent Distributed Syst., 2012)

Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks. - Arnaud Casteigts; Serge Chaumette; Frédéric Guinand; Yoann Pigné (ADHOC-NOW, 2013)

BSF-UED: A new time-efficient Bluetooth Scatternet Formation algorithm based on Unnecessary-Edges Deletion. - Ahmed Jedda; Arnaud Casteigts; Guy-Vincent Jourdan; Hussein T. Mouftah (ISCC, 2013)

Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (OPODIS, 2014)

Testing Temporal Connectivity in Sparse Dynamic Graphs. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (CoRR, 2014)

Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (CoRR, 2014)

Measuring Temporal Lags in Delay-Tolerant Networks. - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (IEEE Trans. Computers, 2014)

Bluetooth scatternet formation from a time-efficiency perspective. - Ahmed Jedda; Arnaud Casteigts; Guy-Vincent Jourdan; Hussein T. Mouftah (Wirel. Networks, 2014)

Efficiently Testing T -Interval Connectivity in Dynamic Graphs. - Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters (CIAC, 2015)

A Connectivity Model for Agreement in Dynamic Systems. - Carlos Gómez-Calzado; Arnaud Casteigts; Alberto Lafuente; Mikel Larrea (Euro-Par, 2015)

JBotSim: a tool for fast prototyping of distributed algorithms in dynamic networks. - Arnaud Casteigts (SimuTools, 2015)

Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. - Arnaud Casteigts; Paola Flocchini; Bernard Mans; Nicola Santoro (Int. J. Found. Comput. Sci., 2015)

On the expressivity of time-varying graphs. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (Theor. Comput. Sci., 2015)

Design Patterns in Beeping Algorithms. - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (OPODIS, 2016)

Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (DISC, 2016)

A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. - Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters (SIROCCO, 2017)

Robustness in Highly Dynamic Networks. - Arnaud Casteigts; Swan Dubois; Franck Petit; John Michael Robson (CoRR, 2017)

A Journey through Dynamic Networks (with Excursions). - Arnaud Casteigts (2018)

Finding Structure in Dynamic Networks. - Arnaud Casteigts (CoRR, 2018)

Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. - Arnaud Casteigts; Yves Métivier; J. M. Robson; Akka Zemmari (Algorithmica, 2019)

Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. - Matthieu Barjon; Arnaud Casteigts; Serge Chaumette; Colette Johnen; Yessin M. Neggaz (Comput. J., 2019)

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (CoRR, 2019)

Design patterns in beeping algorithms: Examples, emulation, and analysis. - Arnaud Casteigts; Yves Métivier; John Michael Robson; Akka Zemmari (Inf. Comput., 2019)

Computing Parameters of Sequence-Based Dynamic Graphs. - Arnaud Casteigts; Ralf Klasing; Yessin M. Neggaz; Joseph G. Peters (Theory Comput. Syst., 2019)

Counting in one-hop beeping networks. - Arnaud Casteigts; Yves Métivier; J. M. Robson; Akka Zemmari (Theor. Comput. Sci., 2019)

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints. - Arnaud Casteigts; Mathieu Raffinot; Jason Schoeters (ALGOSENSORS, 2020)

Robustness: A new form of heredity motivated by dynamic networks. - Arnaud Casteigts; Swan Dubois; Franck Petit; John Michael Robson (Theor. Comput. Sci., 2020)

Finding Temporal Paths Under Waiting Time Constraints. - Arnaud Casteigts; Anne-Sophie Himmel; Hendrik Molter; Philipp Zschoche (Algorithmica, 2021)

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. - Arnaud Casteigts; Yves Métivier; John Michael Robson (CoRR, 2021)

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). - Arnaud Casteigts; Kitty Meeks; George B. Mertzios; Rolf Niedermeier (Dagstuhl Reports, 2021)

Temporal cliques admit sparse spanners. - Arnaud Casteigts; Joseph G. Peters; Jason Schoeters (J. Comput. Syst. Sci., 2021)

Robustness of Distances and Diameter in a Fragile Network. - Arnaud Casteigts; Timothée Corsini; Hervé Hocquard; Arnaud Labourel (SAND, 2022)

Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs. - Arnaud Casteigts; Timothée Corsini; Writika Sarkar (SSS, 2022)

A dynamic data structure for temporal reachability with unsorted contact insertions. - Luiz F. A. Brito; Marcelo K. Albertini; Arnaud Casteigts; Bruno A. N. Travençolo (Soc. Netw. Anal. Min., 2022)

Giant Components in Random Temporal Graphs. - Ruben Becker; Arnaud Casteigts; Pierluigi Crescenzi; Bojana Kodric; Malte Renken; Michael Raskin; Viktor Zamaraev (APPROX/RANDOM, 2023)

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. - Arnaud Casteigts; Nils Morawietz; Petra Wolf 002 (MFCS, 2024)

In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs. - Arnaud Casteigts; Timothée Corsini (SIROCCO, 2024)

Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. - Nicolas Bonichon; Arnaud Casteigts; Cyril Gavoille; Nicolas Hanusse (DISC, 2024)

Freeze-Tag in L1 has Wake-up Time Five. - Nicolas Bonichon; Arnaud Casteigts; Cyril Gavoille; Nicolas Hanusse (CoRR, 2024)

Sharp Thresholds in Random Simple Temporal Graphs. - Arnaud Casteigts; Michael Raskin; Malte Renken; Viktor Zamaraev (SIAM J. Comput., 2024)

Simple, strict, proper, happy: A study of reachability in temporal graphs. - Arnaud Casteigts; Timothée Corsini; Writika Sarkar (Theor. Comput. Sci., 2024)

Dismountability in Temporal Cliques Revisited. - Daniele Carnevale 002; Arnaud Casteigts; Timothée Corsini (SAND, 2025)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints. - Arnaud Casteigts; Mathieu Raffinot; Mikhail A. Raskin; Jason Schoeters (Discret. Appl. Math., 2025)

Realization of Temporally Connected Graphs Based on Degree Sequences. - Arnaud Casteigts; Michelle Döring; Nils Morawietz (CoRR, 2025)