Author of the publication

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

Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large., , and . ESA, volume 274 of LIPIcs, page 65:1-65:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Deletion to Scattered Graph Classes I -- case of finite number of graph classes., , , and . CoRR, (2021)Structural Parameterizations of Dominating Set Variants., , , , and . CSR, volume 10846 of Lecture Notes in Computer Science, page 157-168. Springer, (2018)Parameterized Complexity of Conflict-Free Set Cover., , and . CSR, volume 11532 of Lecture Notes in Computer Science, page 191-202. Springer, (2019)Deletion to scattered graph classes I - Case of finite number of graph classes., , , and . J. Comput. Syst. Sci., (December 2023)Faster FPT Algorithms for Deletion to Pairs of Graph Classes., , and . FCT, volume 12867 of Lecture Notes in Computer Science, page 314-326. Springer, (2021)Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs., , , , and . CoRR, (2024)Fixed-Parameter Tractability of (n-k) List Coloring., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 61-69. Springer, (2019)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)Long Directed Detours: Reduction to 2-Disjoint Paths., , and . CoRR, (2023)