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

Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems., , , , and . SIAM J. Discret. Math., 37 (4): 2626-2669 (December 2023)A Polynomial Kernel for Bipartite Permutation Vertex Deletion., , , , , and . Algorithmica, 84 (11): 3246-3275 (2022)On the complexity of singly connected vertex deletion., , , , , and . Theor. Comput. Sci., (2022)On the Complexity of Singly Connected Vertex Deletion., , , , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 237-250. Springer, (2020)The Complexity of Minimizing Envy in House Allocation., , and . AAMAS, page 2673-2675. ACM, (2023)Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree., , and . Theory Comput. Syst., 64 (1): 62-100 (2020)Connecting the Dots (with Minimum Crossings)., , , , and . SoCG, volume 129 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Opinion Diffusion on Society Graphs Based on Approval Ballots., , and . AAMAS, page 2372-2374. ACM, (2024)Mixed Dominating Set: A Parameterized Perspective., , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 330-343. Springer, (2017)Max-Cut Above Spanning Tree is Fixed-Parameter Tractable., , and . CSR, volume 10846 of Lecture Notes in Computer Science, page 244-256. Springer, (2018)