1. 2022
  2. Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments

    Bentert, M., van Bevern, R., Nichterlein, A., Niedermeier, R. & Smirnov, P. V., Jan 2022, In: Informs journal on computing. 34, 1, p. 55-75 21 p.

    Research output: Contribution to journalArticlepeer-review

  3. 2021
  4. On the Relationship Between the Complexity of Decidability and Decomposability of First-Order Theories

    Ponomaryov, D., Dec 2021, In: Lobachevskii Journal of Mathematics. 42, 12, p. 2905-2912 8 p., 24.

    Research output: Contribution to journalArticlepeer-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. S58-S72 15 p.

    Research output: Contribution to journalArticlepeer-review

  6. Representative families for matroid intersections, with applications to location, packing, and covering problems

    van Bevern, R., Tsidulko, O. Y. & Zschoche, P., 31 Jul 2021, In: Discrete Applied Mathematics. 298, p. 110-128 19 p.

    Research output: Contribution to journalArticlepeer-review

  7. Recognition of a Quasi-Periodic Sequence Containing an Unknown Number of Nonlinearly Extended Reference Subsequences

    Kel’manov, A. V., Mikhailova, L. V., Ruzankin, P. S. & Khamidullin, S. A., Jul 2021, In: Computational Mathematics and Mathematical Physics. 61, 7, p. 1153-1161 9 p.

    Research output: Contribution to journalArticlepeer-review

  8. Special Issue on Computer Science Symposium in Russia (2019)

    van Bevern, R. & Kucherov, G., Apr 2021, In: Theory of Computing Systems. 65, 3, p. 441-443 3 p.

    Research output: Contribution to journalEditorialpeer-review

  9. Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation

    Emelyanov, P. G., Krishna, M., Kulkarni, V., Nandy, S. K., Ponomaryov, D. K. & Raha, S., Mar 2021, In: Programming and Computer Software. 47, 2, p. 108-118 11 p.

    Research output: Contribution to journalArticlepeer-review

  10. 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 journalArticlepeer-review

  11. 2020
  12. Очистка шаров для редукции данных с гарантированной сохранностью приближенных решений задач оптимизации на графах с метрическими весами ребер

    van Bevern, R., 29 Dec 2020, Новосибирский государственный университет, Patent No. 38, Priority date 28 Dec 2020

    Research output: PatentKnow-how registration

  13. H-index manipulation by undoing merges

    van Bevern, R., Komusiewicz, C., Molter, H., Niedermeier, R., Sorge, M. & Walsh, T., 1 Dec 2020, In: Quantitative Science Studies. 1, 4, p. 1529-1552 24 p.

    Research output: Contribution to journalArticlepeer-review

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

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

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

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

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

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

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

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

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

ID: 3087360