181 - 190 out of 352Page size: 10
Sort by: Title

  1. NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points

    Kel’manov, A. V. & Pyatkin, A. V., 1 May 2018, In: Computational Mathematics and Mathematical Physics. 58, 5, p. 822-826 5 p.

    Research output: Contribution to journal › Article › peer-review

  2. NP-hardness of some max-min clustering problems

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer, p. 144-154 11 p. (Communications in Computer and Information Science; vol. 974).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  3. On (1,l)-coloring of incidentors of multigraphs

    Golovachev, M. O. & Pyatkin, A. V., 1 Oct 2017, In: Journal of Applied and Industrial Mathematics. 11, 4, p. 514-520 7 p.

    Research output: Contribution to journal › Article › peer-review

  4. On additive differential probabilities of the composition of bitwise exclusive-or and a bit rotation

    Kolomeec, N., Sutormin, I., Bykov, D., Panferov, M. & Bonich, T., 15 Jan 2025, In: Cryptography and Communications.

    Research output: Contribution to journal › Article › peer-review

  5. On a list (k, l)-coloring of incidentors in multigraphs of even degree for some values of k and l

    Pyatkin, A. V. E., 20 May 2019, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 25, 2, p. 177-184 8 p.

    Research output: Contribution to journal › Article › peer-review

  6. On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class

    Bykov, D. A. & Kolomeec, N. A., Sept 2023, In: Journal of Applied and Industrial Mathematics. 17, 3, p. 507-520 14 p.

    Research output: Contribution to journal › Article › peer-review

  7. On approximate data reduction for the Rural Postman Problem: Theory and experiments

    van Bevern, R., Fluschnik, T. & Tsidulko, O. Y., 1 Dec 2020, In: Networks. 76, 4, p. 485-508 24 p., e21985.

    Research output: Contribution to journal › Article › peer-review

  8. On a problem of choosing elements in a family of sequences

    Kel'manov, A., Mikhailova, L. & Romanchenko, S., 1 Jan 2018, In: CEUR Workshop Proceedings. 2098, p. 181-188 8 p.

    Research output: Contribution to journal › Conference article › peer-review

  9. On a problem of summing elements chosen from the family of finite numerical sequences

    Kel’manov, A., Mikhailova, L. & Romanchenko, S., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers. Panchenko, A., van der Aalst, W. M., Khachay, M., Pardalos, P. M., Batagelj, V., Loukachevitch, N., Glavaš, G., Ignatov, D. I., Kuznetsov, S. O., Koltsova, O., Lomazova, I. A., Savchenko, A. V., Napoli, A. & Pelillo, M. (eds.). Springer, p. 305-317 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11179 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. On a Routing Open Shop Problem on Two Nodes with Unit Processing Times

    Golovachev, M. O. & Pyatkin, A. V., 1 Aug 2020, In: Journal of Applied and Industrial Mathematics. 14, 3, p. 470-479 10 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1...15 16 17 18 19 20 21 22 ...36 Next

ID: 3086997