Събития

Корпус 2, зала 706


Организатор:
департамент „Информатика“


Лектор:
доц. д-р Ласко Ласков


We propose an exact method that finds the complete Pareto front of the biobjective minimum length minimum risk spanning trees problem. The proposed method consists of the solution of two problems. The first problem is to compute a list of all minimum spanning trees with respect of the length criterion. The second problem is to construct the complete Pareto front itself, based on the list of all minimum spanning trees, found using the solution of the first problem.

Current position: associate professor in computer science at the Informatics department of New Bulgarian University.
In 2005 obtained M.s. in Computer Science in New Bulgarian University, program Software Technologies in Internet. In 2009 obtained Ph.D. in Computer Science in New Bulgarian University, program Theoretical Informatics. In 2010 obtained Ph.D. in Computer Science, Higher Attestation Commission, Specialized Scientific Council of Informatics and Mathematical Modeling, "Recognition of Neume Writing in Historical Documents".