Research Output per year
Research Output per year
Organization profile
Profile Information
The Algorithmics Laboratory analyzes the algorithmic complexity and designs algorithms for computational problems in the fields of the analysis of biological, transportation and communication networks, artificial intelligence, data analysis, pattern recognition, optimization of logistics, scheduling, routing. Research concentrates on algorithms with provable performance bounds and on data reduction algorithms. The laboratory experimentally evaluates algorithmes and tunes them towards data occurring in applications (algorithm engineering)
Strategic academic units
- Informational and Humanitarian Technologies of Knowledge Presentation in Educational Systems
Fingerprint
Dive into the research topics where Algorithmics Laboratory is active. These topic labels come from the works of this organisation's members. Together they form a unique fingerprint.
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Profiles
-
Denis Konstantinovich Ponomarev
- Department of Mechanics and Mathematics, Programming Section - Senior Lecturer
- Department of Mechanics and Mathematics, Algorithmics Laboratory - Senior Researcher
Person: Research, Academic
-
Oksana Yurevna Tsidulko
- Department of Information Technologies, Informatics Systems Section - Assistant Lecturer
- Department of Mechanics and Mathematics, Algorithmics Laboratory - Associate researcher
Person: Research, Academic
-
Rene Andreasovich van Bevern
- Department of Mechanics and Mathematics, Algorithmics Laboratory - Head of Laboratory
- Department of Mechanics and Mathematics, Theoretical Cybernetics Section - Senior Lecturer
Person: Research, Academic
Research Output
-
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence
Kel’manov, A., Khamidullin, S. & Panasenko, A., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 386-393 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
1 Citation (Scopus) -
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
van Bevern, R. & Slugina, V. A., Nov 2020, In : Historia Mathematica. 53, p. 118-127 10 p.Research output: Contribution to journal › Article › peer-review
3 Citations (Scopus) -
A special three-level optimization problem
Dempe, S., Khamisov, O. & Kochetov, Y., 1 Mar 2020, In : Journal of Global Optimization. 76, 3, p. 519-531 13 p.Research output: Contribution to journal › Article › peer-review
Prizes
Press / Media
-
Ученые НГУ исследовали историю открытия известного алгоритма для задачи коммивояжера
Рене Андреасович ван Беверн & Виктория Александровна Слугина
29.05.2020 → 01.06.2020
2 items of Media coverage, 1 Media contribution
Press/Media: Press / Media
-
«Лето информатики в России» прошло в НГУ
Денис Константинович Пономарев
11.07.2019
1 item of Media coverage
Press/Media: Press / Media
-
НГУ выступит в качестве площадки «Лета информатики в России»
26.06.2019
1 Media contribution
Press/Media: Press / Media
Student theses
-
Approximation Algorithm For The Maximum k-Edge-Colored Problem
Author: Алхамдан, Ю. М. С., 30 Jun 2018Supervisor: Кононов, А. В. (Supervisor)
Student thesis: Master's Thesis
-
Exact methods for the unit commitment problem / Точные методы выбора состава электрогенерирующего оборудования
Author: Махаммад, И. Б. Н., 30 Jun 2018Supervisor: Кочетов, Ю. А. (Supervisor)
Student thesis: Master's Thesis
-
On isometric mappings of the set of bent functions / Об изометрических отображениях множества бент функций
Author: Куценко, А. В., 30 Jun 2018Supervisor: Токарева, Н. Н. (Supervisor)
Student thesis: Master's Thesis