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

Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . WG, volume 14093 of Lecture Notes in Computer Science, page 143-156. Springer, (2023)Balanced Crown Decomposition for Connectivity Constraints., , , , and . ESA, volume 204 of LIPIcs, page 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Giant Component of Geometric Inhomogeneous Random Graphs., , , , and . ESA, volume 274 of LIPIcs, page 20:1-20:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fixed Parameter Multi-Objective Evolutionary Algorithms for the W-Separator Problem., , , , , and . GECCO, page 1537-1545. ACM, (2023)Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs., , , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth., , , , and . STOC, page 1325-1334. ACM, (2023)Balanced Crown Decomposition for Connectivity Constraints., , , , and . CoRR, (2020)A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs., , , , and . APPROX/RANDOM, volume 245 of LIPIcs, page 55:1-55:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . CoRR, (2022)Analysis of a gray-box operator for vertex cover., , , , , and . GECCO, page 1363-1371. ACM, (2022)