- 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
Armen Asratian
Professor Emeritus
My research interests are in graph theory, operations research, and combinatorics.
CV
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
- 11.07.2018-present: Professor Emeritus, Department of Mathematics, Linköping University
- 1.01.2003-10.07.2018: Full Professor, Department of Mathematics, Linköping University
- 14. 02. 2001-31.12.2002: Full 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)
Books
- A.S.Asratian, T.M.J. Denley and R. Häggkvist, Bipartite graphs and their applications (Hardback), Cambridge Tracts in Mathematics 131, Cambridge Univ. Press, 1998, 272 pp.
- A.S.Asratian, T.M.J. Denley and R. Häggkvist, Bipartite graphs and their applications (Paperback), Cambridge Tracts in Mathematics 131, Cambridge Univ. Press, 2008, 272 pp.
- A. Asratian, A. Björn and B.O. Turesson, Discrete mathematics, Textbook, Liber, Stockholm, 2020, 344 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)
- J.B. Granholm, Local conditions for long cycles in graphs, Linköping University, 2021 (joint supervision with Docent C.J. Casselgren)
Teaching experience
- Courses taught in Linear Algebra, Analytic Geometry, Discrete Mathematics, Calculus, Operations Research, Combinatorial Optimization, Graph Theory and Combinatorics.
Publications
2023
Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
Discrete Applied Mathematics, Vol. 335, p. 25-35
(Article in journal)
https://dx.doi.org/10.1016/j.dam.2022.07.015
2022
On Hamiltonicity of regular graphs with bounded second neighborhoods
Discrete Applied Mathematics, Vol. 316, p. 75-86
(Article in journal)
https://dx.doi.org/10.1016/j.dam.2022.02.018
2021
Some local-global phenomena in locally finite graphs
Discrete Applied Mathematics, Vol. 293, p. 166-176
(Article in journal)
https://dx.doi.org/10.1016/j.dam.2019.12.006
A localization method in Hamiltonian graph theory
Journal of combinatorial theory. Series B (Print), Vol. 148, p. 209-238
(Article in journal)
https://dx.doi.org/10.1016/j.jctb.2020.04.005
2020
Diskret matematik
(Book)