Arnaud Casteigts

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 42

Top Venues

University of Bordeaux, France (PHD)

Education History

University of Bordeaux, France

PHD

Publications

Arnaud Casteigts, Nils Morawietz, Petra Wolf
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. MFCS (2024)
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
Simple, strict, proper, happy: A study of reachability in temporal graphs. Theor. Comput. Sci. 991 (2024)
Arnaud Casteigts, Nils Morawietz, Petra Wolf
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. CoRR (2024)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53 (2) (2024)
Arnaud Casteigts, Timothée Corsini
In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs. SIROCCO (2024)
Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse
has Wake-up Time Five. CoRR (2024)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. APPROX/RANDOM (2023)
Arnaud Casteigts, Timothée Corsini
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs. CoRR (2023)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. FOCS (2022)
Luiz F. A. Brito, Marcelo K. Albertini, Arnaud Casteigts, Bruno A. N. Travençolo
A dynamic data structure for temporal reachability with unsorted contact insertions. Soc. Netw. Anal. Min. 12 (1) (2022)
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs. SSS (2022)
Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel
Robustness of Distances and Diameter in a Fragile Network. SAND (2022)
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
Simple, strict, proper, happy: A study of reachability in temporal graphs. CoRR (2022)
Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev
Giant Components in Random Temporal Graphs. CoRR (2022)
Arnaud Casteigts, Joseph G. Peters, Jason Schoeters
Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121 (2021)
Luiz F. Afra Brito, Marcelo Keese Albertini, Arnaud Casteigts, Bruno A. N. Travençolo
A Dynamic Data Structure for Temporal Reachability with Unsorted Contact Insertions. CoRR (2021)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. FOCS (2021)
Arnaud Casteigts, Yves Métivier, John Michael Robson
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR (2021)
Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11 (3) (2021)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83 (9) (2021)
Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson
Robustness: A new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806 (2020)
Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters
VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints. CoRR (2020)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
Finding Temporal Paths Under Waiting Time Constraints. ISAAC (2020)
Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev
Sharp Thresholds in Random Simple Temporal Graphs. CoRR (2020)
Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters
VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints. ALGOSENSORS (2020)
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. Comput. J. 62 (2) (2019)
Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81 (5) (2019)
Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari
Counting in one-hop beeping networks. Theor. Comput. Sci. 780 (2019)
Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson
Robustness: a New Form of Heredity Motivated by Dynamic Networks. CoRR (2019)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. 264 (2019)
Arnaud Casteigts, Joseph G. Peters, Jason Schoeters
Temporal Cliques Admit Sparse Spanners. ICALP (2019)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
Computing Parameters of Sequence-Based Dynamic Graphs. Theory Comput. Syst. 63 (3) (2019)
Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR (2019)
Arnaud Casteigts
Finding Structure in Dynamic Networks. CoRR (2018)
Arnaud Casteigts, Joseph G. Peters, Jason Schoeters
Temporal Cliques Admit Sparse Spanners. CoRR (2018)
Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson
Robustness in Highly Dynamic Networks. CoRR (2017)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. SIROCCO (2017)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design Patterns in Beeping Algorithms. OPODIS (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Design Patterns in Beeping Algorithms. CoRR (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Deterministic Leader Election in O(D+\log n) Time with Messages of Size O(1). DISC (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Deterministic Leader Election in O(D+ log n) Time with Messages of Size O(1). CoRR (2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari
Counting in One-Hop Beeping Networks. CoRR (2016)
Arnaud Casteigts
JBotSim: a tool for fast prototyping of distributed algorithms in dynamic networks. SimuTools (2015)
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. Int. J. Found. Comput. Sci. 26 (4) (2015)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
Efficiently Testing T-Interval Connectivity in Dynamic Graphs. CoRR (2015)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
On the expressivity of time-varying graphs. Theor. Comput. Sci. 590 (2015)
Carlos Gómez-Calzado, Arnaud Casteigts, Alberto Lafuente, Mikel Larrea
A Connectivity Model for Agreement in Dynamic Systems. Euro-Par (2015)
Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters
Efficiently Testing T -Interval Connectivity in Dynamic Graphs. CIAC (2015)
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité. CoRR (2014)
Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein T. Mouftah
Bluetooth scatternet formation from a time-efficiency perspective. Wirel. Networks 20 (5) (2014)
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. CoRR (2014)
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
Measuring Temporal Lags in Delay-Tolerant Networks. IEEE Trans. Computers 63 (2) (2014)
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. OPODIS (2014)
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
Testing Temporal Connectivity in Sparse Dynamic Graphs. CoRR (2014)
Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné
Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks. ADHOC-NOW (2013)
Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein T. Mouftah
BSF-UED: A new time-efficient Bluetooth Scatternet Formation algorithm based on Unnecessary-Edges Deletion. ISCC (2013)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
Expressivity of Time-Varying Graphs. FCT (2013)
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
Building Fastest Broadcast Trees in Periodically-Varying Graphs CoRR (2012)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks CoRR (2012)
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast CoRR (2012)
Arnaud Casteigts, Marie-Hélène Chomienne, Louise Bouchard, Guy-Vincent Jourdan
Differential Privacy in Tripartite Interaction: A Case Study with Linguistic Minorities in Canada. DPM/SETOP (2012)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
Brief announcement: waiting in dynamic networks. PODC (2012)
Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro
Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distributed Syst. 27 (5) (2012)
Arnaud Casteigts, Jeremie Albert, Serge Chaumette, Amiya Nayak, Ivan Stojmenovic
Biconnecting a network of mobile robots using virtual angular forces. Comput. Commun. 35 (9) (2012)
Arnaud Casteigts, Serge Chaumette, Afonso Ferreira
On the Assumptions about Network Dynamics in Distributed Computing CoRR (2011)
Frédéric Amblard, Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro
On the temporal analysis of scientific network evolution. CASoN (2011)
Arnaud Casteigts, Bernard Mans, Luke Mathieson
On the Feasibility of Maintenance Algorithms in Dynamic Graphs CoRR (2011)
Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro
Time-Varying Graphs and Dynamic Networks. ADHOC-NOW (2011)
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
Measuring Temporal Lags in Delay-Tolerant Networks. IPDPS (2011)
Nicola Santoro, Walter Quattrociocchi, Paola Flocchini, Arnaud Casteigts, Frédéric Amblard
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics CoRR (2011)
Arnaud Casteigts, Marie-Hélène Chomienne, Louise Bouchard, Guy-Vincent Jourdan
Enabling dynamic linkage of linguistic census data at Statistics Canada (extended abstract). ISI (2011)
Arnaud Casteigts, Amiya Nayak, Ivan Stojmenovic
networks. Wirel. Commun. Mob. Comput. 11 (5) (2011)
Arnaud Casteigts
The JBotSim Library CoRR (2010)
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. IFIP TCS (2010)
Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro
Time-Varying Graphs and Dynamic Networks CoRR (2010)
Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, Serge Chaumette
Construction et maintien d'une forêt couvrante dans un réseau dynamique CoRR (2010)
Arnaud Casteigts, Jeremie Albert, Serge Chaumette, Amiya Nayak, Ivan Stojmenovic
Biconnecting a Network of Mobile Robots Using Virtual Angular Forces. VTC Fall (2010)
Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné
Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks CoRR (2009)
Xuehong Liu, Arnaud Casteigts, Nishith Goel, Amiya Nayak, Ivan Stojmenovic
Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks. CSA (2009)
Arnaud Casteigts, Serge Chaumette, Afonso Ferreira
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. SIROCCO (2009)
Arnaud Casteigts
Model Driven capabilities of the DA-GRS model. ICAS (2006)
Lionel Barrère, Arnaud Casteigts, Serge Chaumette
A totally decentralized document sharing system for mobile ad hoc networks. MOBIWAC (2006)
Arnaud Casteigts, Serge Chaumette
Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks. WASA (2006)
Arnaud Casteigts, Serge Chaumette
Dynamicity Aware Graph Relabeling Systems (DA-GRS), A Local Computation based Model to Describe Manet Algorithms. IASTED PDCS (2005)

Arnaud Casteigts.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Arnaud Casteigts