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

Bounding the Mim-Width of Hereditary Graph Classes., , , , and . IPEC, volume 180 of LIPIcs, page 6:1-6:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On the price of independence for vertex cover, feedback vertex set and odd cycle transversal., , , , and . Eur. J. Comb., (March 2024)A Tight Subexponential-time Algorithm for Two-Page Book Embedding., , , , and . CoRR, (2024)Steiner Trees for Hereditary Graph Classes., , , , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 613-624. Springer, (2020)Explaining Decisions in ML Models: a Parameterized Complexity Analysis., , , and . CoRR, (2024)The Parameterized Complexity of Finding Concise Local Explanations., , and . IJCAI, page 3312-3320. ijcai.org, (2023)On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal., , , , and . MFCS, volume 117 of LIPIcs, page 63:1-63:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Tight Subexponential-Time Algorithm for Two-Page Book Embedding., , , , and . ICALP, volume 297 of LIPIcs, page 68:1-68:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Classifying Subset Feedback Vertex Set for H-Free Graphs., , and . WG, volume 13453 of Lecture Notes in Computer Science, page 412-424. Springer, (2022)On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest., , , and . FCT, volume 11651 of Lecture Notes in Computer Science, page 258-273. Springer, (2019)