1. On the differential equivalence of APN functions

    Gorodilova, A., 15 Jul 2019, In: Cryptography and Communications. 11, 4, p. 793-813 21 p.

    Research output: Contribution to journalArticlepeer-review

  2. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer Gabler, p. 127-136 10 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  3. On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., 1 Jan 2019, In: Doklady Mathematics. 99, 1, p. 52-56 5 p.

    Research output: Contribution to journalArticlepeer-review

  4. On the Complexity of SomeMax-Min Clustering Problems

    Kel'manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Aug 2020, In: Proceedings of the Steklov Institute of Mathematics. 309, SUPPL 1, p. S65-S73 9 p.

    Research output: Contribution to journalArticlepeer-review

  5. On some implementations of solving the resource constrained project scheduling problems

    Gimadi, E. K., Goncharov, E. N. & Mishin, D. V., 1 Jan 2019, In: Yugoslav Journal of Operations Research. 29, 1, p. 31-42 12 p.

    Research output: Contribution to journalArticlepeer-review

  6. On some finite set clustering problems in euclidean space

    Kel'Manov, A. & Pyatkin, A., 1 Jan 2017, In: CEUR Workshop Proceedings. 1987, p. 310-315 6 p.

    Research output: Contribution to journalConference articlepeer-review

  7. On some euclidean clustering problems: Np-hardness and efficient approximation algorithms

    Kel'manov, A., 2017, In: CEUR Workshop Proceedings. 1987, p. 291-297 7 p.

    Research output: Contribution to journalArticlepeer-review

  8. On Some Efficiently Solvable Classes of the Network Facility Location Problem with Constraints on the Capacities of Communication Lines

    Gimadi, E. K. & Tsidulko, O. Y., Aug 2021, In: Proceedings of the Steklov Institute of Mathematics. 313, SUPPL 1, p. S58-S72 15 p.

    Research output: Contribution to journalArticlepeer-review

  9. On Several Edge-Disjoint MSTs with Given Diameter in Undirected Graph with Exponentially Distributed Edge Weights

    Gimadi, E. K., Shevyakov, A. S. & Shtepa, A. A., 2022, Recent Trends in Analysis of Images, Social Networks and Texts - 10th International Conference, AIST 2021, Revised Selected Papers. Burnaev, E., Ivanov, S., Panchenko, A., Ignatov, D. I., Kuznetsov, S. O., Khachay, M., Koltsova, O., Kutuzov, A., Loukachevitch, N., Napoli, A., Pardalos, P. M., Saramäki, J., Savchenko, A. V., Tsymbalov, E. & Tutubalina, E. (eds.). Springer Science and Business Media Deutschland GmbH, p. 195-206 12 p. (Communications in Computer and Information Science; vol. 1573 CCIS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  10. On Semi-Transitive Orientability of Triangle-Free Graphs

    Kitaev, S. & Pyatkin, A., 2021, In: Discussiones Mathematicae - Graph Theory.

    Research output: Contribution to journalArticlepeer-review

Previous 1...8 9 10 11 12 13 14 15 ...33 Next

ID: 3086997