Author of the publication

p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms.

, , , , and . J. Comput. Syst. Sci., (May 2023)

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

On the Approximate Compressibility of Connected Vertex Cover., , and . CoRR, (2019)Valued Authorization Policy Existence Problem: Theory and Experiments., , , , and . ACM Trans. Priv. Secur., 25 (4): 28:1-28:32 (2022)On the Lossy Kernelization for Connected Treedepth Deletion Set., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 201-214. Springer, (2022)Generalized Noise Role Mining., , , , and . SACMAT, page 91-102. ACM, (2022)Valued Authorization Policy Existence Problem., , , , and . SACMAT, page 83-94. ACM, (2021)Valued Authorization Policy Existence Problem: Theory and Experiments., , , , and . CoRR, (2021)FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters., and . FAW, volume 10336 of Lecture Notes in Computer Science, page 209-220. Springer, (2017)Exact and Parameterized Algorithms for (k, i)-Coloring., , , and . CALDAM, volume 10156 of Lecture Notes in Computer Science, page 281-293. Springer, (2017)Parameterized Complexity of Deletion to Scattered Graph Classes., , and . IPEC, volume 180 of LIPIcs, page 18:1-18:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Kernelization of Cycle Packing with Relaxed Disjointness Constraints., , , , and . ICALP, volume 55 of LIPIcs, page 26:1-26:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)