|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
V. V. Vasilchikov, “Recursive-parallel algorithm for solving the maximum common subgraph problem”, Model. Anal. Inform. Sist., 30:2 (2023), 128–139  |
|
2022 |
| 2. |
V. V. Vasilchikov, “Recursive-parallel algorithm for solving the graph-subgraph isomorphism problem”, Model. Anal. Inform. Sist., 29:1 (2022), 30–43  |
1
|
|
2020 |
| 3. |
V. V. Vasilchikov, “Parallel algorithm for solving the graph isomorphism problem”, Model. Anal. Inform. Sist., 27:1 (2020), 86–94 |
2
|
|
2018 |
| 4. |
V. V. Vasilchikov, “On à recursive-parallel algorithm for solving the Knapsack Problem”, Model. Anal. Inform. Sist., 25:2 (2018), 155–164  |
1
|
|
2016 |
| 5. |
V. V. Vasilchikov, “On the optimization and parallelizing Little algorithm for solving the Traveling Salesman Problem”, Model. Anal. Inform. Sist., 23:4 (2016), 401–411 |
2
|
|
2014 |
| 6. |
V. V. Vasilchikov, “On the Recursive-Parallel Programming for the .NET Framework”, Model. Anal. Inform. Sist., 21:2 (2014), 15–25 |
2
|
|
2008 |
| 7. |
V. V. Vasilchikov, “The recursive parallel programming shell for Win32”, Model. Anal. Inform. Sist., 15:1 (2008), 41–44 |
| 8. |
V. V. Vasilchikov, A. V. Shubin, “The library for parallel execution of rpC-programs under Win32”, Model. Anal. Inform. Sist., 15:1 (2008), 37–40 |
1
|
|
|
|
2021 |
| 9. |
V. V. Vasil'chikov, “Corrigendum to: V. V. Vasilchikov, “Parallel algorithm for solving the graph isomorphism problem”, Modeling and analysis of information systems, vol. 27, no. 1, pp. 86-94, 2020. doi: https://doi.org/10.18255/1818-1015-2020-1-86-94”, Model. Anal. Inform. Sist., 28:3 (2021), 312–313 |
|
| Organisations |
|
| |
|
|
Contact us: