41 - 50 out of 352Page size: 10
Sort by: Title

  1. The seventh International Olympiad in Cryptography: problems and solutions

    Gorodilova, A. A., Tokareva, N. N., Agievich, S. V., Carlet, C., Idrisova, V. A., Kalgin, K. V., Kolegov, D. N., Kutsenko, A. V., Mouha, N., Pudovkina, M. A. & Udovenko, A. N., 2021, In: Siberian Electronic Mathematical Reports. 18, 2, p. 4-29 26 p., 26.

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

  2. The sequence reconstruction problem for permutations with the Hamming distance

    Wang, X. & Konstantinova, E. V., Sept 2024, In: Cryptography and Communications. 16, 5, p. 1033-1057 25 p.

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

  3. The sequence reconstruction of permutations with Hamming metric

    Wang, X., Fu, F-W. & Konstantinova, E. V., Jan 2025, In: Designs, Codes, and Cryptography. 93, p. 11-37 27 p.

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

  4. The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph

    Gimadi, E. K. & Shtepa, A. A., 2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, p. 341-348 8 p. 24. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14486 LNCS).

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

  5. The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

    Kel’manov, A. & Khandeev, V., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Bykadorov, I., Strusevich, V. & Tchemisova, T. (eds.). Springer International Publishing AG, p. 207-216 10 p. (Communications in Computer and Information Science; vol. 1090 CCIS).

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

  6. The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs

    van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M. & Suchý, O., 1 Nov 2018, In: Discrete Optimization. 30, p. 20-50 31 p.

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

  7. The maximum number of induced open triangles in graphs of a given order

    Pyatkin, A., Lykhovyd, E. & Butenko, S., 1 Nov 2019, In: Optimization Letters. 13, 8, p. 1927-1935 9 p.

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

  8. The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable

    Afanasev, V. A., van Bevern, R. & Tsidulko, O. Y., Mar 2021, In: Operations Research Letters. 49, 2, p. 270-277 8 p.

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

  9. The group of automorphisms of the set of self-dual bent functions

    Kutsenko, A., 1 Sept 2020, In: Cryptography and Communications. 12, 5, p. 881-898 18 p.

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

  10. The graph of minimal distances of bent functions and its properties

    Kolomeec, N., 1 Dec 2017, In: Designs, Codes, and Cryptography. 85, 3, p. 395-410 16 p.

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

Previous 1 2 3 4 5 6 7 8 ...36 Next

ID: 3086997