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

A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width., and . CoRR, (2023)Efficient parameterized algorithms on graphs with heterogeneous structure: Combining tree-depth and modular-width., and . CoRR, (2022)Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting., , and . Math. Program., 187 (1): 653-695 (2021)Tight Bounds for Connectivity Problems Parameterized by Cutwidth., , , and . CoRR, (2022)On Kernelization for Edge Dominating Set under Structural Parameters., and . STACS, volume 126 of LIPIcs, page 36:1-36:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Optimal Discretization is Fixed-parameter Tractable., , , , and . SODA, page 1702-1719. SIAM, (2021)Assessing the computational complexity of multilayer subgraph detection., , , , , and . Network Science, 7 (2): 215-241 (2019)Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack., , and . ESA, volume 144 of LIPIcs, page 53:1-53:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Polynomial Kernelizations for MIN F+Π1 and MAX NP.. Algorithmica, 63 (1-2): 532-550 (2012)The Minimum Feasible Tileset Problem., , and . Algorithmica, 81 (3): 1126-1151 (2019)