Minimal Triangulations for Graphs with "Few" Minimal Separators. - Vincent Bouchitté; Ioan Todinca (ESA, 1998)

Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. - Vincent Bouchitté; Ioan Todinca (STACS, 1999)

Treewidth of planar graphs: connections with duality. - Vincent Bouchitté; Frédéric Mazoit; Ioan Todinca (Electron. Notes Discret. Math., 2001)

Treewidth and Minimum Fill-in: Grouping the Minimal Separators. - Vincent Bouchitté; Ioan Todinca (SIAM J. Comput., 2001)

Listing all potential maximal cliques of a graph. - Vincent Bouchitté; Ioan Todinca (Theor. Comput. Sci., 2002)

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. - Dieter Kratsch; Haiko Müller; Ioan Todinca (WG, 2003)

Coloring Powers of Graphs of Bounded Clique-Width. - Ioan Todinca (WG, 2003)

Approximating the treewidth of AT-free graphs. - Vincent Bouchitté; Ioan Todinca (Discret. Appl. Math., 2003)

Chordal embeddings of planar graphs. - Vincent Bouchitté; Frédéric Mazoit; Ioan Todinca (Discret. Math., 2003)

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In. - Fedor V. Fomin; Dieter Kratsch; Ioan Todinca (ICALP, 2004)

On treewidth approximations. - Vincent Bouchitté; Dieter Kratsch; Haiko Müller; Ioan Todinca (Discret. Appl. Math., 2004)

Minimal Interval Completions. - Pinar Heggernes; Karol Suchan; Ioan Todinca; Yngve Villanger (ESA, 2005)

Connected Graph Searching in Outerplanar Graphs. - Fedor V. Fomin; Dimitrios M. Thilikos; Ioan Todinca (Electron. Notes Discret. Math., 2005)

Décompositions arborescentes de graphes : calcul, approximations, heuristiques. (Tree decompositions of graphs: computation, approximations, heuristics). - Ioan Todinca (2006)

Characterizing Minimal Interval Completions. - Pinar Heggernes; Karol Suchan; Ioan Todinca; Yngve Villanger (STACS, 2007)

Pathwidth of Circular-Arc Graphs. - Karol Suchan; Ioan Todinca (WG, 2007)

On powers of graphs of bounded NLC-width (clique-width). - Karol Suchan; Ioan Todinca (Discret. Appl. Math., 2007)

Feedback vertex set on AT-free graphs. - Dieter Kratsch; Haiko Müller; Ioan Todinca (Discret. Appl. Math., 2008)

Minimal proper interval completions. - Ivan Rapaport; Karol Suchan; Ioan Todinca (Inf. Process. Lett., 2008)

Exact Algorithms for Treewidth and Minimum Fill-In. - Fedor V. Fomin; Dieter Kratsch; Ioan Todinca; Yngve Villanger (SIAM J. Comput., 2008)

Pathwidth is NP-Hard for Weighted Trees. - Rodica Mihai; Ioan Todinca (FAW, 2009)

Constructing Brambles. - Mathieu Chapelle; Frédéric Mazoit; Ioan Todinca (MFCS, 2009)

Computing branchwidth via efficient triangulations and blocks. - Fedor V. Fomin; Frédéric Mazoit; Ioan Todinca (Discret. Appl. Math., 2009)

Exponential time algorithms for the minimum dominating set problem on some graph classes. - Serge Gaspers; Dieter Kratsch; Mathieu Liedloff; Ioan Todinca (ACM Trans. Algorithms, 2009)

Minimal interval completion through graph exploration. - Karol Suchan; Ioan Todinca (Theor. Comput. Sci., 2009)

An O(n2){ mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. - Christophe Crespelle; Ioan Todinca (TAMC, 2010)

Exact Algorithm for the Maximum Induced Planar Subgraph Problem. - Fedor V. Fomin; Ioan Todinca; Yngve Villanger (ESA, 2011)

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. - Florent Becker; Martín Matamala; Nicolas Nisse; Ivan Rapaport; Karol Suchan; Ioan Todinca (IPDPS, 2011)

On Dissemination Thresholds in Regular and Irregular Graph Classes. - Ivan Rapaport; Karol Suchan; Ioan Todinca; Jacques Verstraëte (Algorithmica, 2011)

A note on planar graphs with large width parameters and small grid-minors. - Alexander Grigoriev; Bert Marchal; Natalya Usotskaya; Ioan Todinca (Discret. Appl. Math., 2012)

TREEWIDTH and PATHWIDTH parameterized by vertex cover - Mathieu Chapelle; Mathieu Liedloff; Ioan Todinca; Yngve Villanger (CoRR, 2013)

The complexity of the bootstraping percolation and other problems. - Eric Goles Ch.; Pedro Montealegre-Barba; Ioan Todinca (Theor. Comput. Sci., 2013)

An O(n2)O(n2)-time algorithm for the minimal interval completion problem. - Christophe Crespelle; Ioan Todinca (Theor. Comput. Sci., 2013)

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIROCCO, 2014)

(Circular) backbone colouring: Forest backbones in planar graphs. - Frédéric Havet; Andrew D. King; Mathieu Liedloff; Ioan Todinca (Discret. Appl. Math., 2014)

Solving Capacitated Dominating Set by using covering by subsets and maximum matching. - Mathieu Liedloff; Ioan Todinca; Yngve Villanger (Discret. Appl. Math., 2014)

An O(n^2) Time Algorithm for the Minimal Permutation Completion Problem. - Christophe Crespelle; Anthony Perez 001; Ioan Todinca (WG, 2015)

Allowing each node to communicate only once in a distributed system: shared whiteboard models. - Florent Becker; Adrian Kosowski; Martín Matamala; Nicolas Nisse; Ivan Rapaport; Karol Suchan; Ioan Todinca (Distributed Comput., 2015)

Injective Colorings with Arithmetic Constraints. - Natacha Astromujoff; Mathieu Chapelle; Martín Matamala; Ioan Todinca; José Zamora (Graphs Comb., 2015)

Large Induced Subgraphs via Triangulations and CMSO. - Fedor V. Fomin; Ioan Todinca; Yngve Villanger (SIAM J. Comput., 2015)

Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. - Pedro Montealegre 001; Ioan Todinca (PODC, 2016)

Distributed Testing of Excluded Subgraphs. - Pierre Fraigniaud; Ivan Rapaport; Ville Salo; Ioan Todinca (DISC, 2016)

On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. - Pedro Montealegre 001; Ioan Todinca (WG, 2016)

Guest Editorial: Selected Papers from WG 2014. - Dieter Kratsch; Ioan Todinca (Algorithmica, 2016)

Deterministic graph connectivity in the broadcast congested clique. - Pedro Montealegre 001; Ioan Todinca (CoRR, 2016)

Exact Algorithms for Treewidth. - Ioan Todinca (Encyclopedia of Algorithms, 2016)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Distributed Subgraph Detection. - Pierre Fraigniaud; Pedro Montealegre 001; Dennis Olivetti; Ivan Rapaport; Ioan Todinca (CoRR, 2017)

Treewidth and Pathwidth parameterized by the vertex cover number. - Mathieu Chapelle; Mathieu Liedloff; Ioan Todinca; Yngve Villanger (Discret. Appl. Math., 2017)

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (LATIN, 2018)

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. - Pedro Montealegre 001; Sebastian Perez-Salazar; Ivan Rapaport; Ioan Todinca (SIROCCO, 2018)

Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. - Fedor V. Fomin; Mathieu Liedloff; Pedro Montealegre 001; Ioan Todinca (Algorithmica, 2018)

On Distributed Merlin-Arthur Decision Protocols. - Pierre Fraigniaud; Pedro Montealegre 001; Rotem Oshman; Ivan Rapaport; Ioan Todinca (SIROCCO, 2019)

Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. - Mathieu Liedloff; Pedro Montealegre 001; Ioan Todinca (Algorithmica, 2019)

An O(n2) time algorithm for the minimal permutation completion problem. - Christophe Crespelle; Anthony Perez 001; Ioan Todinca (Discret. Appl. Math., 2019)

On the heapability of finite partial orders. - János Balogh; Cosmin Bonchis; Diana Dinis; Gabriel Istrate; Ioan Todinca (Discret. Math. Theor. Comput. Sci., 2020)

Graph reconstruction in the congested clique. - Pedro Montealegre 001; Sebastian Perez-Salazar; Ivan Rapaport; Ioan Todinca (J. Comput. Syst. Sci., 2020)

The Impact of Locality in the Broadcast Congested Clique Model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIAM J. Discret. Math., 2020)

Polynomial Kernels for Strictly Chordal Edge Modification Problems. - Maël Dumas; Anthony Perez 001; Ioan Todinca (IPEC, 2021)

Compact Distributed Certification of Planar Graphs. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Algorithmica, 2021)

The role of randomness in the broadcast congested clique model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (Inf. Comput., 2021)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (ISAAC, 2022)

Computing Power of Hybrid Models in Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Pablo Paredes; Ivan Rapaport; Martín Ríos-Wilson; Ioan Todinca (OPODIS, 2022)

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Pablo Paredes; Ivan Rapaport; Martín Ríos-Wilson; Ioan Todinca (DISC, 2022)

On constant-time quantum annealing and guaranteed approximations for graph optimization problems. - Arthur Braida; Simon Martiel; Ioan Todinca (CoRR, 2022)

Energy-Efficient Distributed Algorithms for Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIROCCO, 2023)

Distributed Certification for Classes of Dense Graphs. - Pierre Fraigniaud; Frédéric Mazoit; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (DISC, 2023)

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing. - Arthur Braida; Simon Martiel; Ioan Todinca (CoRR, 2023)

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing. - Arthur Braida; Simon Martiel; Ioan Todinca (CoRR, 2023)

Local certification of graphs with bounded genus. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Discret. Appl. Math., 2023)

A Cubic Vertex-Kernel for Trivially Perfect Editing. - Maël Dumas; Anthony Perez 001; Ioan Todinca (Algorithmica, 2023)

Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. - Fedor V. Fomin; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (PODC, 2024)

Even-Cycle Detection in the Randomized and Quantum CONGEST Model. - Pierre Fraigniaud; Maël Luce; Frédéric Magniez; Ioan Todinca (PODC, 2024)

Distributed Model Checking on Graphs of Bounded Treedepth. - Fedor V. Fomin; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (DISC, 2024)

Distributed Model Checking in Graphs Classes of Bounded Expansion. - Fedor V. Fomin; Pierre Fraigniaud; Petr A. Golovach; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (CoRR, 2024)

On Graphs Coverable by k Shortest Paths. - Maël Dumas; Florent Foucaud; Anthony Perez 001; Ioan Todinca (SIAM J. Discret. Math., 2024)

On the power of threshold-based algorithms for detecting cycles in the CONGEST model. - Pierre Fraigniaud; Maël Luce; Ioan Todinca (Theor. Comput. Sci., 2024)

A Meta-Theorem for Distributed Certification. - Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (Algorithmica, 2024)

Deterministic Even-Cycle Detection in Broadcast CONGEST. - Pierre Fraigniaud; Maël Luce; Frédéric Magniez; Ioan Todinca (ICALP, 2025)

Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. - Fedor V. Fomin; Pierre Fraigniaud; Petr A. Golovach; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (PODC, 2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs. - Maël Dumas; Anthony Perez 001; Mathis Rocton; Ioan Todinca (Discret. Math. Theor. Comput. Sci., 2025)