Dr. Nodari Vakhania studied at the faculty of applied mathematics and cybernetics and graduated from the Tbilisi State University, Georgia in 1983 with honors. His bachelor’s degree thesis was about the syntactic analysis of a compiler for programming language Ada. From 1989 he has entered to the Ph.D. program in computer science in Moscow at the Russian Academy of Sciences and has obtained his degree in 1991 in mathematical cybernetics. From 1992 he was a postdoctoral fellow at the Russian Academy of Sciences, from 1995 he was an associate professor at the science faculty at the Autonomous State University of Morelos, Mexico and from 2002 he is a full professor. He has an honorary position at the Institute of Computational Mathematics of the Georgian Academy of Sciences, and has received his doctoral degree (habilitation) in mathematical cybernetics at the Georgian Academy of Sciences in 2004. His research interests include design and analysis of algorithms, discrete optimization, computational complexity, scheduling theory, algorithms on graphs. He is an author of over 100 refereed research papers including over 60 publications in highly-ranked international journals. He has been worked in different scientific committees and is a member of editorial and review boards of a number of international scientific journals. He has obtained research grants and honors in Germany, France, the Netherlands, USA, Russia and Mexico and had over 40 invited talks throughout the world. He has been involved in the development of the novel solution methods for important real- life optimization problems including scheduling, routing and graph problems. In particular, he has constructed the state of the art polynomial-time algorithms for classical scheduling problems including ones with the previously open status. He referees over a few dozen research papers and grant proposals annually, supervises the thesis of a number of graduate and postgraduate students.