131 - 140 out of 357Page size: 10
Sort by: Title

  1. Fast and exact algorithms for some NP-hard 2-clustering problems in the one-dimensional case

    Kel’manov, A. & Khandeev, V., 1 Jan 2019, Analysis of Images, Social Networks and Texts - 8th International Conference, AIST 2019, Revised Selected Papers. van der Aalst, W. M. P., Batagelj, V., Ignatov, D. I., Kuskova, V., Kuznetsov, S. O., Lomazova, I. A., Khachay, M., Kutuzov, A., Loukachevitch, N., Napoli, A., Pardalos, P. M., Pelillo, M., Savchenko, A. V. & Tutubalina, E. (eds.). Springer International Publishing AG, p. 377-387 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11832 LNCS).

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

  2. Fast approximation algorithms for some maximin clustering problems

    Khandeev, V. & Neshchadim, S., 2024, In: Yugoslav Journal of Operations Research. 34, 2, p. 337-353 17 p., 7.

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

  3. Finding secluded places of special interest in graphs

    Van Bevern, R., Fluschnik, T., Mertzios, G. B., Molter, H., Sorge, M. & Suchý, O., 1 Feb 2017, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 63. 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 63).

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

  4. Fixed-parameter algorithms for DAG Partitioning

    van Bevern, R., Bredereck, R., Chopin, M., Hartung, S., Hüffner, F., Nichterlein, A. & Suchý, O., 31 Mar 2017, In: Discrete Applied Mathematics. 220, p. 134-160 27 p.

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

  5. Generalised dual Seidel switching and Deza graphs with strongly regular children

    Kabanov, V. V., Konstantinova, E. V. & Shalaginov, L., Mar 2021, In: Discrete Mathematics. 344, 3, 7 p., 112238.

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

  6. Genetic algorithm for the resource-constrained project scheduling problem

    Goncharov, E. N. & Leonov, V. V., 1 Jun 2017, In: Automation and Remote Control. 78, 6, p. 1101-1114 14 p.

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

  7. Genetic local search and hardness of approximation for the server load balancing problem

    Kochetov, Y. A., Panin, A. A. & Plyasunov, A. V., 1 Mar 2017, In: Automation and Remote Control. 78, 3, p. 425-434 10 p.

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

  8. Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks

    Plotnikov, R., Erzin, A. & Zalyubovskiy, V., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer, p. 216-231 16 p. (Communications in Computer and Information Science; vol. 974).

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

  9. GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN

    Plotnikov, R., Erzin, A. & Zalyubovskiy, V., 2021, In: Optimization Methods and Software. 36, 4, p. 697-719 23 p.

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

  10. Greedy cycles in the star graphs

    Gostevsky, D. A. & Konstantinova, E. V., 1 Jan 2018, In: Сибирские электронные математические известия. 15, p. 205-213 9 p.

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

Previous 1...10 11 12 13 14 15 16 17 ...36 Next

ID: 3086997