Arnaud Casteigts

According to our database, Arnaud Casteigts authored at least 63 papers between 2005 and 2024.

Collaborative distances:

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

2024

Simple, strict, proper, happy: A study of reachability in temporal graphs.

Arnaud Casteigts, Timothée Corsini, Writika Sarkar

Theor. Comput. Sci., 2024

Sharp Thresholds in Random Simple Temporal Graphs.

Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev

SIAM J. Comput., 2024

Freeze-Tag in L₁ has Wake-up Time Five.

Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse

CoRR, 2024

Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity.

Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse

Proceedings of the 38th International Symposium on Distributed Computing, 2024

In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs.

Arnaud Casteigts, Timothée Corsini

Proceedings of the Structural Information and Communication Complexity, 2024

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs.

Arnaud Casteigts, Nils Morawietz, Petra Wolf

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Giant Components in Random Temporal Graphs.

Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev

Proceedings of the Approximation, 2023

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

Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs.

Arnaud Casteigts, Timothée Corsini, Writika Sarkar

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Robustness of Distances and Diameter in a Fragile Network.

Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021

Temporal cliques admit sparse spanners.

Arnaud Casteigts, Joseph G. Peters, Jason Schoeters

J. Comput. Syst. Sci., 2021

Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171).

Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier

Dagstuhl Reports, 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

Finding Temporal Paths Under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

Algorithmica, 2021

2020

Robustness: A new form of heredity motivated by dynamic networks.

Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson

Theor. Comput. Sci., 2020

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints.

Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters

Proceedings of the Algorithms for Sensor Systems, 2020

2019

Counting in one-hop beeping networks.

Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari

Theor. Comput. Sci., 2019

Computing Parameters of Sequence-Based Dynamic Graphs.

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters

Theory Comput. Syst., 2019

Design patterns in beeping algorithms: Examples, emulation, and analysis.

Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari

Inf. Comput., 2019

The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints.

Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche

CoRR, 2019

Maintaining a Distributed Spanning Forest in Highly Dynamic Networks.

Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz

Comput. J., 2019

Deterministic Leader Election Takes Θ(D+log n) Bit Rounds.

Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari

Algorithmica, 2019

2018

Finding Structure in Dynamic Networks.

Arnaud Casteigts

CoRR, 2018

A Journey through Dynamic Networks (with Excursions).

Arnaud Casteigts

, 2018

2017

Robustness in Highly Dynamic Networks.

Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson

CoRR, 2017

A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs.

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters

Proceedings of the Structural Information and Communication Complexity, 2017

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

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Design Patterns in Beeping Algorithms.

Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015

On the expressivity of time-varying graphs.

Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita

Theor. Comput. Sci., 2015

Shortest, Fastest, and Foremost Broadcast in Dynamic Networks.

Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro

Int. J. Found. Comput. Sci., 2015

JBotSim: a tool for fast prototyping of distributed algorithms in dynamic networks.

Arnaud Casteigts

Proceedings of the 8th International Conference on Simulation Tools and Techniques, 2015

A Connectivity Model for Agreement in Dynamic Systems.

Carlos Gómez-Calzado, Arnaud Casteigts, Alberto Lafuente, Mikel Larrea

Proceedings of the Euro-Par 2015: Parallel Processing, 2015

Efficiently Testing T -Interval Connectivity in Dynamic Graphs.

Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

Bluetooth scatternet formation from a time-efficiency perspective.

Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein T. Mouftah

Wirel. Networks, 2014

Measuring Temporal Lags in Delay-Tolerant Networks.

Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro

IEEE Trans. Computers, 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

Testing Temporal Connectivity in Sparse Dynamic Graphs.

Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz

CoRR, 2014

Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case.

Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

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

Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks.

Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

Time-varying graphs and dynamic networks.

Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro

Int. J. Parallel Emergent Distributed Syst., 2012

A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast

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

Building Fastest Broadcast Trees in Periodically-Varying Graphs

Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro

CoRR, 2012

Biconnecting a network of mobile robots using virtual angular forces.

Arnaud Casteigts, Jeremie Albert, Serge Chaumette, Amiya Nayak, Ivan Stojmenovic

Comput. Commun., 2012

Brief announcement: waiting in dynamic networks.

Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

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

Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2012

2011

Communication protocols for vehicular <i>ad hoc</i> networks.

Arnaud Casteigts, Amiya Nayak, Ivan Stojmenovic

Wirel. Commun. Mob. Comput., 2011

On the Feasibility of Maintenance Algorithms in Dynamic Graphs

Arnaud Casteigts, Bernard Mans, Luke Mathieson

CoRR, 2011

On the Assumptions about Network Dynamics in Distributed Computing

Arnaud Casteigts, Serge Chaumette, Afonso Ferreira

CoRR, 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

Enabling dynamic linkage of linguistic census data at Statistics Canada (extended abstract).

Arnaud Casteigts, Marie-Hélène Chomienne, Louise Bouchard, Guy-Vincent Jourdan

Proceedings of the 2011 IEEE International Conference on Intelligence and Security Informatics, 2011

On the temporal analysis of scientific network evolution.

Frédéric Amblard, Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro

Proceedings of the International Conference on Computational Aspects of Social Networks, 2011

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

The JBotSim Library

Arnaud Casteigts

CoRR, 2010

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility.

Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro

Proceedings of the Theoretical Computer Science, 2010

2009

Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks.

Arnaud Casteigts, Serge Chaumette, Afonso Ferreira

Proceedings of the Structural Information and Communication Complexity, 2009

Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks.

Xuehong Liu, Arnaud Casteigts, Nishith Goel, Amiya Nayak, Ivan Stojmenovic

Proceedings of the 2nd International Conference on Computer Science and its Applications, 2009

2007

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

PhD thesis, 2007

2006

Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks.

Arnaud Casteigts, Serge Chaumette

Proceedings of the Wireless Algorithms, 2006

A totally decentralized document sharing system for mobile ad hoc networks.

Lionel Barrère, Arnaud Casteigts, Serge Chaumette

Proceedings of the Forth ACM International Workshop on Mobility Management & Wireless Access, 2006

Model Driven capabilities of the DA-GRS model.

Arnaud Casteigts

Proceedings of the 2006 International Conference on Autonomic and Autonomous Systems (ICAS 2006), 2006

2005

Dynamicity Aware Graph Relabeling Systems (DA-GRS), A Local Computation based Model to Describe Manet Algorithms.

Arnaud Casteigts, Serge Chaumette

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005