Kristine V. K. Knudsen

According to our database, Kristine V. K. Knudsen authored at least 6 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

The Parameterized Complexity of Guarding Almost Convex Polygons.

Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi

Discret. Comput. Geom., March, 2024

2023

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands.

Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2021

Strong Connectivity Augmentation is FPT.

Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

k-Distinct Branchings Admits a Polynomial Kernel.

Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2019

The parameterized complexity landscape of finding 2-partitions of digraphs.

Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2019

2018

Parameterized Algorithms for Survivable Network Design with Uniform Demands.

Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018