team

Tigran Philiposyan

Ph.D., Associate Professor

About

Education:
  • Yerevan State University / Faculty of Applied Mathematics (1968 - 1973)
Work Experience: 
  • 1995–2013, Republican Informatics Olympiads
    • Member of the Jury
  • 1995–2013, Computing Center of the Academy of Sciences of the Armenian SSR
    • Junior Research Fellow
  • 1986 – 1991, Computing Center of the Ministry of Motor Transport of the Armenian SSR
    • Head of the Transportation Automation Laboratory
  • 1991 – 2003, Center for Educational Reforms of the Ministry of Education of Armenia, Department of Informatics
    • Methodologist, Associate Professor
  • 1998 – 2003, A. Shirakatsi Yerevan Lyceum, Department of Informatics
    • Head of Department, Lecturer in Mathematics
  • 2002 – по настоящее время, Russian–Armenian (Slavonic) University, Department of Mathematical Cybernetics
    • Associate Professor, Chief Specialist of the Academic Affairs Office, Coach of student programming teams
Specialization: Mathematical Cybernetics

Taught Subjects:
  • Discrete Mathematics

Scientific interests

  • Issues of graph embedding and hypergraph realization and their applications in computer-aided design (CAD)

List of publications

  • T. E. Piliposyan . On one of the problems of placing. Dokl. AN Arm. SSR, 1976, 62 (5). pp. 265-268. In Russian.
  • T. E. Piliposyan About length of one class of oriented trees on the plane. Mathematical Problems of Computer Science. Yerevan 1979, 9, 64-70, In Russian
  • С. Л. Амбарян, А.А.Мовсесян, Т.Э.Пилипосян, С.ГСаркисян, К.С.Севоян. К вопросу о проектировании плат с проводным монтажом. Вопросы радиоэлектроники, серия ЭВТ, 1982, вып. 14, стр. 64-73
  • D. O. Muradyan, and T. E. Piliposyan, Minimal numberings of vertices of a rectangular lattice.”Eritasardgitashxatox”, YSU, 1980. N 2 (32) ,74-84, In Armenian.
  • D. Muradianand T. Piliposyan. Minimal layouts of two-dimensional lattice. Dokl. AN Arm. SSR, No. 70, 21-27. 1980. In Russian.
  • D. Muradian and T. Piliposyan. Minimal Linear Arrangement and Cutwidth problems for complete n-partite graphs. Uchenie Zapiski Erevanskovo Gos-unta, 1980, 2, 18-26,. In Russian
  • S.L.Hambaryan, H.A. Mowsisyan, T.E. Piliposyan, About minimal realization of hypergraphs. Questions of radio-electronics 1981, 16. 37-42, In Russian.
  • T. E. Piliposyan, Estimation for realization number of hypergraphs, , Mathematical Problems of Computer Science 1985, 14, pp. 26-33, In Russian.
  • T. E. Piliposyan, , On the planary realized hypergraphs. Dokl. AN Arm. SSR, 1986, 82 (3), pp. 102-106. In Russian
  • Piliposyan E.T. and Piliposyan T.E. A note on minimal realization of hypergraphs , XIV international sciеntifiс-praсtiсal соnference 2011, St. Pеtеrsburg, Russiа, Hi- Tech 2012, , 2. pp. 86-89.

File information