Home
Kristine Vitting Klinkby Knudsen's picture

Kristine Vitting Klinkby Knudsen

PhD Candidate
Academic article
  • Show author(s) 2021. Strong Connectivity Augmentation is FPT. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 16 pages.
  • Show author(s) 2020. The Parameterized Complexity of Guarding Almost Convex Polygons. Leibniz International Proceedings in Informatics. 3:1-3:16.
  • Show author(s) 2019. The parameterized complexity landscape of finding 2-partitions of digraphs. Theoretical Computer Science. 108-114.

More information in national current research information system (CRIStin)