Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 12.04.1953
Website: https://www.ub.ro/stiinte/structura-facultatii/dept-matematica-informatica-si-stiintele-educatiei/pro
Keywords: chordal graphs, hyper-chordal graphs, weak decomposition, recognition algorithm.

Subject:

Hyper-chordal graphs

Main publications:

1. Mihai Talmaciu, Victor Lepin, “Algorithms for the Recognition of Net-free Graphs and for Computing Maximum Cardinality Matchings in Claw-free Graphs”, Studies in Informatics and Control, 23:2 (2014), 183–188
2. Mihai Talmaciu, Elena Nechita, “Barna Iantovics, Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs”, Computing and Informatics, 32:2 (2013), 313–329  
3. M. Talmaciu, E. Nechita, “On partitionable, confidentially connected and unbreakable graphs”, Analele Scientifice ale Universitatii Ovidius Constanta – Seria Matematica, 19:1 (2011), 263.273  
4. M. Talmaciu, E. Nechita, “Recognition algorithm for diamond-free graphs”, Informatica, 18:3 (2007), 457–462 https://www.mii.lt/informatica/htm/INFO683.htm  
5. E. Olaru, M. Talmaciu, “A Class of Partitionable Graphs”, Bulletin Mathematique de la Societe des Sciences Mathematiques de Roumanie, 48 (96) \isuue 3 (2005), 313–317  

Publications in Math-Net.Ru

Personal pages:

• 

Organisations:

• "Vasile Alecsandri" University of Bacău