Никола Иванов Янев

Никола Иванов Янев

Професор
Доктор

Вероятности, операционни изследвания и статистика

Имейл: 
choby@fmi.uni-sofia.bg
Телефон: 
8161-504
Кабинет: 
ФМИ-114

Научни интереси

  • Bioinformatics, sequence-to-structure and structure-to-structure alignment algorithms
  • Integer programming, Combinatorial optimization algorithms
  • Parallel algorithms
  • Habilitation

Научни проекти

  • договор РИЛА 2 /2003-2004 по линия на българо-френско сътрудничество
  • договор РИЛА 3/ 01.01.2007 по линия на българо-френско сътрудничество на тема Предсказване и сравнение на протеинови структури

Преподавателска дейност

  • Математическо оптимиране
  • Теория на графите
  • Целочислена (дискретна) оптимизация
  • Изчислителна биология

Списък с публикации

  1. Rumen Andonov, Nicola Yanev, Noel Malod-Dognin. An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem, Lecture Notes in Computer Science, V 5251/2008,pp 162-173
  2. S. Hanafi, N. Yanev,Tabu search approaches for solving the two-group classification problem, Annals of operations research,
  3. DOI 10.1007/s10479-009-0581-9, 2009. Online link http://www.springerlink.com/content/?k=Nicola+Yanev
  4. V. Poirriez, N.Yanev, R.Andonov,A Hybrid Algorithm for the Unbounded Knapsack Problem, Discrete optimisation,V6,1,feb.2009,pp.110-124.
  5. [book] R. Andonov, G. Collet, J.F. Gibrat, A. Marin, V. Poirriez, N. Yanev, Recent advances in solving the protein threading problem, Grid Computing for Bioinformatics and Computational Biology, edited by E. Talbi and A. Zomaya ), John Wiley&Sons, ISBN 978-0-471-78409-8, 2008.
  6. N. Yanev, P.Veber, R. Andonov and S. Balev, Lagrangian approaches to a class of matching problems,  Computers & mathematics with applications, v 55, 5, 2008, pp 1054-1067
  7. S. Balev, N. Yanev, R. A. Fréville, Andonov,  . A dynamic programming-based reduction procedure for the multidimensional 0-1 knapsack problem, EJOR, V 186, 1, 2008, pp 63-76 ( partially copied in U.Pferschy, H. Kellerer, and D. Pisinger, Knapsack problems, Springer verlag,2004.) 
  8. К. Иванов, Н. Киров,  Н. Янев, Оптимално разпределение на мандатите на партиите за 40. народно събрание по избирателни райони, Математика и математическо образование, 2006, 70-81. [pdf] 
  9. R. Andonov, N. Yanev, D. Lavenier, P. Veber. Dynamic Programming for LR-PCR Segmentation of Bacterium Genoms, Concurrency and Computation: Practice and Experience, 2005, Vol. 17, 1657-1668, Wiley & Sons
  10. N. Yanev, R. Andonov and S. Balev, Hight performance alignment methods for protein threading, Parallel computing for Bioinformatics and Computational Biology, edited by A. Zomaya, 2005, pp. 429-460, Wiley-Interscience H ISBN: 04717118483.
  11. P. Veber, N. Yanev, R. Andonov, V. Poirriez, Optimal protein threading by cost-splitting, Lecture Notes in Bioninformatics, 3692, pp.365-375, 2005.
  12. N. Yanev, R. Andonov. Parallel divide & conquer approach for the protein threading problem, Concurrency and Computation: Practice and Experience, 16,961-974, Wiley & Sons, 2004.
  13. R. Andonov, S. Balev, N. Yanev. Protein threading: from mathematical models to parallel implementations, INFORM Journal of computations, 16, 4, 393-405, Wiley & Sons, 2004.
  14. R. Andonov, N. Yanev, D. Lavenier, P. Veber. Combinatorial approaches for segmenting bacterium genoms, RR   IRISA 1536, 2003.
  15. N. Yanev, R. Andonov. The protein threading problem is in P ?, RR INRIA 4577, Octobre 2002.
  16. R. Andonov,  S. Balev,  S. Rajopadhye,  N. Yanev. Optimal semi-oblique tiling ,IEEE transactions on Parallel & distributed systems, september 2003, V14, 9, pp 944-960.
  17. N. Yanev,  S. Balev. A Combinatorial Approach to the Classification Problem. European Journal of Operational Research, 1999, v. 115, pp ; 339-350
  18. A.. Fréville, S. Balev, R. Andonov,  N. Yanev. A dynamic programming-based reduction procedure for the multidimensional 0-1 knapsack problem, INFORMS Annual Meeting 2001, Miami Beach, FL, USA, November 4-7 2001.(to appear in EJOR), partially copied in U.Pferschy, H. Kellerer, and D. Pisinger, Knapsack problems, Springer verlag,2004.
  19. S. Balev,  R. Andonov,  A. Fréville,   N. Yanev. Résolution du sac à dos multidimentionnel en variables 0-1 par la programmation dynamique, FRANCORO III, troisièmes journées francophones de recherche opérationnelle, Québec, Canada, 9-12 mai 2001.
  20. R. Andonov, S. Rajopadhye, N. Yanev, Optimal Orthogonal Tiling, Euro-Par'98 Parallel Processing, Lecture Notes in Computer Science, n° 1470, 480-490, ACM (1998).
  21. R. Andonov, N. Yanev, n-Dimensional Orthogonal Tile Sizing Problem, Pliska Studies Mathematics, Bulgaria, vol 12, 5-20 (1998).
  22. R. Andonov, N. Yanev, H. Bourzoufi, Three-dimensional orthogonal tile sizing problem : mathematical programming approach, Proceedings of the International Conference on Application Specific Systems, Architectures and Processors - ASAP'97, IEEE Computer Society Press, 1997, 209-218
  23. S. Hanafi, N. Yanev, A. Fréville, A Tabu Approach for Classification Problem, Joint International Meeting EURO XV – INFORMS XXXIV, Barcelona, Spain, July 14-17, 1997.
  24. N. Yanev and R. Andonov, Solving Protein Threading Problem in Parallel, HiCOMB 2003, High Performance Computational Biology, 2003, Nice, France (in conjunction with IPDPS'03, International Parallel and Distributed Processing
  25. N. Yanev,  S. Balev. A Combinatorial Approach to the Classification Problem. European Journal of Operational Research, 1999, v. 115, pp; 339-350
  26. R.  Andonov, S. Balev, S. Rajopadhye et N.Yanev Optimal Semi-oblique Tiling and its Application to Sequence Comparison,  13th ACM Symposium on Parallel Algorithms and Architectures,    (SPAA)}, July 4-6 2001, Greece.
  27. N. Yanev, M. Ivanchev, J. Mitev,Branch and bound method for solving a   combinatorial  optimization problem, Systems and control, N2,1974(bulg.)
  28. N. Yanev, M. Ivanchev, J. Mitev, Branch and  bound algorithms for mixed integer programming   problem,Mathematics and mathematical education (bulgarian), Sunny beach 1974,Bulg.Acad. of Sci,Sofia,1975.
  29. N. Yanev, Structure and algorithms of JINR Information Retrieval  System,Mathematics and mathematical education (bulg), Pernik 1975, Bulg.Acad. of Sci,Sofia,1978.
  30. D.Arnaudov, N. Yanev Record structure and information coding/decoding in JINR   IRS,preprint JINR 11-85555,1975.
  31. N. Yanev, M. Ivanchev, J. Mitev ,Realization of the Branch and Bound method for solving the   general mixed integer programming `problem,USSR Comput. Math. Math. Phys. (1977) (translation from Zh. Vychisl.Mat.Mat.Fiz.Akademiya Nauk SSSR,16,N3,1976.
  32. D.Arnaudov, N. Yanev ,Thesaurus problem in IRS,preprint JINR 10-8784,1975.
  33. D.Arnaudov, N. Yanev ,Data structure in JINR IRS,preprint JINR P10-8901, 1975.
  34. D.Arnaudov, N. Yanev ,Prediction of the relevant documents in an IRS,  JINR P10-9051,1975.
  35. D.Arnaudov, N. Yanev ,Branch & Bound method for file structure synthesis,  JINR  P11-9777,1976.
  36. D.Arnaudov, N. Yanev ,Mixed-integer linear programming in search optimization for a multi-level IRS, Program.Comput. Software 4,1978 (translation from Programmirovanie 1978,N1(Russian).
  37. N. Yanev, V. Sumarokov, M. Ivanchev,Combinatorial analysis of balanced trees with variable branching factor,Program.Comput. Software 3(1977) (translation from Programmirovanie 1977, N4(Russian).
  38. N. Yanev, V. Sumarokov, M. Ivanchev ,Simply connected growing trees,Soviet Phys.,Doklady 22(1977)(translation from Doklady Akad. Nauk SSSR  (Russian),232,1977)
  39. N. Yanev,Application of Integer Programming for data structure optimization,JINR 11-10387, 1977 (dissertation).
  40. N. Yanev,Minimisation of a pseudoboolean maximum function,  Soviet J.Comput. System Sci.(translation from Izv. Akad. Nauk    SSSR Tekhn.Cibernetika,N2,1982(russ) Preprint JINR P11-12336, 1979)
  41. N. Yanev, Solution of a simple plant-location problem,USSR  Comput.Math.Math.Phys.21,N3,1981(translation from Zh. Vychisl. Mat. Mat. Fiz.21,1981(Russ)).
  42. JINR Information Retrieval System, JINR preprint B3 10-1291  (1979).
  43. N. Yanev, Problems and methods of the discrete optimization, Mathematics and mathematical education (bulg) Sunny Beach 1980,Bulg,  Bulg. acad. of Sci,Sofia,1980. (invited paper).
  44. N. Yanev, M. Ivanchev, J. Mitev ,Decomposition approach to the cutting stock problem, Systems and control,N1,1982(Bulg).
  45. N. Yanev, Survey on parallel computing.Part I.,Bulg.Acad.of Sci.,1985.
  46. N. Yanev, Survey on parallel computing. Part II., Bulg. Acad.of Sci., 1986.
  47. N. Yanev, M. Ivanchev, J. Mitev, A problem for location/allocation of reactive power in an electric network, Proceedings of XII summer school "Appl. of the math. in technique", Differ.equat. and appl., 1986(bulg).
  48. N. Yanev, M. Mikrenska, Algorithms for three polynomially solvable cases of the lot-size problem, Mathematics and mathematical education (bulg), Sunny Beach 1985,Bulg.Acad. of Sci,Sofia,1985.
  49. N. Yanev, M. Ivanchev, J. Mitev, Optimum resolving of the overloads in an energy supply system,Digital techniques in simulation, communication and control,Elsivier science publishers,North-Holland, Imacs, 1985.
  50. N. Yanev, A knapsack approach to a given class of distribution problems, proceedings jahrestagung "mathematische optimierung,Selin/ Rugen Humboldt universitat zu Berlin,sektion matematik, 1984", Berlin,1984.
  51. N. Yanev, Dynamic programming parallel algorithm for the 0/1  Knapsack problem, Workshop on Parallel distributed processing,Sofia, 1989,Bulg.Acad. of Sci.
  52. N. Yanev, An efficient solution procedure for the capacitated lot size problem with a special cost function structure, First Balkan conference on Operation research, proceedings, Thessaloniki, Greece,October 1988,1991.
  53. N. Yanev, V. Tcokov, A branch and bound algorithm for the multiple-choice shortest vector problem, Workshop on DSS,22-24 June 1992,Wien
  54. Computer-aided long-range high voltage transmission planning, Second Balkan Conference on Operational.Research,proceedings,Thessaloniki, Greece, October 1993.
  55. N. Yanev, V. Tcokov, An algorithm for minimization of max-linear functions with multiple choice constarints, Proceedings of the 22-nd spring conference of the Union of the Bulgarian mathematicians,Sofia,march 1993,pp.163-172.(bulg)
  56. N. Yanev, S. Balev, A combinatorial approach to the classification problem,preprint 11,may 1995,Institute of mathematics, Bulgarian Academyof Sciences. (submitted to the European Journal of Operation Research)

© Факултет по Математика и Информатика