| 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 | ICALP | Deterministic Even-Cycle Detection in Broadcast CONGEST. | Pierre Fraigniaud, Mal Luce, Frdric Magniez, Ioan Todinca |
| 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 |
| 2024 | PODC | Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. | Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2024 | PODC | Even-Cycle Detection in the Randomized and Quantum CONGEST Model. | Pierre Fraigniaud, Mal Luce, Frdric Magniez, Ioan Todinca |
| 2023 | SIROCCO | On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model. | Pierre Fraigniaud, Mal Luce, Ioan Todinca |
| 2023 | SIROCCO | Energy-Efficient Distributed Algorithms for Synchronous Networks. | Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca |
| 2022 | ISAAC | On Graphs Coverable by k Shortest Paths. | Mal Dumas, Florent Foucaud, Anthony Perez, 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 |
| 2021 | MFCS | A Cubic Vertex-Kernel for Trivially Perfect Editing. | Mal Dumas, Anthony Perez, Ioan Todinca |
| 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 | An | Christophe Crespelle, Anthony Perez, 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 | SODA | Large induced subgraphs via triangulations and CMSO. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 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 |
| 2013 | WADS | Treewidth and Pathwidth Parameterized by the Vertex Cover Number. | Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2011 | ESA | Exact Algorithm for the Maximum Induced Planar Subgraph Problem. | Fedor V. Fomin, Ioan Todinca, Yngve Villanger |
| 2010 | TAMC | An | Christophe Crespelle, Ioan Todinca |
| 2010 | WG | Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2009 | FAW | Pathwidth is NP-Hard for Weighted Trees. | Rodica Mihai, Ioan Todinca |
| 2009 | MFCS | Constructing Brambles. | Mathieu Chapelle, Frdric Mazoit, Ioan Todinca |
| 2008 | LATIN | On Dissemination Thresholds in Regular and Irregular Graph Classes. | Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstrate |
| 2007 | STACS | Characterizing Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2007 | WG | Pathwidth of Circular-Arc Graphs. | Karol Suchan, Ioan Todinca |
| 2006 | ISAAC | Minimal Interval Completion Through Graph Exploration. | Karol Suchan, Ioan Todinca |
| 2006 | WG | Minimal Proper Interval Completions. | Ivan Rapaport, Karol Suchan, Ioan Todinca |
| 2005 | ESA | Minimal Interval Completions. | Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger |
| 2005 | WG | Computing Branchwidth Via Efficient Triangulations and Blocks. | Fedor V. Fomin, Frdric Mazoit, Ioan Todinca |
| 2004 | ICALP | Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. | Fedor V. Fomin, Dieter Kratsch, Ioan Todinca |
| 2003 | WG | Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. | Dieter Kratsch, Haiko Mller, Ioan Todinca |
| 2003 | WG | Coloring Powers of Graphs of Bounded Clique-Width. | Ioan Todinca |
| 2000 | STACS | Listing All Potential Maximal Cliques of a Graph. | Vincent Bouchitt, Ioan Todinca |
| 2000 | WG | Approximating the Treewidth of AT-Free Graphs. | Vincent Bouchitt, Ioan Todinca |
| 1999 | STACS | Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. | Vincent Bouchitt, Ioan Todinca |
| 1998 | ESA | Minimal Triangulations for Graphs with "Few" Minimal Separators. | Vincent Bouchitt, Ioan Todinca |