Arnaud Casteigts

Orcid: 0000-0002-7819-7013

According to our database1, Arnaud Casteigts authored at least 61 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Freeze-Tag in L<sub>1</sub> has Wake-up Time Five.
CoRR, 2024

2023
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs.
CoRR, 2023

Giant Components in Random Temporal Graphs.
Proceedings of the Approximation, 2023

2022
A dynamic data structure for temporal reachability with unsorted contact insertions.
Soc. Netw. Anal. Min., 2022

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

Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Robustness of Distances and Diameter in a Fragile Network.
Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

2021
Temporal cliques admit sparse spanners.
J. Comput. Syst. Sci., 2021

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

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition.
CoRR, 2021

Finding Temporal Paths Under Waiting Time Constraints.
Algorithmica, 2021

Sharp Thresholds in Random Simple Temporal Graphs.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Robustness: A new form of heredity motivated by dynamic networks.
Theor. Comput. Sci., 2020

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints.
Proceedings of the Algorithms for Sensor Systems, 2020

2019
Counting in one-hop beeping networks.
Theor. Comput. Sci., 2019

Computing Parameters of Sequence-Based Dynamic Graphs.
Theory Comput. Syst., 2019

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

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

Maintaining a Distributed Spanning Forest in Highly Dynamic Networks.
Comput. J., 2019

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

2018
Finding Structure in Dynamic Networks.
CoRR, 2018

A Journey through Dynamic Networks (with Excursions).
, 2018

2017
Robustness in Highly Dynamic Networks.
CoRR, 2017

A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs.
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).
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Design Patterns in Beeping Algorithms.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
On the expressivity of time-varying graphs.
Theor. Comput. Sci., 2015

Shortest, Fastest, and Foremost Broadcast in Dynamic Networks.
Int. J. Found. Comput. Sci., 2015

JBotSim: a tool for fast prototyping of distributed algorithms in dynamic networks.
Proceedings of the 8th International Conference on Simulation Tools and Techniques, 2015

A Connectivity Model for Agreement in Dynamic Systems.
Proceedings of the Euro-Par 2015: Parallel Processing, 2015

Efficiently Testing T -Interval Connectivity in Dynamic Graphs.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Bluetooth scatternet formation from a time-efficiency perspective.
Wirel. Networks, 2014

Measuring Temporal Lags in Delay-Tolerant Networks.
IEEE Trans. Computers, 2014

Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité.
CoRR, 2014

Testing Temporal Connectivity in Sparse Dynamic Graphs.
CoRR, 2014

Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case.
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.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013

Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
Time-varying graphs and dynamic networks.
Int. J. Parallel Emergent Distributed Syst., 2012

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

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
CoRR, 2012

Building Fastest Broadcast Trees in Periodically-Varying Graphs
CoRR, 2012

Biconnecting a network of mobile robots using virtual angular forces.
Comput. Commun., 2012

Brief announcement: waiting in dynamic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Differential Privacy in Tripartite Interaction: A Case Study with Linguistic Minorities in Canada.
Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2012

2011
Communication protocols for vehicular <i>ad hoc</i> networks.
Wirel. Commun. Mob. Comput., 2011

On the Feasibility of Maintenance Algorithms in Dynamic Graphs
CoRR, 2011

On the Assumptions about Network Dynamics in Distributed Computing
CoRR, 2011

Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics
CoRR, 2011

Enabling dynamic linkage of linguistic census data at Statistics Canada (extended abstract).
Proceedings of the 2011 IEEE International Conference on Intelligence and Security Informatics, 2011

On the temporal analysis of scientific network evolution.
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
CoRR, 2010

The JBotSim Library
CoRR, 2010

Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility.
Proceedings of the Theoretical Computer Science, 2010

2009
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks.
Proceedings of the Structural Information and Communication Complexity, 2009

Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks.
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).
PhD thesis, 2007

2006
Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks.
Proceedings of the Wireless Algorithms, 2006

A totally decentralized document sharing system for mobile ad hoc networks.
Proceedings of the Forth ACM International Workshop on Mobility Management & Wireless Access, 2006

Model Driven capabilities of the DA-GRS model.
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.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005


  Loading...