WiSeBat: accurate energy benchmarking of wireless sensor networks. - Quentin Bramas; Wilfried Dron; Mariem Ben Fadhl; Khalil Hachicha; Patrick Garda; Sébastien Tixeuil (FDL, 2015)

Wait-Free Gathering Without Chirality. - Quentin Bramas; Sébastien Tixeuil (SIROCCO, 2015)

Asynchronous Pattern Formation without Chirality. - Quentin Bramas; Sébastien Tixeuil (CoRR, 2015)

Distributed Online Data Aggregation in Dynamic Graphs. - Quentin Bramas; Toshimitsu Masuzawa; Sébastien Tixeuil (ICDCS, 2016)

Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks. - Quentin Bramas; Sébastien Tixeuil (NETYS, 2016)

Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation. - Quentin Bramas; Sébastien Tixeuil (PODC, 2016)

Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper). - Quentin Bramas; Sébastien Tixeuil (SSS, 2016)

Energy-Centric Wireless Sensor Networks. (Réseaux de capteurs sans fil efficaces en énergie). - Quentin Bramas (2016)

Killing Nodes as a Countermeasure to Virus Expansion. - François Bonnet 001; Quentin Bramas; Xavier Défago; Thanh Dang Nguyen (SIROCCO, 2017)

The complexity of data aggregation in static and dynamic wireless sensor networks. - Quentin Bramas; Sébastien Tixeuil (Inf. Comput., 2017)

The Random Bit Complexity of Mobile Robots Scattering. - Quentin Bramas; Sébastien Tixeuil (Int. J. Found. Comput. Sci., 2017)

Arbitrary Pattern Formation with Four Robots. - Quentin Bramas; Sébastien Tixeuil (SSS, 2018)

Analysis of the Network Attachment Delay of Mobile Devices in the Industrial Internet of Things. - Rodrigo Teles Hermeto; Quentin Bramas; Antoine Gallais; Fabrice Théoleyre (ADHOC-NOW, 2019)

How to Choose Its Parents in the Tangle. - Vidal Attias; Quentin Bramas (NETYS, 2019)

Infinite Grid Exploration by Disoriented Robots. - Quentin Bramas; Stéphane Devismes; Pascal Lafourcade 001 (SIROCCO, 2019)

The Stability and the Security of the Tangle. - Quentin Bramas (Tokenomics, 2019)

Packet Efficient Implementation of the Omega Failure Detector. - Quentin Bramas; Dianne Foreback; Mikhail Nesterenko; Sébastien Tixeuil (Theory Comput. Syst., 2019)

Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think. - Jean-Romain Luttringer; Thomas Alfroy; Pascal Mérindol; Quentin Bramas; François Clad; Cristel Pelsser (NCA, 2020)

Stateless Distributed Ledgers. - François Bonnet 001; Quentin Bramas; Xavier Défago (NETYS, 2020)

Stand Up Indulgent Rendezvous. - Quentin Bramas; Anissa Lamani; Sébastien Tixeuil (SSS, 2020)

On the improvement of the in-place merge algorithm parallelization. - Bérenger Bramas; Quentin Bramas (CoRR, 2020)

SUPRA, a distributed publish/subscribe protocol with blockchain as a conflict resolver. - Jean-Philippe Abegg; Quentin Bramas; Timothée Goubault de Brugière; Thomas Noël (BRAINS, 2021)

Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. - Quentin Bramas; Pascal Lafourcade 001; Stéphane Devismes (FUN, 2021)

A Fast-Convergence Routing of the Hot-Potato. - Jean-Romain Luttringer; Quentin Bramas; Cristel Pelsser; Pascal Mérindol (INFOCOM, 2021)

Blockchain Using Proof-of-Interaction. - Jean-Philippe Abegg; Quentin Bramas; Thomas Noël (NETYS, 2021)

Efficient and Secure TSA for the Tangle. - Quentin Bramas (NETYS, 2021)

Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality. - Arthur Rauch; Quentin Bramas; Stéphane Devismes; Pascal Lafourcade 001; Anissa Lamani (NETYS, 2021)

The agreement power of disagreement: graph generation. - Quentin Bramas; Anissa Lamani; Sébastien Tixeuil (Zenodo, 2021)

Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? - Quentin Bramas; Stéphane Devismes; Anaïs Durand; Pascal Lafourcade 001; Anissa Lamani (FUN, 2022)

Distributed Publish/Subscribe Protocol with Minimum Number of Encryption. - Jean-Philippe Abegg; Quentin Bramas; Timothée Goubault de Brugière; Thomas Noël (ICDCN, 2022)

Secret-less secured payment system for inter-broker communications. - Jean-Philippe Abegg; Quentin Bramas; Thomas Noël (WiOpt, 2022)

Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks. - Jean-Romain Luttringer; Thomas Alfroy; Pascal Mérindol; Quentin Bramas; François Clad; Cristel Pelsser (Comput. Networks, 2022)

Constrained Backward Time Travel Planning is in P. - Quentin Bramas; Jean-Romain Luttringer; Sébastien Tixeuil (CoRR, 2022)

Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. - Omar Darwich; Ahmet-Sefa Ulucan; Quentin Bramas; Anissa Lamani; Anaïs Durand; Pascal Lafourcade 001 (Zenodo, 2022)

Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. - Omar Darwich; Ahmet-Sefa Ulucan; Quentin Bramas; Anissa Lamani; Anaïs Durand; Pascal Lafourcade 001 (Zenodo, 2022)

Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. - Omar Darwich; Ahmet-Sefa Ulucan; Quentin Bramas; Anissa Lamani; Anaïs Durand; Pascal Lafourcade 001 (Zenodo, 2022)

Fault-adaptive Scheduling for Data Acquisition Networks. - Eloise Stein; Quentin Bramas; Tommaso Colombo 002; Cristel Pelsser (LCN, 2023)

Offline Constrained Backward Time Travel Planning. - Quentin Bramas; Jean-Romain Luttringer; Sébastien Tixeuil (SSS, 2023)

Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. - Quentin Bramas; Toshimitsu Masuzawa; Sébastien Tixeuil (SSS, 2023)

A Simple and General Operational Framework to Deploy Optimal Routes with Source Routing. - Quentin Bramas; Jean-Romain Luttringer; Pascal Mérindol (CoRR, 2023)

Stand up indulgent gathering. - Quentin Bramas; Anissa Lamani; Sébastien Tixeuil (Theor. Comput. Sci., 2023)

The agreement power of disagreement. - Quentin Bramas; Anissa Lamani; Sébastien Tixeuil (Theor. Comput. Sci., 2023)

Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. - Quentin Bramas; Pascal Lafourcade 001; Stéphane Devismes (Theor. Comput. Sci., 2023)

Perpetual torus exploration by myopic luminous robots. - Omar Darwich; Ahmet-Sefa Ulucan; Quentin Bramas; Anissa Lamani; Anaïs Durand; Pascal Lafourcade 001 (Theor. Comput. Sci., 2023)

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. - Quentin Bramas; Hirotsugu Kakugawa; Sayaka Kamei; Anissa Lamani; Fukuhito Ooshita; Masahiro Shibata; Sébastien Tixeuil (AINA (2), 2024)

The impact of block mining time distribution on the probability of forks. - Thomas Lelièvre; Quentin Bramas (BRAINS, 2024)

Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents. - Quentin Bramas; Toshimitsu Masuzawa; Sébastien Tixeuil (OPODIS, 2024)

Online Space-Time Travel Planning in Dynamic Graphs. - Quentin Bramas; Jean-Romain Luttringer; Sébastien Tixeuil (SAND, 2024)

Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents. - Quentin Bramas; Toshimitsu Masuzawa; Sébastien Tixeuil (SAND, 2024)

Stand-Up Indulgent Gathering on Rings. - Quentin Bramas; Sayaka Kamei; Anissa Lamani; Sébastien Tixeuil (SIROCCO, 2024)

Optimal Asynchronous Perpetual Grid Exploration. - Quentin Bramas; Stéphane Devismes; Anaïs Durand; Pascal Lafourcade 001; Anissa Lamani (SSS, 2024)

La ROUTOURNE va tourner. - Quentin Bramas; Jean-Romain Luttringer; Pascal Mérindol (CoRR, 2024)

Stand-up indulgent gathering on lines. - Quentin Bramas; Sayaka Kamei; Anissa Lamani; Sébastien Tixeuil (Theor. Comput. Sci., 2024)

Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm. - François Bonnet 001; Quentin Bramas; Pierre Courtieu; Xavier Défago; Lionel Rieg; Sébastien Tixeuil; Xavier Urbain (SIROCCO, 2025)

A Visibility vs. Memory Trade-Off for Stand-Up Indulgent Gathering on Lines. - Quentin Bramas; Hirotsugu Kakugawa; Sayaka Kamei; Anissa Lamani; Fukuhito Ooshita; Masahiro Shibata; Sébastien Tixeuil (SIROCCO, 2025)

Infinite grid exploration with synchronous myopic robots without chirality. - Quentin Bramas; Pascal Lafourcade 001; Stéphane Devismes (Discret. Appl. Math., 2025)

Computing the Heaviest Conflict-free Sub-DAG in DAG-based DLTs. - Quentin Bramas (Distributed Ledger Technol. Res. Pract., 2025)

FORS: fault-adaptive optimized routing and scheduling for DAQ networks. - Eloise Stein; Quentin Bramas; Flavio Pisani; Tommaso Colombo 002; Cristel Pelsser (Comput. Softw. Big Sci., 2025)