1 - 4 out of 4Page size: 10
  1. 2026

  2. Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective

    Fomin, F. V., Golovach, P. A., Jedličková, N., Kratochvíl, J., Sagunov, D. & Simonov, K., 9 Jun 2026, p. 276-285.

    Research output: Contribution to conference › Paper › peer-review

  3. 2025

  4. Edge Clique Partition and Cover Beyond Independence

    Сагунов, Д. Г., Фомин, Ф., Головач, П. & Симонов, К., 1 Oct 2025, 33rd Annual European Symposium on Algorithms (ESA 2025). 16 p. 43. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 351).

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

  5. 2024

  6. Fair division with minimal withheld information in social networks

    Bliznets, I., Bukov, A. & Sagunov, D., 12 Apr 2024, In: Theoretical Computer Science. 991, 114446.

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

  7. 2019

  8. On Happy Colorings, Cuts, and Structural Parameterizations

    Bliznets, I. & Sagunov, D., 1 Jan 2019, Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers. Sau, I. & Thilikos, D. M. (eds.). Springer Nature, p. 148-161 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11789 LNCS).

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

ID: 45822687