Ioan Todinca

According to our database, Ioan Todinca authored at least 75 papers between 1998 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

A Meta-Theorem for Distributed Certification.

Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Algorithmica, February, 2024

Even-Cycle Detection in the Randomized and Quantum CONGEST Model.

Pierre Fraigniaud, Maël Luce, Frédéric Magniez, Ioan Todinca

CoRR, 2024

2023

A Cubic Vertex-Kernel for Trivially Perfect Editing.

Maël Dumas, Anthony Perez, Ioan Todinca

Algorithmica, April, 2023

Local certification of graphs with bounded genus.

Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca

Discret. Appl. Math., 2023

Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing.

Arthur Braida, Simon Martiel, Ioan Todinca

CoRR, 2023

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing.

Arthur Braida, Simon Martiel, Ioan Todinca

CoRR, 2023

Distributed Certification for Classes of Dense Graphs.

Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Energy-Efficient Distributed Algorithms for Synchronous Networks.

Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Proceedings of the Structural Information and Communication Complexity, 2023

On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model.

Pierre Fraigniaud, Maël Luce, Ioan Todinca

Proceedings of the Structural Information and Communication Complexity, 2023

2022

On constant-time quantum annealing and guaranteed approximations for graph optimization problems.

Arthur Braida, Simon Martiel, Ioan Todinca

CoRR, 2022

Polynomial kernels for edge modification problems towards block and strictly chordal graphs.

Maël Dumas, Anthony Perez, Mathis Rocton, Ioan Todinca

CoRR, 2022

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks.

Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Computing Power of Hybrid Models in Synchronous Networks.

Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

On Graphs Coverable by k Shortest Paths.

Maël Dumas, Florent Foucaud, Anthony Perez, Ioan Todinca

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

The role of randomness in the broadcast congested clique model.

Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Inf. Comput., 2021

Compact Distributed Certification of Planar Graphs.

Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca

Algorithmica, 2021

Polynomial Kernels for Strictly Chordal Edge Modification Problems.

Maël Dumas, Anthony Perez, Ioan Todinca

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

The Impact of Locality in the Broadcast Congested Clique Model.

Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

SIAM J. Discret. Math., 2020

Graph reconstruction in the congested clique.

Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca

J. Comput. Syst. Sci., 2020

On the heapability of finite partial orders.

János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca

Discret. Math. Theor. Comput. Sci., 2020

2019

An O(n2) time algorithm for the minimal permutation completion problem.

Christophe Crespelle, Anthony Perez, Ioan Todinca

Discret. Appl. Math., 2019

Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.

Mathieu Liedloff, Pedro Montealegre, Ioan Todinca

Algorithmica, 2019

On Distributed Merlin-Arthur Decision Protocols.

Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca

Proceedings of the Structural Information and Communication Complexity, 2019

2018

Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.

Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca

Algorithmica, 2018

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.

Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca

Proceedings of the Structural Information and Communication Complexity, 2018

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.

Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Treewidth and Pathwidth parameterized by the vertex cover number.

Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Discret. Appl. Math., 2017

Distributed Subgraph Detection.

Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca

CoRR, 2017

Three Notes on Distributed Property Testing.

Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca

Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016

Exact Algorithms for Treewidth.

Ioan Todinca

Encyclopedia of Algorithms, 2016

Deterministic graph connectivity in the broadcast congested clique.

Pedro Montealegre, Ioan Todinca

CoRR, 2016

Guest Editorial: Selected Papers from WG 2014.

Dieter Kratsch, Ioan Todinca

Algorithmica, 2016

On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators.

Pedro Montealegre, Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Distributed Testing of Excluded Subgraphs.

Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca

Proceedings of the Distributed Computing - 30th International Symposium, 2016

Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique.

Pedro Montealegre, Ioan Todinca

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Large Induced Subgraphs via Triangulations and CMSO.

Fedor V. Fomin, Ioan Todinca, Yngve Villanger

SIAM J. Comput., 2015

Injective Colorings with Arithmetic Constraints.

Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora

Graphs Comb., 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

An <i>O</i>(n^2) Time Algorithm for the Minimal Permutation Completion Problem.

Christophe Crespelle, Anthony Perez, Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

2014

Solving Capacitated Dominating Set by using covering by subsets and maximum matching.

Mathieu Liedloff, Ioan Todinca, Yngve Villanger

Discret. Appl. Math., 2014

(Circular) backbone colouring: Forest backbones in planar graphs.

Frédéric Havet, Andrew D. King, Mathieu Liedloff, Ioan Todinca

Discret. Appl. Math., 2014

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism.

Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

Proceedings of the Structural Information and Communication Complexity, 2014

2013

An <i>O</i>(<i>n</i>²)O(n2)-time algorithm for the minimal interval completion problem.

Christophe Crespelle, Ioan Todinca

Theor. Comput. Sci., 2013

The complexity of the bootstraping percolation and other problems.

Eric Goles Ch., Pedro Montealegre-Barba, Ioan Todinca

Theor. Comput. Sci., 2013

TREEWIDTH and PATHWIDTH parameterized by vertex cover

Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger

CoRR, 2013

2012

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

2011

On Dissemination Thresholds in Regular and Irregular Graph Classes.

Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte

Algorithmica, 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

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Exact Algorithm for the Maximum Induced Planar Subgraph Problem.

Fedor V. Fomin, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms - ESA 2011, 2011

2010

An <i>O</i>(<i>n</i>²){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem.

Christophe Crespelle, Ioan Todinca

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009

Minimal interval completion through graph exploration.

Karol Suchan, Ioan Todinca

Theor. Comput. Sci., 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

Computing branchwidth via efficient triangulations and blocks.

Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca

Discret. Appl. Math., 2009

Constructing Brambles.

Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Pathwidth is NP-Hard for Weighted Trees.

Rodica Mihai, Ioan Todinca

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Exact Algorithms for Treewidth and Minimum Fill-In.

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger

SIAM J. Comput., 2008

Minimal proper interval completions.

Ivan Rapaport, Karol Suchan, Ioan Todinca

Inf. Process. Lett., 2008

Feedback vertex set on AT-free graphs.

Dieter Kratsch, Haiko Müller, Ioan Todinca

Discret. Appl. Math., 2008

2007

On powers of graphs of bounded NLC-width (clique-width).

Karol Suchan, Ioan Todinca

Discret. Appl. Math., 2007

Pathwidth of Circular-Arc Graphs.

Karol Suchan, Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2007

Characterizing Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the STACS 2007, 2007

2006

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

Ioan Todinca

, 2006

2005

Connected Graph Searching in Outerplanar Graphs.

Fedor V. Fomin, Dimitrios M. Thilikos, Ioan Todinca

Electron. Notes Discret. Math., 2005

Minimal Interval Completions.

Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger

Proceedings of the Algorithms, 2005

2004

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.

Fedor V. Fomin, Dieter Kratsch, Ioan Todinca

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

Chordal embeddings of planar graphs.

Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca

Discret. Math., 2003

Approximating the treewidth of AT-free graphs.

Vincent Bouchitté, Ioan Todinca

Discret. Appl. Math., 2003

Coloring Powers of Graphs of Bounded Clique-Width.

Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.

Dieter Kratsch, Haiko Müller, Ioan Todinca

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

2002

Listing all potential maximal cliques of a graph.

Vincent Bouchitté, Ioan Todinca

Theor. Comput. Sci., 2002

2001

Treewidth and Minimum Fill-in: Grouping the Minimal Separators.

Vincent Bouchitté, Ioan Todinca

SIAM J. Comput., 2001

Treewidth of planar graphs: connections with duality.

Vincent Bouchitté, Frédéric Mazoit, Ioan Todinca

Electron. Notes Discret. Math., 2001

On treewidth approximations.

Vincent Bouchitté, Dieter Kratsch, Haiko Müller, Ioan Todinca

Electron. Notes Discret. Math., 2001

1999

Treewidth and Minimum Fill-in of Weakly Triangulated Graphs.

Vincent Bouchitté, Ioan Todinca

Proceedings of the STACS 99, 1999

1998

Minimal Triangulations for Graphs with "Few" Minimal Separators.

Vincent Bouchitté, Ioan Todinca

Proceedings of the Algorithms, 1998