Ioan Todinca

Université d'Orléans — France

Computer Science · Physical Sciences

18h-index1.4kcitations147works0.92yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(87), Complexity and Algorithms in Graphs(77), Graph Labeling and Dimension Problems(29), Optimization and Search Problems(24), Distributed systems and fault tolerance(19)

Publications146 total

Distributed Model Checking on Graphs of Bounded Treedepth
Algorithmica·2025Open Access
Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks
2025Open Access
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
Discrete Mathematics & Theoretical Computer Science·2025Open Access
Deterministic Even-Cycle Detection in Broadcast CONGEST
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2025Open Access
Deterministic Even-Cycle Detection in Broadcast CONGEST
arXiv (Cornell University)·2024Open Access
What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
ArXiv.org·2024Open Access
On Graphs Coverable by \({k}\) Shortest Paths
SIAM Journal on Discrete Mathematics·2024· 3 cited
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
2024· 4 citedOpen Access
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth
2024
Tight Lieb–Robinson Bound for approximation ratio in quantum annealing
npj Quantum Information·2024· 4 citedOpen Access
On the power of threshold-based algorithms for detecting cycles in the CONGEST model
Theoretical Computer Science·2024· 1 cited
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
arXiv (Cornell University)·2024Open Access
Avoided level crossings with exponentially closing gaps in quantum annealing
Physical review. A/Physical review, A·2024· 1 cited
Distributed Model Checking on Graphs of Bounded Treedepth
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2024Open Access
Distributed Model Checking on Graphs of Bounded Treedepth
arXiv (Cornell University)·2024· 1 citedOpen Access
Tight Lieb-Robinson Bound for approximation ratio in Quantum Annealing
arXiv (Cornell University)·2023Open Access
A Meta-Theorem for Distributed Certification
Algorithmica·2023· 11 cited
Anti-crossings occurrence as exponentially closing gaps in Quantum Annealing
arXiv (Cornell University)·2023Open Access
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model
arXiv (Cornell University)·2023Open Access
Energy-Efficient Distributed Algorithms for Synchronous Networks
arXiv (Cornell University)·2023Open Access
page 1 of 8Next →

Frequent Co-authors

Pedro Montealegre(11), Karol Suchan(11), Iván Rapaport(11), Vincent Bouchitté(10), Dieter Kratsch(8), Fedor V. Fomin(7), Yngve Villanger(7), Mathieu Liedloff(5), Pierre Fraigniaud(5), Frédéric Mazoit(4), Florent Becker(4), Haiko Müller(3), Pinar Heggernes(3), Martı́n Matamala(2), Nicolas Nisse(2), Rotem Oshman(2), Eric Goles(1), Dimitrios M. Thilikos(1), Rodica Mihai(1), Ville Salo(1)