ДепартаментИнформатика

Проф. д-р Красимир Манев

Проф. д-р Красимир Манев

е-mail: kmanev@nbu.bg

проф. д-р Красимир Манев

 

Академична длъжност: професор

 

Научна степен: доктор

 

Основни изследователски интереси в областта на: дискретна математика, формални езици и синтактичен анализ, алгоритми, формални методи в софтуерното инжeнерство.

 

Допълнителни изследователски интереси в областта на: обучение по информатика, състезателно програмиране, системи за оценяване на програми.

 

Възможности за експертиза в областта на: дискретна математика, формални езици и синтактичен анализ, алгоритми, формални методи в софтуерното инжeнерство обучение по информатика,

 

Преподавателски интереси в областта на: дискретна математика, формални езици и граматики, дизайн и анализ на алгоритми, алгоритми в графи, паралелно програмиране

 

Образование:

средно – НПМГ - 1969 г.;

висше – ФМИ на СУ - 1974г.

 

Членство в организации:

Член на Международния комитет IOI 2000-2003, 2005-2013;

Президент на IOI 2014-2017.

 

Участие в национални и международни проекти:

1985-1993 "Математически методи за обработка на информация", Фонд "Научни изследвания" на МОН – член на колектива

1995-1996 "Дискретни математически изследвания с помощта на компютър", Фонд "Научни изследвания" на МОН – ръководител на колектива

2009-2012 „Софтуерни технологии и архитектури” - Фонд "Научни изследвания" на МОН – член на колектива

2009-2011 „Методи за анализ на програмен код” – Национален Иновативен Фонд на МИ – член на колектива

2010-2012 “Автоматизирано извличане на бизнес правила и процеси от програмен код” - Фонд "Научни изследвания" на МОН – ръководител на колектива

Награди:

Почетен знак със синя лента на СУ

Почетен знак на президента на Република България за успехи в извънкласната работа по Информатика

Награда за изключителни заслуги на Международната олимпиада по информатика (IOI)  

По-важни публикации:

Книги

„Увод в дискретната математика“

„Алгоритми в трафи. Основни алгоритми“

Статии

  1. Дискретна математика

                Коен, Р., Кр. Манев. Алгебраические свойства универсальных функций алгебры логики. Доклады БАН, т. 31, № 10, 1978, стр. 1237-1240.

                Manev, Kr., LINCOR – A System for LINear COdes Researches, Mathematics and Education in Mathematics, Proceedings of  XVI Spring Conference of UBM, Sunny Beach, 1987, pp. 500-503.

                Manev, Kr., Software Environment for Research in Discrete Mathematics, Mathematical Research, v. 57, Akademie-Verlag, Berlin, 1990,  pp. 210-217.

                Манев, Кр., Алгоритми и трудни задачи, Доклад по покана, Математика и математическо образование, Доклади на XXIV пролетна конференция на СМБ, София, 1995, стр. 51-65.

                Velikova, E., Kr. Manev, The Covering Radius of Cyclic Codes of Length 33, 35 and 39,   Annuaire de l’Universite de Sofia “St. Kliment Ohridski”, Faculte de Mathematiques et Informatique, Livre 1 – Mathematique, Tome 81, 1987, 215-223.

                Dodunekov, S., Kr. Manev, V. Tonchev, On the Covering Radius of the (14,6) Binary Codes Containing All-ones Vector, IEEE Trans. on Information Theory, v. 34, No. 3, May 1988, pp. 591-593.

                Manev, Kr., E. Velikova, The Covering Radius and Weight Distribution of Cyclic Codes over GF(4) of Lengths up to 13, II International Workshop “Algebraic and Combinatorial Coding Theory”, 16-12 September, 1990, Leningrad, pp. 150-153.

                Landgev, I., Kr. Manev, On the Isomorphism Group of the BIB(22,33,12,8,4) Design, II International Workshop “Algebraic and Combinatorial Coding Theory”, 16-12 September, 1990, Leningrad, pp. 133-136.

                Manev, Kr., N. Mateev, On the Weight Distribution of the Leaders of Cossets for Some Linear Binary Codes,  III International Workshop “Algebraic and Combinatorial Coding Theory”, Voneshta Voda, June, 1992, pp. 126-129.

                Manev, Kr., V. Bakoev, Irreducible Conjunctive Normal Forms of the Zero Function, Proceedings of the Fifth International Conference on Discrete Mathematics and Applications, Blagoevgrad, 1995, pp. 127-131.

                Manev, Kr., R. Stefanov, Yet Another Algorithm for Addition of Vectors in Non Bynary Finite Field, Proceedings of the International Workshop “Algebraic and Combinatorial Coding Theory”, Sozopol, 1996, стр. 190-193.

                Manev, Kr., On the Lower Bound for Covering Radius for First Order Read-Muller Codes, Mathematics and Education in Mathematics,  Proceedings of XXVI Spring Conference of UBM, Sofia, 1997, pp. 150-152.

                Bakoev, V., Kr. Manev, Irreducible Conjunctive Normal Forms of the Zero Function II, Mathematics and Education in Mathematics,  Proceedings of XXVI Spring Conference of UBM, Sofia, 1997, pp. 209-215.

                Manev, Kr., V. Bakoev, Algorithms for Performing the Zhegalkin Transformation,  Mathematics and Education in Mathematics,  Proceedings of XXVII Spring Conference of UBM, 1998, pp. 229-233.

                Bakoev, V., Kr. Manev, Some Necessary and Some Sufficient Conditions about the 3-Satisfiability Problem, Mathematics and Education in Mathematics,  Proceedings of XXIX Spring Conference of UBM, Sofia, 2000, pp. 233-239.

                Manev, Kr.,  Algebraic Properties of Zhegalkin Transformation, Proceedings of the 1st Balkan Conference in Informatics, 21-23 November 2003, Thessaloniki, Greece, pp. 411-418.

                Manev, Kr., On the Covering Radius of RM(1,n) for odd n, Proceedings of the Fifth International Workshop “Optimal Codes and Related Topics”, White Lagoon, Bulgaria, 2007, pp. 173-177.

                Bakoev, V., Kr. Manev, Fast computing of the positive polarity Reed-Muller transform over GF(2) and GF(3). Proceedings of the IX International Workshop “Algebraic and Combinatorial Coding Theory”, Pamporovo, Bulgaria, 2008, pp. 13-21.

                Manev, Kr., N. NIkolov, M. Markov. Reconstruction of Trees Using Metric Properties. Olympiads in Informatics, vol. 5, 2011, pp. 82–91.

http://www.mii.lt/olympiads_in_informatics/pdf/INFOL068.pdf

                Markov, M., M. I. Andreica, Kr. Manev, N Ţăpuş, A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs, Serdica J. Computing, 6 (2012), pp. 287-298.

                Markov M., T. Vassilev, Kr. Manev, A Linear Time Algorithm for Computing Longest Paths in 2-Tree, accepted for publication in Ars Combinatoria, 112(2013), pp. 329-352.

http://www.combinatorialmath.ca/arscombinatoria/vol112.html

                Markov M., Kr. Manev, Algorithmic Results on a Novel Computational Problem, Olympiads in Informatics, 2013, Vol. 7, 61–77.  http://www.mii.lt/olympiads_in_informatics/

 

II Формални методи в софтуерното инженерство

                Manev, Kr.,  A. Zhelyazkov, St. Boychev. Implementation of an Object-Oriented Test Data Generator, in Proceedings of the International Conference one-Learning and the Knwledge Society e-Learning’10, Riga, 2010,  pp. 231-236.

                Manev, Kr.,  A. Zhelyazkov, St. Boychev. Generation Of Testing Source Code For Object-Oriented Programs, Proceedings of 40-th Spring Conference of UBM, 2011, pp. 306-313.

http://www.math.bas.bg/smb/2011_PK/tom/index.html

                Maneva, N., Kr. Manev. Extracting Business Rules – Hype or Hope for Software Modernization.  International  Journal “Information Theories & Applications”, vol. 184, 2011, pp. 390-397. http://www.foibg.com/ijita/vol18/ijita-fv18.htm

                Manev, Kr., N. Maneva, H. Haralambiev.  Extracting Business Rules through Static analysis of the Source Code. Proc. of the 41-rd Spring conference of the UBM, 2012, pp. 263-270. http://www.math.bas.bg/smb/2012_PK/tom_2012/index.html

                Manev, K., T. Trifonov. Declarative Semantics of the Program Loops. Proceedings on the Sixth IC ISGT’12, Sofia, June 1-3, 2012, рр. 326-337.

                Manev, Kr., N. Maneva, Using the Source Code for Modernization of a Legacy System, Proceedings of CSECS’13, Fulda-Wurtzburg, July, 2013, pp. 113-118.

                Manev Kr., H. Haralambiev, A. Zhelyazkov,  Parsing “COBOL” programs, Proceedings of ISGT’13, Sofia, June 2013, pp. 281-287. ISSN 1314-4855

                Manev, Kr., N. Maneva,  On Applying Design Pattern Approach to Reengineering COBOL Programs, Proceedings of ICCTIM, Dubai, UAE, 2014, pp. 125-134.

                Manev Kr., N. Maneva, Comparative Analysis of the Languages for Business Rules Specification, Int. Journal "Information Models and Analyses", v. 3, 2, 2014, pp 136-146.

                Manev Kr., N. Maneva, Identifying Software Design Motives by Adaptive Dictionary Coding, Proc. of 10th Annual International Conference CSECS, June, 2014, pp. 175-190. ISSN 1313-8624

                Състезания по програмране

                Manev, Kr., E. Kelevedjiev, St. Kapralov, Programming Contests for School Students in Bulgaria, International Journal “Olympiads in Informatics”, v. 1, Vilnius, 2007, pp. 112-123. ISSN 1822-7732 http://www.mii.lt/olympiads_in_informatics/htm/htm/INFOL010.htm

                Manev, Kr., Tasks on Graphs, International Journal “Olympiads in Informatics”, v. 2, Vilnius, 2008, pp. 90-104. ISSN 1822-7732

                Manev, Kr., M. Sedkov, Tz. Bogdanov, Grading Systems for Competitions in Programming, Invited Speech, Proc. of 38-th Spring Conference of UBM, Borovetz, 2009, стр. 103-116. http://www.math.bas.bg/smb/2009_PK/tom_2009/pdf/103-116.pdf

                Manev, Kr., B. Yovcheva, M. Yankov, P. Petrov, Testing of Programs with Random Generated Test Cases, International Journal “Olympiads in Informatics”, v. 4, Vilnius, 2010, pp. 76-86. ISSN 1822-7732  http://www.mii.lt/olympiads_in_informatics/pdf/INFOL055.pdf

                Manev, Kr., M. Sredkov, P. Armyanov, Software Platform for Teaching Programming with Grading Systems, Доклади на 40-та Пролетна Конференция на СМБ, 2011, Боровец, стр 300-305.  http://www.math.bas.bg/smb/2011_PK/tom/pdf/300-305.pdf

 

Обществена дейност: http://www.mii.lt/olympiads_in_informatics/htm/htm/INFOL010.htm