131 - 140 out of 354Page size: 10
Sort by: Title

  1. 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 journal › Article › peer-review

  2. 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. 58-72 15 p.

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

  3. 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, p. 195-206 12 p. (Communications in Computer and Information Science; vol. 1573 CCIS).

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

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

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

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

  5. On semi-transitive orientability of split graphs

    Kitaev, S. & Pyatkin, A., Feb 2024, In: Information Processing Letters. 184, 4 p., 106435.

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

  6. On reconstruction of eigenfunctions of Johnson graphs

    Vorob'ev, K., 15 Apr 2020, In: Discrete Applied Mathematics. 276, p. 166-171 6 p.

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

  7. On PTAS for the Geometric Maximum Connected k-Factor Problem

    Gimadi, E., Rykov, I. & Tsidulko, O., 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. 194-205 12 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

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

  8. On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

    Kel’manov, A. & Khandeev, V., 22 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Gabler, p. 46-52 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11968 LNCS).

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

  9. On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

    Kel’manov, A. V. & Khandeev, V. I., 1 Jul 2019, In: Doklady Mathematics. 100, 1, p. 339-342 4 p.

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

  10. On path energy of graphs

    Akbari, S., Ghodrati, A. H., Gutman, I., Hosseinzadeh, M. A. & Konstantinova, E. V., 1 Jan 2019, In: Match. 81, 2, p. 465-470 6 p.

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

Previous 1...10 11 12 13 14 15 16 17 ...36 Next

ID: 3086997