Skip to Main content
Number of documents

54

Liste de publications d'Arnaud Casteigts


Journal articles14 documents

  • Arnaud Casteigts, Swan Dubois, Franck Petit, John Robson. Robustness: A new form of heredity motivated by dynamic networks. Theoretical Computer Science, Elsevier, 2020, 806, pp.429-445. ⟨10.1016/j.tcs.2019.08.008⟩. ⟨hal-02491886⟩
  • Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari. Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis. Information and Computation, Elsevier, 2019, pp.32-51. ⟨10.1016/j.ic.2018.10.001⟩. ⟨hal-01883360⟩
  • Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari. Counting in one-hop beeping networks. Theoretical Computer Science, Elsevier, 2019, 780, pp.20-28. ⟨10.1016/j.tcs.2019.02.009⟩. ⟨hal-02388912⟩
  • Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari. Deterministic Leader Election Takes Θ(D + log n) Bit Rounds. Algorithmica, Springer Verlag, 2019, 81 (5), pp.1901-1920. ⟨10.1007/s00453-018-0517-3⟩. ⟨hal-01883355⟩
  • Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, Joseph Peters. Computing Parameters of Sequence-Based Dynamic Graphs. Theory of Computing Systems, Springer Verlag, 2019, 63 (3), pp.394-417. ⟨10.1007/s00224-018-9876-z⟩. ⟨hal-01872351⟩
  • Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin Neggaz. Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. The Computer Journal, Oxford University Press (UK), 2019, 62 (2), pp.231-246. ⟨hal-01883369⟩
  • Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro. Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. International Journal of Foundations of Computer Science, World Scientific Publishing, 2015, 26 (04), pp.499-522. ⟨10.1142/S0129054115500288⟩. ⟨hal-02491961⟩
  • Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita. On the expressivity of time-varying graphs. Theoretical Computer Science, Elsevier, 2015, 590, pp.27--37. ⟨10.1016/j.tcs.2015.04.004⟩. ⟨hal-01198793⟩
  • Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein Mouftah. Bluetooth Scatternet Formation from a Time-Efficiency Perspective. Wireless Networks, Springer Verlag, 2014, 20 (5), pp.1133-1156. ⟨hal-01020048⟩
  • Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro. Measuring Temporal Lags in Delay-Tolerant Networks. IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (2), pp.397-410. ⟨hal-00846992⟩
  • Louise Bouchard, Jean-Marie Berthelot, Arnaud Casteigts, Mariette Chartier, Alain Trugeon, et al.. Les systèmes d'information sociosanitaire à l'appui de la planification locale de la santé: défis et enjeux. Global Health Promotion, 2014, 21 (1), pp.15-22. ⟨10.1177/1757975913512162⟩. ⟨hal-01020069⟩
  • Arnaud Casteigts, Jérémie Albert, Serge Chaumette, Amiya Nayak, Ivan Stojmenovic. Biconnecting a Network of Mobile Robots using Virtual Angular Forces. Computer Communications, Elsevier, 2012, 35 (9), pp.1038-1046. ⟨10.1016/j.comcom.2011.09.008⟩. ⟨hal-00854275⟩
  • Arnaud Casteigts, Paola Flocchini, Nicola Santoro, Walter Quattrociocchi. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems, Taylor & Francis, 2012, 27 (5), pp.387-408. ⟨10.1080/17445760.2012.668546⟩. ⟨hal-00847001⟩
  • Arnaud Casteigts, Amiya Nayak, Ivan Stojmenovic. Communication Protocols for Vehicular Ad hoc Networks. Wireless Communications and Mobile Computing, Hindawi Publishing Corporation, 2011, 11 (5), pp.567-582. ⟨hal-00854393⟩

Conference papers33 documents

  • Arnaud Casteigts, Joseph G. Peters, Jason Schoeters. Temporal Cliques Admit Sparse Spanners. 46th International Colloquium on Automata, Languages and Programming (ICALP), Jul 2019, Patras, Greece. pp.134:1--134:14, ⟨10.4230/LIPIcs.ICALP.2019.134⟩. ⟨hal-02380356⟩
  • Arnaud Casteigts, Joseph Peters, Jason Schoeters. Trouver des spanners peu denses dans les cliques temporelles. ALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France. ⟨hal-02117940⟩
  • Arnaud Casteigts. Exploiting temporal properties in dynamic networks : An overview (invited talk). First workshop on Distributed Algorithms for Dynamic Networks (DiADN), co-located with DISC, Oct 2019, Budapest, Hungary. ⟨hal-02514833⟩
  • Arnaud Casteigts. Sparsification techniques that preserve temporal connectivity (invited talk). Second workshop on Algorithmic Aspects of Temporal Graphs (AATG), co-located with ICALP, Jul 2019, Patras, Greece. ⟨hal-02514830⟩
  • Arnaud Casteigts. On robust temporal structures in highly dynamic networks (invited talk). First workshop on Algorithmic Aspects of Temporal Graphs (AATG), co-located with ICALP, Jul 2018, Prague, Czech Republic. ⟨hal-02514836⟩
  • Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph Peters. Calcul de paramètres minimaux dans les graphes dynamiques.. ALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France. ⟨hal-01517872⟩
  • Arnaud Casteigts, Ralf Klasing, Mohammed Yessin Neggaz, Joseph G. Peters. A Generic Framework for Computing Parameters of Sequence-Based Dynamic Graphs. Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017), Jun 2017, Porquerolles, France. pp.321-338, ⟨10.1007/978-3-319-72050-0_19⟩. ⟨hal-01871305⟩
  • Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari. Design Patterns in Beeping Algorithms (extended abstract). 20th International Conference on Principles of Distributed Systems (OPODIS), Dec 2016, Madrid, Spain. ⟨hal-01472903⟩
  • 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)$. 30th International Symposium on Distributed Computing (DISC), Sep 2016, Paris, France. pp.16-28, ⟨10.1007/978-3-662-53426-7_2⟩. ⟨hal-01472671⟩
  • Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters. Efficiently Testing T-Interval Connectivity in Dynamic Graphs. 9th International Conference on Algorithms and Complexity (CIAC 2015), May 2015, Paris, France. pp.89-100, ⟨10.1007/978-3-319-18173-8_6⟩. ⟨hal-01428847⟩
  • Arnaud Casteigts. JBotSim: a Tool for Fast Prototyping of Distributed Algorithms in Dynamic Networks. Eighth EAI International Conference on Simulation Tools and Techniques (SIMUTOOLS), Aug 2015, Athènes, Greece. ⟨hal-01472926⟩
  • Carlos Gómez-Calzado, Arnaud Casteigts, Alberto Lafuente, Mikel Larrea. A Connectivity Model for Agreement in Dynamic Systems. 21st International Conference on Parallel Processing (EURO-PAR 2015), Aug 2015, Vienne, Austria. pp.333 - 345, ⟨10.1007/978-3-662-48096-0_26⟩. ⟨hal-01472943⟩
  • Arnaud Casteigts, Ralf Klasing, Yessin M. Neggaz, Joseph G. Peters. Tester efficacement la T-intervalle connexité dans les graphes dynamiques. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. ⟨hal-01147110⟩
  • Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz. Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. 18th International Conference on Principles of Distributed Systems - OPODIS 2014, Dec 2014, Cortina d'Ampezzo, Italy. pp.277-292. ⟨hal-01410314⟩
  • 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é. ALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4. ⟨hal-00986117⟩
  • Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, Yoann Pigné. Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks. Distributed Maintenance of Anytime Available Spanning Trees in Dynamic Networks, Jul 2013, Poland. pp.99-110. ⟨hal-00376701v2⟩
  • Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita. Brief Announcement: Waiting in Dynamic Networks. 31st ACM Symposium on Principles of Distributed Computing (PODC), Jul 2013, Portugal. pp.99-100. ⟨hal-00854266⟩
  • Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita. Expressivity of Time-Varying Graphs. Expressivity of Time-Varying Graphs, Aug 2013, United Kingdom. pp.95-106. ⟨hal-00846875⟩
  • Arnaud Casteigts. Impact of network dynamics on the feasibility of distributed problems : Early results (keynote talk). 21st Jornadas de Concurrencia y Sistemas Distribuidos (JCSD), Jun 2013, San Sebastian, Spain. ⟨hal-02514841⟩
  • Arnaud Casteigts. Impact of network dynamics on the feasibility of distributed problems: an overview of early results. XXI Jornadas de Concurrencia y Sistemas Distribuidos (JCSD), Jun 2013, Spain. ⟨hal-00854298⟩
  • Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, Hussein Mouftah. BSF-UED: A Novel Time-Efficient Bluetooth Scatternet Formation algorithm based on Unnecessary Edges Deletion. 18th IEEE Symposium on Computers and Communications (ISCC), Jul 2013, Croatia. pp.886-891. ⟨hal-00854249⟩
  • 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. 7th International Workshop on Data Privacy Management (DPM), Sep 2012, Italy. pp.75-88. ⟨hal-00854281⟩
  • Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro. Measuring Temporal Lags in Delay-Tolerant Networks. 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2011, United States. pp.209-218. ⟨hal-00854285⟩
  • Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, Nicola Santoro. Time-Varying Graphs and Dynamic Networks. 10th International Conference on Adhoc, Mobile, and Wireless Networks (ADHOC-NOW),, Jul 2011, Germany. pp.346-359. ⟨hal-00854287⟩
  • Nicola Santoro, Walter Quattrociocchi, Paola Flocchini, Arnaud Casteigts, Frédéric Amblard. Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics. Workshop on Social Networks And MultiAgent Systems (SNAMAS), Apr 2011, Leicester, United Kingdom. pp.32-38. ⟨hal-00854313⟩
  • Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro. Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.111-124, ⟨10.1007/978-3-642-15240-5_9⟩. ⟨hal-01054440⟩
  • Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, Serge Chaumette. Construction et maintien d'une forêt couvrante dans un réseau dynamique. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. 4 p. ⟨inria-00477755v2⟩
  • Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro. Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility. 6th IFIP International Conference on Theoretical Computer Science (IFIP TCS), Sep 2010, Australia. pp.111-124. ⟨hal-00854318⟩
  • Arnaud Casteigts, Serge Chaumette, Afonso Ferreira. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), May 2009, Piran, Slovenia. pp.129--144. ⟨hal-00408054⟩
  • Lionel Barrère, Arnaud Casteigts, Serge Chaumette. A Totally Decentralized Document Sharing System for Mobile Ad Hoc Networks. 4th ACM International Workshop on Mobility Management and Wireless Access (MobiWac 2006), Oct 2006, Torremolinos, Spain. pp.116-120. ⟨hal-00305905⟩
  • Arnaud Casteigts. Model Driven Capabilities of the DA-GRS Model. Intl. Conf. on Autonomic and Autonomous Systems (ICAS), 2006, United States. pp.24 - 24. ⟨hal-00305752⟩
  • Arnaud Casteigts, Serge Chaumette. DAGRS and the Constraint Based Synchronization: a Unifying Approach to Deal With Dynamic Networks. International Conference on Wireless Algorithms, Systems and Applications (WASA'06), Aug 2006, Xi'an, China. pp.688--697. ⟨hal-00305751⟩
  • Arnaud Casteigts, Serge Chaumette. Dynamicity Aware Graph Relabeling Systems - A local computation-based model to describe MANet algorithms. 17th IASTED International Conference on Parallel and Distributed Computing Systems (PDCS'05), Nov 2005, Phoenix, United States. pp.231--236. ⟨hal-00305750⟩

Other publications2 documents

  • Lionel Barrère, Arnaud Casteigts, Serge Chaumette. A fully distributed document sharing system for mobile ad hoc networks. 2006. ⟨hal-00406459⟩
  • Arnaud Casteigts, Serge Chaumette. Exemple d'exploitation d'un modèle en couches pour la prise en compte transparente des caractéristiques de dynamicité d'un MANet. 2005. ⟨hal-00406453⟩

Reports3 documents

  • Arnaud Casteigts, Paola Flocchini. Deterministic Algorithms in Dynamic Networks: Problems, Analysis, and Algorithmic Tools. 2013. ⟨hal-00865764⟩
  • Arnaud Casteigts. The JBotSim Library. 2013. ⟨hal-00854260⟩
  • Arnaud Casteigts, Paola Flocchini. Deterministic Algorithms in Dynamic Networks: Formal Models and Metrics. 2013. ⟨hal-00865762⟩

Theses1 document

  • Arnaud Casteigts. Contribution à l'algorithmique distribuée dans les réseaux mobiles ad hoc - Calculs locaux et réétiquetages de graphes dynamiques. Réseaux et télécommunications [cs.NI]. Université Sciences et Technologies - Bordeaux I, 2007. Français. ⟨tel-00193181⟩

Habilitation à diriger des recherches1 document

  • Arnaud Casteigts. A Journey through Dynamic Networks (with Excursions). Distributed, Parallel, and Cluster Computing [cs.DC]. Université de Bordeaux, 2018. ⟨tel-01883384⟩