|
|
|
Publications in Math-Net.Ru |
Citations |
|
2017 |
| 1. |
A. V. Kelmanov, S. M. Romanchenko, S. A. Khamidullin, “An approximation scheme for a problem of finding a subsequence”, Sib. Zh. Vychisl. Mat., 20:4 (2017), 379–392   ; Num. Anal. Appl., 10:4 (2017), 313–323   |
5
|
|
2014 |
| 2. |
A. V. Kel'manov, S. M. Romanchenko, “FPTAS for solving a problem of search for a vector subset”, Diskretn. Anal. Issled. Oper., 21:3 (2014), 41–52  ; J. Appl. Industr. Math., 8:3 (2014), 329–336 |
34
|
|
2013 |
| 3. |
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов”, Zh. Vychisl. Mat. Mat. Fiz., 53:1 (2013), 143–153 |
6
|
|
2012 |
| 4. |
A. V. Kel'manov, S. M. Romanchenko, “Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems”, Avtomat. i Telemekh., 2012, no. 2, 156–162 ; Autom. Remote Control, 73:2 (2012), 349–354 |
21
|
| 5. |
A. V. Kel'manov, S. M. Romanchenko, S. A. Khamidullin, “Approximation algorithms for some NP-hard problems of searching a vectors subsequence”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 27–38 ; J. Appl. Industr. Math., 6:4 (2012), 443–450 |
9
|
|
2011 |
| 6. |
A. V. Kel'manov, S. M. Romanchenko, “The approximation algorithm for one problem of searching for subset of vectors”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 61–69  ; J. Appl. Industr. Math., 6:1 (2012), 90–96 |
32
|
|
| Organisations |
|
| |
|
|
Contact us: