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

Mixed Dominating Set: A Parameterized Perspective., , , and . WG, volume 10520 of Lecture Notes in Computer Science, page 330-343. Springer, (2017)Opinion Diffusion on Society Graphs Based on Approval Ballots., , and . AAMAS, page 2372-2374. International Foundation for Autonomous Agents and Multiagent Systems / ACM, (2024)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)An Erdős-Pósa Theorem on Neighborhoods and Domination Number., , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 437-444. Springer, (2019)A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut., , , and . GECCO (Companion), page 326-327. ACM, (2018)Parameterized Complexity Classification of Deletion to List Matrix-Partition for Low-Order Matrices., , , and . ISAAC, volume 149 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Complexity of Singly Connected Vertex Deletion., , , , , and . IWOCA, volume 12126 of Lecture Notes in Computer Science, page 237-250. Springer, (2020)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)The Complexity of Minimizing Envy in House Allocation., , and . AAMAS, page 2673-2675. ACM, (2023)