51 - 60 out of 103Page size: 10
Sort by: Title

  1. On an algorithm generating 2-to-1 APN functions and its applications to “the big APN problem”

    Idrisova, V., 1 Jan 2019, In: Cryptography and Communications. 11, 1, p. 21-39 19 p.

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

  2. On a Polytime Factorization Algorithm for Multilinear Polynomials over F2

    Emelyanov, P. & Ponomaryov, D., 1 Jan 2018, Computer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Proceedings. Gerdt, VP., Koepf, W., Seiler, WM. & Vorozhtsov, EV. (eds.). Springer-Verlag GmbH and Co. KG, p. 164-176 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11077 LNCS).

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

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

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

  5. On modification of an asymptotically optimal algorithm for the maximum Euclidean traveling salesman problem

    Gimadi, E. K. & Tsidulko, O. Y., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers. Springer-Verlag GmbH and Co. KG, p. 283-293 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11179 LNCS).

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

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

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

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

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

  10. On termination of transactions over semantic document models

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2020, In: Bulletin of Irkutsk State University, Series Mathematics. 31, p. 111-131 21 p.

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

Previous 12 3 4 5 6 7 8 9 ...11 Next

ID: 3087360