معرفی
Ioan Todinca is a Professor of Computer Science at the University of Orléans, France, affiliated with the LIFO (Laboratoire d'Informatique Fondamentale d'Orléans) research laboratory. His academic career spans over two decades, with significant contributions to theoretical computer science, particularly in graph algorithms and distributed computing.
- Faculty of Science, University of Orléans
- LIFO Research Laboratory
- Member of Institut thématique pluridisciplinaire Modélisation, Systèmes, Langages (since 2014)
- Former director of MIPTIS doctoral school (2012-2014)
- Former head of Computer Science degree program (2007-2011)
- Former leader of LIFO Graphs, Algorithms and Computational Models team (2008-2012)
Todinca's research focuses primarily on graph algorithms, with expertise in exact algorithms (moderately exponential), parameterized algorithms, and algorithms for specific graph classes. He has made significant contributions to techniques involving tree decompositions, treewidth, minimal separators, and potential maximal cliques. More recently, his work has expanded into distributed algorithms, especially in communication-constrained models like the broadcast congested clique. His research bridges theoretical foundations with practical algorithmic approaches for NP-hard problems.
The analysis of his recent publications reveals a strong trend toward distributed computing problems, particularly in congested network models. His work spans from fundamental graph theory problems (cycle detection, graph modification) to applications in quantum computing and model checking. The consistent focus on communication complexity, verification, and efficient algorithms across different computational models demonstrates his ability to adapt theoretical computer science principles to emerging computational paradigms.
Todinca has supervised numerous PhD students and has been actively involved in the theoretical computer science community through conference organization and editorial work. His publications appear consistently in top-tier venues including SIAM Journal on Computing, Algorithmica, and proceedings of major conferences like STACS, WG, and DISC.
Teaching responsibilities include algorithms, graph theory, and discrete structures for undergraduate and graduate students, with previous experience teaching databases, programming, and software engineering. His educational materials are hosted on the university's Celene platform.
