Professor Ioan Tomescu

Professor Ioan Tomescu, corresponding member of the Romanian Academy, has been educated at the University of Bucharest, Faculty of Mathematics and Computer Science.

Professor Tomescu's areas of research are combinatorics and graph theory and applications.

He has obtained his PhD in Mathematics in 1971 with the Thesis "Combinatorial Methods in the Theory of Finite Automata" under the supervision of Academician Gr. C. Moisil. In his thesis, he proposed a matrix method for determining all pairs of compatible states of a sequential Mealy machine and showed that the minimisation of such a machine can be reduced, in some case, to the problem of finding a minimum chromatic partition of the vertex set of a graph.

Note: Professor Tomescu was the leader of the Romanian team for the International Olympiad in Mathematics (1983-1986 and 1990-1994) and the leader of the Romanian team for the “Balkan Olympiad in Mathematics" (1990-1994).
Note: Romania is initiator of the International Mathematical Olympiad (IMO) (1959, Brasov) - www.imo-official.org (Ref.: www.unibuc.ro/prof/vlada_m/)

"During a prolific research career which continues unabated to this day, Professor Tomescu has made important contributions in the theory of combinational circuits, extremal graph theory (especially in problems related to vertex colourings and chromatic polynomials), hypergraphs and their connection to Bonferroni-type inequalities, Hamiltonian problems for some classes of graphs, combinatorial chemistry, combinatorics on words, metric graph theory."

Ref.:
- Cristian S. Calude, Gheorghe Stefanescu, Marius Zimand,
Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu, (JUCS Special Issue),
- http://funinf.cs.unibuc.ro/~gheorghe/org/ (pdf)
- http://funinf.cs.unibuc.ro/~gheorghe/
- http://www.genealogy.math.ndsu.nodak.edu/
- http://fmi.unibuc.ro/ro/departamente/informatica/tomescu_ioan/

---