Personal information

Websites & social links

SDU profile page

Other IDs

Scopus Author ID: 57201652648
Scopus Author ID: 57201652648

Activities

Collapse all

Employment (1)

SDU: N/A, DK

Employment
Source: check_circle
University of Southern Denmark

Works (6)

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

31st Annual European Symposium on Algorithms, ESA 2023
2023-09 | Conference paper | Author
DOI: 10.4230/LIPIcs.ESA.2023.13
SOURCE-WORK-ID:

096a7e06-80d2-4752-a93a-9d64d5517997

EID:

2-s2.0-85173474567

EID:

2-s2.0-85173474567

Part of ISBN: 9783959772952
Contributors: Jørgen Bang-Jensen; Kristine Vitting Klinkby Knudsen; Pranabendu Misra; Saket Saurabh
Source: check_circle
University of Southern Denmark

Strong connectivity augmentation is FPT

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)
2021 | Conference paper | Author
DOI: 10.1137/1.9781611976465.15
SOURCE-WORK-ID:

e10d81a3-691a-4fb3-bd5f-3d969691eb3a

EID:

2-s2.0-85105353325

Part of ISBN: 9781611976465
Contributors: Kristine Vitting Klinkby Knudsen; Pranabendu Misra; Saket Saurabh
Source: check_circle
University of Southern Denmark

K-distinct branchings admits a polynomial kernel

29th Annual European Symposium on Algorithms, ESA 2021
2021-09 | Conference paper | Author
DOI: 10.4230/LIPIcs.ESA.2021.11
SOURCE-WORK-ID:

0ba5547d-7cf7-42fc-a1e7-d16e8a2464de

EID:

2-s2.0-85115097554

Part of ISBN: 9783959772044
Contributors: Jørgen Bang-Jensen; Kristine Vitting Klinkby Knudsen; Saket Saurabh
Source: check_circle
University of Southern Denmark

The Parameterized Complexity of Guarding Almost Convex Polygons.

Symposium on Computational Geometry 2020 (SoCG 2020)
2020 | Conference paper | Author
SOURCE-WORK-ID:

6efccbf7-b0f1-4794-881a-8fa959ce7c90
Contributors: Akanksha Agrawal; Kristine Vitting Klinkby Knudsen; Daniel Lokshtanov; Saket Saurabh; Meirav Zehavi
Source: check_circle
University of Southern Denmark

The parameterized complexity landscape of finding 2-partitions of digraphs

Theoretical Computer Science
2019-11-26 | Journal article | Author
DOI: 10.1016/j.tcs.2019.05.037
SOURCE-WORK-ID:

4620fdef-3fa3-4013-afd3-68abb805dddf

EID:

2-s2.0-85068543239
Contributors: Jørgen Bang-Jensen; Kristine Vitting Klinkby Knudsen; Saket Saurabh; Meirav Zehavi
Source: check_circle
University of Southern Denmark

Parameterized Algorithms for Survivable Network Design with Uniform Demands

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
2018 | Conference paper | Author
DOI: 10.1137/1.9781611975031.180
SOURCE-WORK-ID:

d8adbb94-2e9e-4ad5-afe5-15003d0ab663

EID:

2-s2.0-85045548969

Part of ISBN: 978-1-61197-503-1
Contributors: Jørgen Bang-Jensen; Kristine Vitting Klinkby Knudsen; Saket Saurabh; Manu Basavaraju; Pranabendu Misra; Meirav Zehavi; M.S. Ramanujan
Source: check_circle
University of Southern Denmark

Peer review (1 review for 1 publication/grant)

Review activity for Theory of computing systems. (1)
How many people are using ORCID?