Author of the publication

Fast Exact Algorithms for Survivable Network Design with Uniform Requirements.

, , , and . Algorithmica, 84 (9): 2622-2641 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Popular Matching in Roommates Setting is NP-hard., , , and . CoRR, (2018)Faster Parameterized Algorithms for Deletion to Split Graphs., , , , , , and . Algorithmica, 71 (4): 989-1006 (2015)Linear Representation of Transversal Matroids and Gammoids Parameterized by Rank., , , and . COCOON, volume 10392 of Lecture Notes in Computer Science, page 420-432. Springer, (2017)Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number., , , and . Algorithmica, 85 (7): 2065-2086 (July 2023)A single exponential-time FPT algorithm for cactus contraction., , and . Theor. Comput. Sci., (2023)Reducing rank of the adjacency matrix by graph modification., , and . Theor. Comput. Sci., (2016)2-Approximating Feedback Vertex Set in Tournaments., , , , , and . ACM Trans. Algorithms, 17 (2): 11:1-11:14 (2021)Interval Vertex Deletion Admits a Polynomial Kernel., , , and . SODA, page 1711-1730. SIAM, (2019)Popular Matching in Roommates Setting is NP-hard., , , and . SODA, page 2810-2822. SIAM, (2019)Strong Connectivity Augmentation is FPT., , and . SODA, page 219-234. SIAM, (2021)