Parameterized Algorithms for Survivable Network Design with Uniform Demands. - Jørgen Bang-Jensen; Manu Basavaraju; Kristine Vitting Klinkby; Pranabendu Misra; M. S. Ramanujan 001; Saket Saurabh 001; Meirav Zehavi (SODA, 2018)

The parameterized complexity landscape of finding 2-partitions of digraphs. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2019)

k-Distinct Branchings Admits a Polynomial Kernel. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Saket Saurabh 001 (ESA, 2021)

Strong Connectivity Augmentation is FPT. - Kristine Vitting Klinkby; Pranabendu Misra; Saket Saurabh 001 (SODA, 2021)

A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. - Jørgen Bang-Jensen; Kristine Vitting Klinkby; Pranabendu Misra; Saket Saurabh 001 (ESA, 2023)

The Parameterized Complexity of Guarding Almost Convex Polygons. - Akanksha Agrawal 001; Kristine V. K. Knudsen; Daniel Lokshtanov; Saket Saurabh 001; Meirav Zehavi (Discret. Comput. Geom., 2024)