331 - 340 out of 352Page size: 10
  1. 2017

  2. On list incidentor (k, l)-coloring

    Vasil’eva, E. I. & Pyatkin, A. V., 1 Jan 2017, In: Journal of Applied and Industrial Mathematics. 11, 1, p. 125-129 5 p.

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

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

  4. Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets

    Galashov, A. E. & Kel’manov, A. V., 1 Jan 2017, In: Numerical Analysis and Applications. 10, 1, p. 11-16 6 p.

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

  5. Algorithms with performance guarantee for a weighted 2-partition problem

    Kel'Manov, A. & Motkova, A., 2017, In: CEUR Workshop Proceedings. 1987, p. 304-309 6 p.

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

  6. Algorithms with performance guarantee for some quadratic euclidean problems of 2-partitioning a set and a sequence

    Kel'Manov, A. & Khandeev, V., 2017, In: CEUR Workshop Proceedings. 1987, p. 298-303 6 p.

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

  7. Conflict-free data aggregation on a square grid when transmission distance is not less than 3

    Erzin, A. & Plotnikov, R., 2017, Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Revised Selected Papers. Springer, Vol. 10718 LNCS. p. 141-154 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10718 LNCS).

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

  8. Efficient algorithm for the convergecast scheduling problem on a square grid with obstacles

    Erzin, A. I. & Plotnikov, R. V., 2017, In: CEUR Workshop Proceedings. 1987, p. 187-193 7 p.

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

  9. Implementation of asymptotically optimal approach to solving some hard combinatorial problems

    Gimadi, E. K., 2017, In: CEUR Workshop Proceedings. 1987, p. 201-208 8 p.

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

  10. On exact solvability of the restricted capacitated facility location problem

    Gimadi, E. K., Kurochkina, A. & Tsidulko, O., 2017, In: CEUR Workshop Proceedings. 1987, p. 209-216 8 p.

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

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

Previous 1...30 31 32 33 34 35 36 Next

ID: 3086997