| 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 |
| 2024 | PODC | Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. | Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 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 | SOFSEM | The Multiple Traveling Salesman Problem on Spiders. | Pedro Prez-Escalona, Ivan Rapaport, Jos A. Soto, Ian Vidal |
| 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 | COCOON | The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. | Florent Becker, Antonio Fernndez Anta, Ivan Rapaport, Eric Rmila |
| 2015 | PODC | Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. | Florent Becker, Antonio Fernndez Anta, Ivan Rapaport, Eric Rmila |
| 2015 | SIROCCO | Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. | Jarkko Kari, Martn Matamala, Ivan Rapaport, Ville Salo |
| 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 |
| 2012 | SPAA | Allowing each node to communicate only once in a distributed system: shared whiteboard models. | Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan |
| 2010 | SIROCCO | Average Long-Lived Memoryless Consensus: The Three-Value Case. | Ivan Rapaport, Eric Rmila |
| 2009 | SIROCCO | Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. | Nicolas Nisse, Ivan Rapaport, Karol Suchan |
| 2008 | ISAAC | Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol. | Eric Goles Ch., Cedric Little, Ivan Rapaport |
| 2008 | LATIN | On Dissemination Thresholds in Regular and Irregular Graph Classes. | Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstrate |
| 2008 | SIROCCO | Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. | Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rmila |
| 2007 | MFCS | Small Alliances in Graphs. | Rodolfo Carvajal, Martn Matamala, Ivan Rapaport, Nicolas Schabanel |
| 2006 | WG | Minimal Proper Interval Completions. | Ivan Rapaport, Karol Suchan, Ioan Todinca |
| 2002 | LATIN | k-pseudosnakes in Large Grids. | Martn Matamala, Erich Prisner, Ivan Rapaport |
| 2002 | SODA | Tiling groups for Wang tiles. | Cristopher Moore, Ivan Rapaport, Eric Rmila |
| 2002 | WG | The Complexity of Approximating the Oriented Diameter of Chordal Graphs. | Fedor V. Fomin, Martn Matamala, Ivan Rapaport |
| 1998 | MFCS | Additive Cellular Automata over Z | Jacques Mazoyer, Ivan Rapaport |
| 1998 | STACS | Inducing an Order on Cellular Automata by a Grouping Operation. | Jacques Mazoyer, Ivan Rapaport |