221 - 230 out of 357Page size: 10
Sort by: Title

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

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

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

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

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

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

  7. 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 journal › Conference article › peer-review

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

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

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

Previous 1...19 20 21 22 23 24 25 26 ...36 Next

ID: 3086997