Arnaud Casteigts

95 papers A* 3A 4B 9C 5Journal 55Unranked 15

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