151 - 160 out of 328Page size: 10
Sort by: Title

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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-Verlag GmbH and Co. KG, 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

  7. 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

  8. NP-Hardness of Some Data Cleaning Problem

    Kutnenko, O. A. & Plyasunov, A. V., Apr 2021, In: Journal of Applied and Industrial Mathematics. 15, 2, p. 285-291 7 p.

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

  9. NP-hardness of quadratic euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Nov 2019, In: Doklady Mathematics. 100, 3, p. 545-548 4 p.

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

  10. NP-Hardness of balanced minimum sum-of-squares clustering

    Pyatkin, A., Aloise, D. & Mladenović, N., 1 Oct 2017, In: Pattern Recognition Letters. 97, p. 44-45 2 p.

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

Previous 1...12 13 14 15 16 17 18 19 ...33 Next

ID: 3086997