| 2026 | PODC | Distributed Treewidth Computation and Courcelle's Theorem in the CONGEST Model. | Benjamin Jauregui, Jason Li, Pedro Montealegre, Ioan Todinca |
| 2026 | STOC | What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing. | Llia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | OPODIS | Recognizing Hereditary Properties in the Presence of Byzantine Nodes. | David Cifuentes-Nez, Pedro Montealegre, Ivan Rapaport |
| 2025 | PODC | Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. | Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2025 | PODC | Deterministic Distributed DFS via Cycle Separators in Planar Graphs. | Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport |
| 2025 | PODC | Brief Announcement: Strong and Hiding Distributed Certification of | Augusto Modanese, Pedro Montealegre, Martn Ros-Wilson |
| 2024 | LATIN | The Hardness of Local Certification of Finite-State Dynamics. | Diego Maldonado, Pedro Montealegre, Martn Ros-Wilson |
| 2024 | PODC | Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. | Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2024 | SOFSEM | Local Certification of Majority Dynamics. | Diego Maldonado, Pedro Montealegre, Martn Ros-Wilson, Guillaume Theyssier |
| 2023 | SIROCCO | Energy-Efficient Distributed Algorithms for Synchronous Networks. | Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2022 | OPODIS | Computing Power of Hybrid Models in Synchronous Networks. | Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martn Ros-Wilson, Ioan Todinca |
| 2022 | SIROCCO | A Meta-Theorem for Distributed Certification. | Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2022 | SIROCCO | Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. | Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport |
| 2021 | CiE | On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. | Eric Goles, Pedro Montealegre, Martn Ros-Wilson, Guillaume Theyssier |
| 2021 | SSS | Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. | Pedro Montealegre, Diego Ramrez-Romero, Ivan Rapaport |
| 2020 | ISAAC | Shared vs Private Randomness in Distributed Interactive Proofs. | Pedro Montealegre, Diego Ramrez-Romero, Ivan Rapaport |
| 2020 | PODC | Compact Distributed Certification of Planar Graphs. | Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, ric Rmila, Ioan Todinca |
| 2019 | SIROCCO | On Distributed Merlin-Arthur Decision Protocols. | Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca |
| 2018 | LATIN | The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. | Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2018 | SIROCCO | Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. | Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca |
| 2016 | PODC | Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. | Pedro Montealegre, Ioan Todinca |
| 2016 | WG | On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. | Pedro Montealegre, Ioan Todinca |
| 2015 | WG | Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. | Mathieu Liedloff, Pedro Montealegre, Ioan Todinca |
| 2014 | SIROCCO | The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. | Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |