default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Casteigts
Person information
SPARQL queries 
🛈 Please note that only 65% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j18]Arnaud Casteigts
, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. SIAM J. Comput. 53(2): 346-388 (2024)- [j17]Arnaud Casteigts, Timothée Corsini, Writika Sarkar:
Simple, strict, proper, happy: A study of reachability in temporal graphs. Theor. Comput. Sci. 991: 114434 (2024) - [c34]Arnaud Casteigts, Nils Morawietz, Petra Wolf:
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. MFCS 2024: 36:1-36:17 - [c33]Arnaud Casteigts, Timothée Corsini:
In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs. SIROCCO 2024: 138-155 - [c32]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. DISC 2024: 9:1-9:16 - [e1]Arnaud Casteigts, Fabian Kuhn:
3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024, June 5-7, 2024, Patras, Greece. LIPIcs 292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-315-7 [contents] - [i32]Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, Nicolas Hanusse:
Freeze-Tag in L1 has Wake-up Time Five. CoRR abs/2402.03258 (2024) - [i31]Arnaud Casteigts, Nils Morawietz, Petra Wolf:
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs. CoRR abs/2406.19514 (2024) - 2023
- [c31]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. APPROX/RANDOM 2023: 29:1-29:17 - [i30]Arnaud Casteigts, Timothée Corsini:
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs. CoRR abs/2312.06260 (2023) - 2022
- [j16]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): 22 (2022) - [c30]Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel:
Robustness of Distances and Diameter in a Fragile Network. SAND 2022: 9:1-9:16 - [c29]Arnaud Casteigts, Timothée Corsini, Writika Sarkar:
Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs. SSS 2022: 3-18 - [i29]Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev:
Giant Components in Random Temporal Graphs. CoRR abs/2205.14888 (2022) - [i28]Arnaud Casteigts, Timothée Corsini, Writika Sarkar:
Simple, strict, proper, happy: A study of reachability in temporal graphs. CoRR abs/2208.01720 (2022) - 2021
- [j15]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
Finding Temporal Paths Under Waiting Time Constraints. Algorithmica 83(9): 2754-2802 (2021) - [j14]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal cliques admit sparse spanners. J. Comput. Syst. Sci. 121: 1-17 (2021) - [c28]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. FOCS 2021: 319-326 - [i27]Arnaud Casteigts, Yves Métivier, John Michael Robson:
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition. CoRR abs/2101.01409 (2021) - [i26]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 abs/2102.04187 (2021) - [i25]Arnaud Casteigts, Kitty Meeks, George B. Mertzios, Rolf Niedermeier:
Temporal Graphs: Structure, Algorithms, Applications (Dagstuhl Seminar 21171). Dagstuhl Reports 11(3): 16-46 (2021) - 2020
- [j13]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: A new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806: 429-445 (2020) - [c27]Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters:
VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints. ALGOSENSORS 2020: 45-59 - [c26]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
Finding Temporal Paths Under Waiting Time Constraints. ISAAC 2020: 30:1-30:18 - [i24]Arnaud Casteigts, Mathieu Raffinot, Jason Schoeters:
VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints. CoRR abs/2006.03666 (2020) - [i23]Arnaud Casteigts, Michael Raskin, Malte Renken, Viktor Zamaraev:
Sharp Thresholds in Random Simple Temporal Graphs. CoRR abs/2011.03738 (2020)
2010 – 2019
- 2019
- [j12]Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari:
Deterministic Leader Election Takes Θ(D+log n) Bit Rounds. Algorithmica 81(5): 1901-1920 (2019) - [j11]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. Comput. J. 62(2): 231-246 (2019) - [j10]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design patterns in beeping algorithms: Examples, emulation, and analysis. Inf. Comput. 264: 32-51 (2019) - [j9]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Computing Parameters of Sequence-Based Dynamic Graphs. Theory Comput. Syst. 63(3): 394-417 (2019) - [j8]Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari:
Counting in one-hop beeping networks. Theor. Comput. Sci. 780: 20-28 (2019) - [c25]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal Cliques Admit Sparse Spanners. ICALP 2019: 134:1-134:14 - [i22]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: a New Form of Heredity Motivated by Dynamic Networks. CoRR abs/1905.04106 (2019) - [i21]Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, Philipp Zschoche:
The Computational Complexity of Finding Temporal Paths under Waiting Time Constraints. CoRR abs/1909.06437 (2019) - 2018
- [b2]Arnaud Casteigts:
A Journey through Dynamic Networks (with Excursions). University of Bordeaux, France, 2018 - [i20]Arnaud Casteigts:
Finding Structure in Dynamic Networks. CoRR abs/1807.07801 (2018) - [i19]Arnaud Casteigts, Joseph G. Peters, Jason Schoeters:
Temporal Cliques Admit Sparse Spanners. CoRR abs/1810.00104 (2018) - 2017
- [c24]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. SIROCCO 2017: 321-338 - [i18]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness in Highly Dynamic Networks. CoRR abs/1703.03190 (2017) - 2016
- [c23]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. OPODIS 2016: 15:1-15:16 - [c22]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: 16-28 - [i17]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 abs/1605.01903 (2016) - [i16]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Counting in One-Hop Beeping Networks. CoRR abs/1605.09516 (2016) - [i15]Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. CoRR abs/1607.02951 (2016) - 2015
- [j7]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. Int. J. Found. Comput. Sci. 26(4): 499-522 (2015) - [j6]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
On the expressivity of time-varying graphs. Theor. Comput. Sci. 590: 27-37 (2015) - [c21]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T -Interval Connectivity in Dynamic Graphs. CIAC 2015: 89-100 - [c20]Carlos Gómez-Calzado, Arnaud Casteigts, Alberto Lafuente, Mikel Larrea:
A Connectivity Model for Agreement in Dynamic Systems. Euro-Par 2015: 333-345 - [c19]Arnaud Casteigts:
JBotSim: a tool for fast prototyping of distributed algorithms in dynamic networks. SimuTools 2015: 290-292 - [i14]Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters:
Efficiently Testing T-Interval Connectivity in Dynamic Graphs. CoRR abs/1502.00089 (2015) - 2014
- [j5]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Measuring Temporal Lags in Delay-Tolerant Networks. IEEE Trans. Computers 63(2): 397-410 (2014) - [j4]Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein T. Mouftah:
Bluetooth scatternet formation from a time-efficiency perspective. Wirel. Networks 20(5): 1133-1156 (2014) - [c18]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. OPODIS 2014: 277-292 - [i13]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Testing Temporal Connectivity in Sparse Dynamic Graphs. CoRR abs/1404.7634 (2014) - [i12]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 abs/1405.0170 (2014) - [i11]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. CoRR abs/1410.4373 (2014) - 2013
- [c17]Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné:
Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks. ADHOC-NOW 2013: 99-110 - [c16]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs. FCT 2013: 95-106 - [c15]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: 886-891 - 2012
- [j3]Arnaud Casteigts, Jeremie Albert, Serge Chaumette, Amiya Nayak, Ivan Stojmenovic:
Biconnecting a network of mobile robots using virtual angular forces. Comput. Commun. 35(9): 1038-1046 (2012) - [j2]Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distributed Syst. 27(5): 387-408 (2012) - [c14]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: 75-88 - [c13]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Brief announcement: waiting in dynamic networks. PODC 2012: 99-100 - [i10]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Building Fastest Broadcast Trees in Periodically-Varying Graphs. CoRR abs/1204.3058 (2012) - [i9]Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks. CoRR abs/1205.1975 (2012) - [i8]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
A Strict Hierarchy of Dynamic Graphs for Shortest, Fastest, and Foremost Broadcast. CoRR abs/1210.3277 (2012) - 2011
- [j1]Arnaud Casteigts, Amiya Nayak, Ivan Stojmenovic:
Communication protocols for vehicular ad hoc networks. Wirel. Commun. Mob. Comput. 11(5): 567-582 (2011) - [c12]Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
Time-Varying Graphs and Dynamic Networks. ADHOC-NOW 2011: 346-359 - [c11]Frédéric Amblard, Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
On the temporal analysis of scientific network evolution. CASoN 2011: 169-174 - [c10]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Measuring Temporal Lags in Delay-Tolerant Networks. IPDPS 2011: 209-218 - [c9]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: 228 - [i7]Nicola Santoro, Walter Quattrociocchi, Paola Flocchini, Arnaud Casteigts, Frédéric Amblard:
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics. CoRR abs/1102.0629 (2011) - [i6]Arnaud Casteigts, Serge Chaumette, Afonso Ferreira:
On the Assumptions about Network Dynamics in Distributed Computing. CoRR abs/1102.5529 (2011) - [i5]Arnaud Casteigts, Bernard Mans, Luke Mathieson:
On the Feasibility of Maintenance Algorithms in Dynamic Graphs. CoRR abs/1107.2722 (2011) - 2010
- [c8]Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. IFIP TCS 2010: 111-124 - [c7]Arnaud Casteigts, Jeremie Albert, Serge Chaumette, Amiya Nayak, Ivan Stojmenovic:
Biconnecting a Network of Mobile Robots Using Virtual Angular Forces. VTC Fall 2010: 1-5 - [i4]Arnaud Casteigts:
The JBotSim Library. CoRR abs/1001.1435 (2010) - [i3]Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, Serge Chaumette:
Construction et maintien d'une forêt couvrante dans un réseau dynamique. CoRR abs/1005.5614 (2010) - [i2]Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro:
Time-Varying Graphs and Dynamic Networks. CoRR abs/1012.0009 (2010)
2000 – 2009
- 2009
- [c6]Xuehong Liu, Arnaud Casteigts, Nishith Goel, Amiya Nayak, Ivan Stojmenovic:
Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks. CSA 2009: 1-6 - [c5]Arnaud Casteigts, Serge Chaumette, Afonso Ferreira:
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. SIROCCO 2009: 126-140 - [i1]Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné:
Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks. CoRR abs/0904.3087 (2009) - 2007
- [b1]Arnaud Casteigts:
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). University of Bordeaux, France, 2007 - 2006
- [c4]Arnaud Casteigts:
Model Driven capabilities of the DA-GRS model. ICAS 2006: 24 - [c3]Lionel Barrère, Arnaud Casteigts, Serge Chaumette:
A totally decentralized document sharing system for mobile ad hoc networks. MOBIWAC 2006: 116-120 - [c2]Arnaud Casteigts, Serge Chaumette:
Dynamicity Aware Graph Relabeling Systems and the Constraint Based Synchronization: A Unifying Approach to Deal with Dynamic Networks. WASA 2006: 688-697 - 2005
- [c1]Arnaud Casteigts, Serge Chaumette:
Dynamicity Aware Graph Relabeling Systems (DA-GRS), A Local Computation based Model to Describe Manet Algorithms. IASTED PDCS 2005: 231-236
Coauthor Index
John Michael Robson
aka: J. M. Robson
aka: J. M. Robson
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
