Author of the publication

Parameterized Complexity of Min-Power Asymmetric Connectivity.

, , , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 85-96. Springer, (2019)

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

Binary Matrix Completion Under Diameter Constraints., , and . STACS, volume 187 of LIPIcs, page 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parameterized Algorithms for Colored Clustering., , , and . AAAI, page 4400-4408. AAAI Press, (2023)Determinantal Sieving., , and . SODA, page 377-423. SIAM, (2024)The Complexity of Finding Fair Many-to-One Matchings., and . ACM Trans. Algorithms, 20 (2): 17 (April 2024)Parameterized Complexity of Geodetic Set., and . IPEC, volume 180 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges., , , and . MFCS, volume 272 of LIPIcs, page 46:1-46:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Complexity of Combinatorial Matrix Completion With Diameter Constraints., , and . CoRR, (2020)The Complexity of Finding Fair Many-To-One Matchings., and . ICALP, volume 229 of LIPIcs, page 27:1-27:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Exploiting c-Closure in Kernelization Algorithms for Graph Problems., , and . ESA, volume 173 of LIPIcs, page 65:1-65:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Covering Many (Or Few) Edges with k Vertices in Sparse Graphs., , , and . STACS, volume 219 of LIPIcs, page 42:1-42:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)