Ioan Todinca

About Ioan Todinca

Ioan Todinca, With an exceptional h-index of 23 and a recent h-index of 14 (since 2020), a distinguished researcher at Université d'Orléans, specializes in the field of graph algorithms, tree decompositions.

His recent articles reflect a diverse array of research interests and contributions to the field:

Avoided level crossings with exponentially closing gaps in quantum annealing

On the power of threshold-based algorithms for detecting cycles in the CONGEST model

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

Even-Cycle Detection in the Randomized and Quantum CONGEST Model

Local certification of graphs with bounded genus

Distributed certification for classes of dense graphs

Energy-Efficient Distributed Algorithms for Synchronous Networks

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing

Ioan Todinca Information

University

Position

France

Citations(all)

1731

Citations(since 2020)

648

Cited By

1404

hIndex(all)

23

hIndex(since 2020)

14

i10Index(all)

47

i10Index(since 2020)

17

Email

University Profile Page

Google Scholar

Ioan Todinca Skills & Research Interests

graph algorithms

tree decompositions

Top articles of Ioan Todinca

Title

Journal

Author(s)

Publication Date

Avoided level crossings with exponentially closing gaps in quantum annealing

Physical Review A

Arthur Braida

Simon Martiel

Ioan Todinca

2024/2/12

On the power of threshold-based algorithms for detecting cycles in the CONGEST model

Theoretical Computer Science

Pierre Fraigniaud

Maël Luce

Ioan Todinca

2024/5/21

Tight Lieb–Robinson Bound for approximation ratio in quantum annealing

npj Quantum Information

Arthur Braida

Simon Martiel

Ioan Todinca

2024/4/17

Even-Cycle Detection in the Randomized and Quantum CONGEST Model

arXiv preprint arXiv:2402.12018

Pierre Fraigniaud

Mael Luce

Frederic Magniez

Ioan Todinca

2024/2/19

Local certification of graphs with bounded genus

Discrete Applied Mathematics

Laurent Feuilloley

Pierre Fraigniaud

Pedro Montealegre

Ivan Rapaport

Eric Rémila

...

2023/1/30

Distributed certification for classes of dense graphs

arXiv preprint arXiv:2307.14292

Pierre Fraigniaud

Frédéric Mazoit

Pedro Montealegre

Ivan Rapaport

Ioan Todinca

2023/7/26

Energy-Efficient Distributed Algorithms for Synchronous Networks

Pierre Fraigniaud

Pedro Montealegre

Ivan Rapaport

Ioan Todinca

2023/5/25

Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing

arXiv preprint arXiv:2304.12872

Arthur Braida

Simon Martiel

Ioan Todinca

2023/4/25

A Cubic Vertex-Kernel for Trivially Perfect Editing

Algorithmica

Maël Dumas

Anthony Perez

Ioan Todinca

2023/4

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

arXiv preprint arXiv:2201.13140

Maël Dumas

Anthony Perez

Mathis Rocton

Ioan Todinca

2022/1/31

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks

Pierre Fraigniaud

Pedro Montealegre

Pablo Paredes

Ivan Rapaport

Martín Ríos-Wilson

...

2022

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

Quantum Science and Technology

Arthur Braida

Simon Martiel

Ioan Todinca

2022/9/15

Computing power of hybrid models in synchronous networks

arXiv preprint arXiv:2208.02640

Pierre Fraigniaud

Pedro Montealegre

Pablo Paredes

Ivan Rapaport

Martín Ríos-Wilson

...

2022/8/4

On graphs coverable by k shortest paths

arXiv preprint arXiv:2206.15088

Maël Dumas

Florent Foucaud

Anthony Perez

Ioan Todinca

2022/6/30

A meta-theorem for distributed certification

Pierre Fraigniaud

Pedro Montealegre

Ivan Rapaport

Ioan Todinca

2022/6/25

The role of randomness in the broadcast congested clique model

Information and Computation

Florent Becker

Pedro Montealegre

Ivan Rapaport

Ioan Todinca

2021/12/1

Polynomial kernels for strictly chordal edge modification problems

Maël Dumas

Anthony Perez

Ioan Todinca

2021

On the heapability of finite partial orders

Discrete Mathematics and Theoretical Computer Science

János Balogh

Cosmin Bonchiş

Diana Diniş

Gabriel Istrate

Ioan. Todinca

2020

The impact of locality in the broadcast congested clique model

SIAM Journal on Discrete Mathematics

Florent Becker

Pedro Montealegre

Ivan Rapaport

Ioan Todinca

2020

Graph reconstruction in the congested clique

Journal of Computer and System Sciences

Pedro Montealegre

Sebastian Perez-Salazar

Ivan Rapaport

Ioan Todinca

2020/11/1

See List of Professors in Ioan Todinca University(Université d'Orléans)

Co-Authors

academic-engine