Education
2003 - 2006: Department of Informatics and Applied Mathematics, Yerevan State University
Post-graduate student, the defense of PhD thesis entitled “On special maximum matching constructing” was held on June 2nd of 2006 in the Institute for Informatics and Automation Problems of the National Academy of Sciences of Armenia (IIAP of NAS RA below). Awarded the degree PhD in Mathematics on June 2nd of 2006.
2001 - 2003: Department of Informatics and Applied Mathematics, Yerevan State University
Awarded Master’s Degree for his master thesis entitled “On complexity of constructing maximum matchings of a special kind”
1997 - 2001: Department of Informatics and Applied Mathematics, Yerevan State University
Awarded Bachelor’s Degree for his thesis entitled “Behavior of the solutions of the hyperbolic type equations in case of large time values”

Academic degree
V. V. Mkrtchyan, On special maximum matching constructing, PhD thesis, IIAP of NAS RA, Yerevan, 2006, 150 pages (Armenian)

Professional experience
2007 January - up to now. IIAP of NAS RA
• Researcher
2006 September - up to now. Department of Informatics and Applied
Mathematics, Yerevan State University
• Assistant
2005 - 2006: The first semester. Department of Informatics and Applied Mathematics, Armenian-Russian State University, Instructor of
• Discrete Mathematics.
2003 - 2006: Department of Informatics and Applied Mathematics, Yerevan
State University, Instructor of
• Discrete Mathematics
• Combinatorial Algorithms.
2002 - 2006: IIAP of NAS RA:
• Junior Researcher
2006 - up to now: Department of Informatics and Applied Mathematics, Yerevan
State University,
• Supervisor of Course-works of the second and third year students.
• Supervisor of Graduate and Master theses
2003 - 2006: Department of Informatics and Applied Mathematics, Yerevan State University,
• Supervisor of Course-works of the second and third year students.
Selected students:
Master theses
A. V. Tserunyan, “Characterization of a class of graphs related to pairs of disjoint matchings”, Yerevan State University, 2007, (Discrete Mathematics, to appear, DOI: 10.1016/j.disc.2008.01.004 available at: http://arxiv.org/abs/0712.1014)
Course-Works
V. L. Musoyan, “On complexity of graphs: an approach through matchings”, Yerevan State University, 2007 (Proceedings of CSIT 2007, pp. 81-83)
A. Darbinyan, “On pseudo-monotonicity of a parameter related to pairs of disjoint matchings in graphs”, Yerevan State University, 2007
BS theses
S. Petrosyan, Disjoint matchings in regular graphs, Yerevan State University, 2007

Academic courses
• Discrete Mathematics
• Operational Research,
• Combinatorial Optimization (drafts are available at: http://arxiv.org/abs/0708.3962),
• Graph Theory

Scale of professional interests
Discrete Optimization, Approximation Algorithms, Complexity Theory, Graph Theory especially Matching Theory. More specifically, I am interested in problems that are related to coverings of graphs by matchings. This particularly, includes prominent conjectures of Berge, Fulkerson and Seymour

Participation in grant projects
2006: Principal Investigator of “On pairs of disjoint matchings of a graph”, Armenian National Science and Education Fund, http://www.ansef.org/grants/grants2007.html

Languages
Native speaker of Armenian, Fluent in English and Russian

Professional membership
Reviewer of
• Discrete Mathematics, http://ees.elsevier.com/disc
• Discussiones Mathematicae Graph Theory, http://www.uz.zgora.pl/discuss/gt

Awards received
1. 28 May 2007: Emil Artin Foundation Award for the solution of the problem 11161 in the Monthly of the Mathematical Association of America
2. 2004: Gratis-Goi scholarship to undertake the program “English for Professionals” in the Institute of English and Foreign Languages, Hyderabad-500007, Hyderabad, Andhra Pradesh, India
3. January 2001 - June 2001. Joint Scholarship of the Department of Informatics and Applied Mathematics and “Educational Reforms”,
4. Autumn of 2000: Special prize of Yerevan State University for academic excellency,

vahanmkrtchyan2002@ysu.am