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

On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph., , , , , and . Theor. Comput. Sci., (2018)Finding the Maximum Multi Improvement on neighborhood exploration., , , , and . Optim. Lett., 16 (1): 97-115 (2022)A multivariate analysis of the strict terminal connection problem., , and . J. Comput. Syst. Sci., (2020)Maximum Cuts in Edge-colored Graphs., , , , and . Electron. Notes Discret. Math., (2017)Partitions and well-coveredness: The graph sandwich problem., , , , , and . Discret. Math., 346 (3): 113253 (2023)Computing the Best Case Energy Complexity of Satisfying Assignments in Monotone Circuits., and . CoRR, (2022)Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number., , , , and . Discret. Appl. Math., (2018)Reducing Graph Transversals via Edge Contractions., , , and . MFCS, volume 170 of LIPIcs, page 64:1-64:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances., , and . MFCS, volume 202 of LIPIcs, page 42:1-42:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes., , , and . COCOA, volume 13135 of Lecture Notes in Computer Science, page 348-363. Springer, (2021)