1. 2020
  2. 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 journalArticlepeer-review

  3. Problem of Minimizing a Sum of Differences of Weighted Convolutions

    Kel’manov, A. V., Mikhailova, L. V., Ruzankin, P. S. & Khamidullin, S. A., Dec 2020, In: Computational Mathematics and Mathematical Physics. 60, 12, p. 1951-1963 13 p.

    Research output: Contribution to journalArticlepeer-review

  4. Optimal-size problem kernels for d-Hitting Set in linear time and space

    van Bevern, R. & Smirnov, P. V., 1 Nov 2020, In: Information Processing Letters. 163, 9 p., 105998.

    Research output: Contribution to journalArticlepeer-review

  5. A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem

    van Bevern, R. & Slugina, V. A., Nov 2020, In: Historia Mathematica. 53, p. 118-127 10 p.

    Research output: Contribution to journalArticlepeer-review

  6. The complexity of AND—decomposition of Boolean functions

    Emelyanov, P. & Ponomaryov, D., 15 Jun 2020, In: Discrete Applied Mathematics. 280, p. 113-132 20 p.

    Research output: Contribution to journalArticlepeer-review

  7. The Fifth International Students' Olympiad in cryptography - NSUCRYPTO: Problems and their solutions

    Gorodilova, A., Agievich, S., Carlet, C., Hou, X., Idrisova, V., Kolomeec, N., Kutsenko, A., Mariot, L., Oblaukhov, A., Picek, S., Preneel, B., Rosie, R. & Tokareva, N., 3 May 2020, In: Cryptologia. 44, 3, p. 223-256 25 p.

    Research output: Contribution to journalArticlepeer-review

  8. A special three-level optimization problem

    Dempe, S., Khamisov, O. & Kochetov, Y., 1 Mar 2020, In: Journal of Global Optimization. 76, 3, p. 519-531 13 p.

    Research output: Contribution to journalArticlepeer-review

  9. Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Mar 2020, In: Annals of Mathematics and Artificial Intelligence. 88, 1-3, p. 157-168 12 p.

    Research output: Contribution to journalArticlepeer-review

  10. Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs

    Gimadi, E. K. & Tsidulko, O., 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. 201-207 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 proceedingConference contributionResearchpeer-review

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

ID: 3087360