Author of the publication

Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time.

, , and . SWAT, volume 162 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

Solving Packing Problems with Few Small Items Using Rainbow Matchings., , , , , , and . MFCS, volume 170 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time., , and . SWAT, volume 162 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Offline Drawing of Dynamic Trees: Algorithmics and Document Integration., and . GD, volume 9801 of Lecture Notes in Computer Science, page 572-586. Springer, (2016)Towards Work-Efficient Parallel Parameterized Algorithms., , and . WALCOM, volume 11355 of Lecture Notes in Computer Science, page 341-353. Springer, (2019)On the Parallel Parameterized Complexity of MaxSAT Variants., , and . J. Artif. Intell. Res., (2023)On the Parallel Parameterized Complexity of MaxSAT Variants., , and . SAT, volume 236 of LIPIcs, page 19:1-19:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)MaxSAT with Absolute Value Functions: A Parameterized Perspective., , and . SWAT, volume 227 of LIPIcs, page 12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)