Author of the publication

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree.

, , and . CoRR, (2023)

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

Revisiting a Theorem by Folkman on Graph Colouring., , , , , , , and . Electron. J. Comb., 27 (1): 1 (2020)On digraphs without onion star immersions., , , and . CoRR, (2022)Sparse graphs without long induced paths., and . CoRR, (2023)Local certification of geometric graph classes., , , , and . CoRR, (2023)On Vizing's edge colouring question., , , , and . CoRR, (2021)Dualization in Lattices Given by Implicational Bases., and . ICFCA, volume 11511 of Lecture Notes in Computer Science, page 89-98. Springer, (2019)Enumerating Minimal Dominating Sets in Triangle-Free Graphs., , , and . STACS, volume 126 of LIPIcs, page 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the dualization in distributive lattices and related problems., , and . CoRR, (2019)Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs., and . ISAAC, volume 149 of LIPIcs, page 63:1-63:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the hardness of inclusion-wise minimal separators enumeration., , , , , and . Inf. Process. Lett., (March 2024)