Author of the publication

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.

, and . WG, volume 3787 of Lecture Notes in Computer Science, page 187-198. Springer, (2005)

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 2ℓk Kernel for ℓ-Component Order Connectivity., and . CoRR, (2016)Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time., and . WG, volume 3787 of Lecture Notes in Computer Science, page 187-198. Springer, (2005)Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints., , , , , and . CoRR, (2024)On the directed Full Degree Spanning Tree problem., , , and . Discret. Optim., 8 (1): 97-109 (2011)Exploiting Dense Structures in Parameterized Complexity., , , and . STACS, volume 187 of LIPIcs, page 50:1-50:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)