Персоналии
RUS  ENG    ЖУРНАЛЫ   ПЕРСОНАЛИИ   ОРГАНИЗАЦИИ   КОНФЕРЕНЦИИ   СЕМИНАРЫ   ВИДЕОТЕКА   ПАКЕТ AMSBIB  
 
Talmaciu Mihai

В базах данных Math-Net.Ru
Публикаций: 1
Научных статей: 1

Статистика просмотров:
Эта страница:37
Страницы публикаций:51
Полные тексты:47
Списки литературы:17
профессор
доктор наук
Специальность ВАК: 01.01.09 (дискретная математика и математическая кибернетика)
Дата рождения: 12.04.1953
Сайт: https://www.ub.ro/stiinte/structura-facultatii/dept-matematica-informatica-si-stiintele-educatiei/pro
Ключевые слова: chordal graphs, hyper-chordal graphs, weak decomposition, recognition algorithm.

Основные темы научной работы

Hyper-chordal graphs

Научная биография:

Dates October 2008- present Occupation or position held Professor PhD Main activities and responsibilities Didactic, research Name and address of employer “Vasile Alecsandri” University of Bacău, Calea Mărăşeşti Street No. 157, Bacău – 600115, Romania Type of business or sector Education and Research Dates 2005 – September 2008 Occupation or position held Associate Professor Main activities and responsibilities Didactic, research Name and address of employer University of Bacău, Calea Mărăşeşti Street No. 157, Bacău – 600115, Romania Type of business or sector Education and Research Dates 1990 – 2005 Occupation or position held Assistant Professor Main activities and responsibilities Didactic, research Name and address of employer University of Bacău, Calea Mărăşeşti Street No. 157, Bacău – 600115, Romania Type of business or sector Education and Research Dates 1979 – 1990 Occupation or position held Programmer Main activities and responsibilities Programming Name and address of employer The Centre of Electronic Calculus, 150 Dr.Aroneanu Street, Bacău

Type of business or sector Informatics Dates 1976 – 1979 Occupation or position held Analyst Programmer Main activities and responsibilities Programmer Name and address of employer Auto Transport Enterprise Neamt Type of business or sector Programming Education and training

Dates 1992 – 2002 Title of qualification awarded PhD Principal subjects/occupational skills covered Decomposition Problems in the Graphs Theory with Applications in Combinatorial Optimization Name and type of organization providing education and training Thesis, University “Alexandru Ioan Cuza” Iaşi, Romania

Dates 1992 – 1992 Cours de l’Ecole d’Ete d’Analyse Numerique (included in the project TEMPUS), Faculty of Mathematics, University “Alexandru Ioan Cuza” Iaşi, Romania Dates 1984 -1989 Title of qualification awarded Licensed in Cybernetics Principal subjects/occupational skills covered The Faculty of Planning and Economical Cybernetics Name and type of organization providing education and training The Academy of Economical Sciences, Bucharest, Romania Dates 1986 – 1987 The Center of Perfecting Teachers of Informatics, Electronic Calculus and Consulting,C.T.C.E. Bacǎu, Romania The Interactive Elaboration of Programs for Calculus Minisistems Using BASIC-PLUS Language(course) Dates 1972 – 1976 Title of qualification awarded Licensed in Mathematics, Specialized in Operational Research Principal subjects/occupational skills covered Faculty of Mathematics Name and type of organization providing education and training University “Alexandru Ioan Cuza” Iaşi, Romania Dates 1968 – 1970 Title of qualification awarded High School Degree Principal subjects/occupational skills covered High School , Theoretical Profile Name and type of organization providing education and training High School of Halaucesti, Iasi, Romania Personal skills and competences

   
Основные публикации:
  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  mathscinet
  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  mathscinet
  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  mathscinet
  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  mathscinet

https://www.mathnet.ru/rus/person124718
Список публикаций на Google Scholar
Список публикаций на ZentralBlatt

Публикации в базе данных Math-Net.Ru Цитирования
2019
1. V. V. Lepin, V. I. Benediktovich, M. Talmaciu, “Topological indices of cographs”, Тр. Ин-та матем., 27:1-2 (2019),  108–126  mathnet

Организации
 
  Обратная связь:
 Пользовательское соглашение  Регистрация посетителей портала  Логотипы © Математический институт им. В. А. Стеклова РАН, 2024