[1] Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. Algorithmica, pages 1--49, 2021. [ bib | DOI ]
[2] Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Temporal cliques admit sparse spanners. Journal of Computer and System Sciences, 121:1--17, 2021. [ bib | DOI ]
[3] Luiz F. Afra Brito, Marcelo Albertini, Arnaud Casteigts, and Bruno A. N. Travençolo. A dynamic data structure for temporal reachability with unsorted contact insertions, 2021. [ bib | arXiv ]
[4] Arnaud Casteigts, Michael Raskin, Malte Renken, and Viktor Zamaraev. Sharp thresholds in random simple temporal graphs, 2020. (Submitted.). [ bib | arXiv ]
[5] Arnaud Casteigts, Swan Dubois, Franck Petit, and John Michael Robson. Robustness: a new form of heredity motivated by dynamic networks. Theoretical Computer Science, 806:429--445, 2020. [ bib | DOI ]
[6] Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. In 31st Int. Symp. on Algorithms and Computation (ISAAC), 2020. [ bib | http ]
[7] Arnaud Casteigts, Mathieu Raffinot, and Jason Schoeters. Vectortsp: A traveling salesperson problem with racetrack-like acceleration constraints. In 16th Int. Symp. on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), LNCS, pages 45--59, Cham, 2020. Springer International Publishing. [ bib ]
We study a new version of the Euclidean TSP called VectorTSP (VTSP for short) where a mobile entity is allowed to move according to a set of physical constraints inspired from the pen-and-pencil game Racetrack (also known as Vector Racer). In contrast to other versions of TSP accounting for physical constraints, such as Dubins TSP, the spirit of this model is that (1) no speed limitations apply, and (2) inertia depends on the current velocity. As such, this model is closer to typical models considered in path planning problems, although applied here to the visit of n cities in a non-predetermined order.
[8] Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Temporal cliques admit sparse spanners. In 46th International Colloquium on Automata, Languages, and Programming (ICALP), volume 132 of LIPIcs, pages 129:1--129:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [ bib ]
[9] Arnaud Casteigts, Joseph G. Peters, and Jason Schoeters. Trouver des spanners peu denses dans les cliques temporelles. In 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (ALGOTEL), 2019. [ bib ]
[10] Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Deterministic leader election takes Θ(D+log n) bit rounds. Algorithmica, 81:1901--1920, 2019. [ bib ]
[11] Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Counting in one-hop beeping networks. Theoretical Computer Science, 780:20 -- 28, 2019. [ bib ]
[12] Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Design patterns in beeping algorithms: Examples, emulation, and analysis. Information and Computation, 264:32 -- 51, 2019. [ bib | DOI ]
[13] Arnaud Casteigts. A Journey Through Dynamic Networks (with Excursions). Habilitation à diriger des recherches, Université de Bordeaux, June 2018. [ bib ]
[14] Arnaud Casteigts. Finding structure in dynamic networks. CoRR, abs/1807.07801, 75p, 2018. [ bib | http ]
[15] Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. Computing parameters of sequence-based dynamic graphs. Theory of Computing Systems, 63:394--417, 2019. [ bib ]
[16] Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, and Y. Neggaz. Maintaining a distributed spanning forest in highly dynamic networks. The Computer Journal, 62(2):231--246, 2019. [ bib ]
[17] Arnaud Casteigts, Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Mohamed Mosbah, John Michael Robson, and Akka Zemmari. Autour des algorithmes distribués, 209p. https://algodist.labri.fr/pmwiki/uploads/Main/PolyAlgoDistMetivier.pdf. [ bib ]
[18] Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, Joseph Peters, and David Renault. Private communication, 2016. [ bib ]
[19] Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. A generic framework for computing parameters of sequence-based dynamic graphs. In Proc. of 24th Intl. Conference on Structural Information and Communication Complexity (SIROCCO), volume 10641 of LNCS, pages 321--338, 2017. [ bib ]
[20] Arnaud Casteigts, Ralf Klasing, Yessin Neggaz, and Joseph Peters. Calcul de paramètres minimaux dans les graphes dynamiques. In 16e Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 2017. [ bib ]
[21] Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Deterministic leader election in O(D + log n) time with messages of size O(1). In 30th Int. Symposium on Distributed Computing (DISC), volume 9888 of LNCS. Springer, 2016. [ bib ]
[22] Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Design patterns in beeping algorithms (extended abstract). In 20th Int. Conference on Principles of Distributed Systems (OPODIS), volume 70 of LIPIcs, pages 15:1--15:16, 2016. [ bib ]
[23] Carlos Gómez-Calzado, Arnaud Casteigts, Mikel Larrea, and Alberto Lafuente. A connectivity model for agreement in dynamic systems. In 21st Int. Conference on Parallel Processing (EUROPAR), volume 9233 of LNCS, pages 333--345, 2015. [ bib ]
[24] Arnaud Casteigts. JBotSim: a tool for fast prototyping of distributed algorithms in dynamic networks. In Proceedings of the 8th international ICST conference on simulation tools and techniques (SIMUTools), 2015. [ bib ]
[25] Arnaud Casteigts, Paola Flocchini, E. Godard, Nicola Santoro, and Masafumi Yamashita. On the expressivity of time-varying graphs. Theoretical Computer Science, 590:27--37, 2015. [ bib ]
[26] Arnaud Casteigts, Paola Flocchini, Bernard Mans, and Nicola Santoro. Shortest, fastest, and foremost broadcast in dynamic networks. Int. Journal of Foundations of Computer Science, 26(4):499--522, 2015. [ bib ]
[27] Arnaud Casteigts, R. Klasing, Yessin Neggaz, and J. Peters. Efficiently testing T-Interval connectivity in dynamic graphs. In 9th Int. Conference on Algorithms and Complexity (CIAC), volume 9079 of LNCS, pages 89--100, 2015. [ bib ]
[28] Arnaud Casteigts, R. Klasing, Yessin Neggaz, and J. Peters. Tester efficacement la t-intervalle connexité dans les graphes dynamiques. In 17e Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 2015. [ bib ]
[29] Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, and Y. Neggaz. Maintaining a spanning forest in highly dynamic networks: The synchronous case. In 18th Int. Conference on Principles of Distributed Systems (OPODIS), volume 8878 of LNCS, pages 277--292, 2014. [ bib ]
[30] Arnaud Casteigts, Paola Flocchini, Bernard Mans, and Nicola Santoro. Measuring temporal lags in delay-tolerant networks. IEEE Transactions on Computers, 63(2), 2014. [ bib ]
[31] M. Barjon, A. Casteigts, S. Chaumette, C. Johnen, and Y.M. Neggaz. Testing temporal connectivity in sparse dynamic graphs. In 2nd AETOS Int. conference on Research challenges for future RPAS/UAV systems, 2014. [ bib ]
[32] Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, and Yessin M. Neggaz. Un algorithme de test pour la connexité temporelle dans les graphes dynamiques de faible densité. In 16e Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 2014. [ bib ]
[33] Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, and Hussein Mouftah. Bluetooth scatternet formation from a time-efficiency perspective. Wireless Networks, 20(5):1133--1156, 2014. [ bib ]
[34] Jean-Marie Berthelot, Louise Bouchard, Arnaud Casteigts, Mariette Chartier, Alain Trugeon, and Jan Warnke. Les systèmes d'information sociosanitaire à l'appui de la planification locale de la santé: défis et enjeux. Global Health Promotion, 21(1):15,22, 2014. [ bib ]
[35] Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, and Masafumi Yamashita. Expressivity of time-varying graphs. In 19th International Symposium on Fundamentals of Computation Theory (FCT), 2013. [ bib ]
[36] Arnaud Casteigts, Serge Chaumette, Frédéric Guinand, and Yoann Pigné. Distributed maintenance of anytime available spanning trees in dynamic networks. In Proc. of 12th conf. on Adhoc, Mobile, and Wireless Networks (ADHOC-NOW), LNCS, pages 99--110, 2013. [ bib ]
[37] Ahmed Jedda, Arnaud Casteigts, Guy-Vincent Jourdan, and Hussein Mouftah. Bsf-ued: A novel time-efficient bluetooth scatternet formation algorithm based on unnecessary edges deletion. In 18th IEEE Symp. on Computers and Communications (ISCC), 2013. [ bib ]
[38] Arnaud Casteigts and Paola Flocchini. Deterministic algorithms in dynamic networks: Problems, analysis, and algorithmic tools. Technical report, Commissioned by Defense Research and Development Canada (DRDC), 2013. [ bib ]
[39] Arnaud Casteigts and Paola Flocchini. Deterministic algorithms in dynamic networks: Formal models and metrics. Technical report, Commissioned by Defense Research and Development Canada (DRDC), 2013. [ bib ]
[40] Arnaud Casteigts, Paola Flocchini, E. Godard, Nicola Santoro, and Masafumi Yamashita. Brief announcement: Waiting in dynamic networks. In Proceedings of the 31th ACM Symposium on Principles of Distributed Computing (PODC), 2012. [ bib ]
[41] Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems, 27(5):387--408, 2012. [ bib | DOI ]
[42] Arnaud Casteigts, Marie-Hélène Chomienne, Louise Bouchard, and Guy-Vincent Jourdan. Differential privacy in tripartite interaction: A case study with linguistic minorities in canada. In Proc. of 7th International Workshop on Data Privacy Management (DPM), volume 7731 of LNCS, pages 75--88. Springer, 2012. [ bib ]
[43] Arnaud Casteigts, Jérémie Albert, Serge Chaumette, Amiya Nayak, and Ivan Stojmenovic. Biconnecting a network of mobile robots using virtual angular forces. Computer Communications, 35(9):1038--1046, 2012. [ bib ]
[44] Arnaud Casteigts, Paola Flocchini, Bernard Mans, and Nicola Santoro. Building fastest broadcast trees in periodically-varying graphs. CoRR, abs/1204.3058, 2012. [ bib ]
[45] A. Casteigts, S. Chaumette, and A. Ferreira. Characterizing topological assumption of distributed algorithms in dynamic networks. CoRR, abs/1102.5529, 2012. [ bib ]
[46] Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. In 10th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW), pages 346--359, 2011. [ bib ]
[47] Arnaud Casteigts, Paola Flocchini, Bernard Mans, and Nicola Santoro. Measuring temporal lags in delay-tolerant networks. In 25th IEEE Intl. Parallel & Distributed Processing Symposium (IPDPS), pages 209--218, 2011. [ bib ]
[48] Arnaud Casteigts, Amiya Nayak, and Ivan Stojmenovic. Communication protocols for vehicular ad hoc networks. Wireless Communication and Mobile Computing, 11(5):567--582, 2011. [ bib ]
[49] Frédéric Amblard, Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. On the Temporal Analysis of Scientific Network Evolution. In International Conference on Computational Aspects of Social Networks (CASoN), pages 169--174, 2011. [ bib ]
[50] Nicola Santoro, Walter Quattrociocchi, Paola Flocchini, Arnaud Casteigts, and Frédéric Amblard. Time-varying graphs and social network analysis: Temporal indicators and metrics. In 3rd AISB Social Networks and Multiagent Systems Symp. (SNAMAS), 2011. [ bib ]
[51] Arnaud Casteigts. White-box elliptic curve diffie-hellman. Technical report, Irdeto Canada, 2011. [ bib ]
[52] Arnaud Casteigts, Marie-Hélène Chomienne, Louise Bouchard, and Guy-Vincent Jourdan. Enabling dynamic linkage of linguistic census data at statistics canada. Technical report, Research Institute of Montfort Hospital, 2011. [ bib ]
[53] Arnaud Casteigts, Bernard Mans, and Luke Mathieson. On the feasibility of maintenance algorithms in dynamic graphs. CoRR, abs/1107.2722, 2011. [ bib ]
[54] Arnaud Casteigts, Paola Flocchini, Bernard Mans, and Nicola Santoro. Deterministic computations in time-varying graphs: Broadcasting under unstructured mobility. In 6th IFIP Int. Conference on Theoretical Computer Science (IFIP-TCS), pages 111--124, 2010. [ bib ]
[55] Arnaud Casteigts, Jérémie Albert, Serge Chaumette, Amiya Nayak, and Ivan Stojmenovic. Biconnecting a network of mobile robots using virtual angular forces. In Proc. 72nd IEEE Vehicular Technology Conference (VTC'Fall), 2010. [ bib ]
[56] Yoann Pigné, Arnaud Casteigts, Frédéric Guinand, and Serge Chaumette. Construction et maintien d'une forêt couvrante dans un réseau dynamique. In 12e Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (ALGOTEL), 2010. [ bib ]
[57] Arnaud Casteigts and Louise Bouchard. Intégration de la dimension temporelle dans l'analyse des réseaux de santé en français. Technical report, Institute of Population Health of Ottawa, 2010. [ bib ]
[58] Arnaud Casteigts, Amiya Nayak, and Ivan Stojmenovic. Topology Control in Sensor, Actuator and Mobile Robot Networks, chapter 7 of Wireless Sensor and Actuator Networks - Algorithms and Protocols for Scalable Coordination and Data Communication, Nayak, A. and Stojmenovic, I. (Eds.). Wiley, 2010. [ bib ]
[59] Arnaud Casteigts, Amiya Nayak, and Ivan Stojmenovic. Multicasting, Geocasting and Anycasting in Sensor and Actuator Networks, chapter 5 of Wireless Sensor and Actuator Networks - Algorithms and Protocols for Scalable Coordination and Data Communication, Nayak, A. and Stojmenovic, I. (Eds.). Wiley, 2010. [ bib ]
[60] X. Liu, Arnaud Casteigts, Nishith Goel, Amiya Nayak, and Ivan Stojmenovic. Multiratecast in wireless fault-tolerant sensor and actuator networks. In Proc. of 2nd IEEE Intl. Conference on Computer Systems and Applications (CSA), 2009. [ bib ]
[61] Arnaud Casteigts, Serge Chaumette, and Afonso Ferreira. Characterizing topological assumptions of distributed algorithms in dynamic networks. In 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO), 2009. [ bib ]
[62] Arnaud Casteigts. Contribution à l'Algorithmique Distribuée dans les Réseaux Mobiles Ad Hoc - Calculs Locaux et Réétiquetages de Graphes Dynamiques. PhD thesis, Université de Bordeaux, September 2007. [ bib ]
[63] Arnaud Casteigts. Model driven capabilities of the DA-GRS model. In Proc. of 1st Intl. Conference on Autonomic and Autonomous Systems (ICAS), pages 24--32. IEEE, 2006. [ bib ]
[64] Arnaud Casteigts and Serge Chaumette. Dynamicity aware graph relabeling systems and the constraint based synchronization: a unifying approach to deal with dynamic networks. In International Conference on Wireless Algorithms, Systems, and Applications (WASA), pages 688--697. Springer, 2006. [ bib ]
[65] Lionel Barrère, Arnaud Casteigts, and Serge Chaumette. A totally decentralized document sharing system for mobile ad hoc networks. In Proc. 4th ACM international workshop on Mobility management and wireless access (MOBIWAC), pages 116--120. ACM, 2006. [ bib ]
[66] Arnaud Casteigts and Serge Chaumette. Dynamicity aware graph relabeling systems (DA-GRS), a local computation based model to describe manet algorithms. In 19th IASTED Int. Conf. on Parallel and Distributed Computing and Systems (PDCS), 2005. [ bib ]
[67] Arnaud Casteigts and 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. Technical Report RR-1349-05, LaBRI, Université de Bordeaux, 2005. [ bib ]
[68] Arnaud Casteigts. Communication asynchrone entre composants logiciels basés sur des statecharts. Master's thesis, Université de Pau et des Pays de l'Adour, June 2004. [ bib ]

This file was generated by bibtex2html 1.99.