# Curriculum Vitae

- Place of birth: Stepanavan, Armenia

## Present position

Professor in Applied Mathematics at Linköping University, Sweden
## Education

- Master of Science in Applied Mathematics, Yerevan State University, Yerevan, Armenia, 1973
- Ph.D. in Mathematics, Moscow State University, Moscow, 1980
- Docent in Mathematical Cybernetics, Yerevan State University, 1986
- Docent in Mathematics, Luleå University of Technology, Sweden, 1997

## Employment

- 1.01.2003-present: Professor, Department of Mathematics, Linköping University, Sweden
- 14. 02. 2001-31.12.2002: Professor, Department of Mathematics, Luleå University of Technology, Sweden
- 1996- 13.02.2001: Associate Professor, Department of Mathematics, Luleå University of Technology
- 1984 - 1995: Associate Professor, Yerevan State University, Armenia
- 1982-1984: Assistant Professor, Yerevan State University
- 1976-1982: Group Director of the laboratory of
theoretical cybernetics, Yerevan State University

## Visiting positions

- 1.06.1992-1.08.1992: Visiting Professor, University of Waterloo (Canada)
- 21.11.1992- 21.05.1993: Researcher, University of Twente (Holland)
- 1.09. 1993 - 1.03. 1995: Researcher, Umeå University (Sweden)
- 1.06.95-30.06.95, 1.09. 1995 - 30.12. 1995: Lecturer, Umeå University (Sweden)

## Research interests

Graph theory; in particular problems of hamiltonian
graph theory and edge coloring problems
Operations research; in particular problems of existence
and transformations of timetables
Combinatorics; in particular Latin squares and their transformations, transversal theory
## Books

A.S.Asratian, T.M.J. Denley and R. Häggkvist,
Bipartite graphs and their applications ,
Cambridge Tracts in Mathematics 131,
Cambridge Univ. Press, 1998, 272 pp.
A. Asratian, A. Börn and B.O. Turesson, Discrete mathematics,
Textbook, Linköping University, 2006, 235 pp. (in Swedish)
A. Asratian and G. Akopian, Problems and exercises of graph
theory, Textbook, Yerevan University Press, 1985, 70 pp. (in Armenian)
## Doctoral theses supervised

N. Khachatrian, Local algorithms and stability in the problem of hamiltonicity of a graph,
Minsk, 1988.
R. Kamalian, Interval edge colorings of graphs, Novosibirsk, 1990.
A. Mirumyan, Algorithms of transformations in design of experiments
and related problems, Yerevan, 1992.
G. Sarkisian, Hamiltonian properties of graphs with local Ore-type conditions, Yerevan, 1996
N. Oksimets, Some properties of eulerian and hamiltonian graphs, Umeå University, 2003
(joint supervision with Professor R. Häggkvist)
C.J. Casselgren, On some graph coloring problems, Umeå University, 2011
(joint supervision with Professor R. Häggkvist)
## Teaching experience

Courses taught in Linear Algebra, Analytic Geometry, Discrete Mathematics,
Calculus,
Operations Research, Combinatorial Optimization,
Graph Theory and Combinatorics.

Last modified 2011-06-18 by asratian