Author of the publication

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.

, , , and . ACM Trans. Algorithms, 5 (1): 9:1-9:17 (2008)

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

Counting Minimum Weighted Dominating Sets., and . COCOON, volume 4598 of Lecture Notes in Computer Science, page 165-175. Springer, (2007)Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach., , , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 573-582. Springer, (2005)Principal Feature Visualisation in Convolutional Neural Networks., , , and . ECCV (23), volume 12368 of Lecture Notes in Computer Science, page 18-31. Springer, (2020)Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications., , , and . ACM Trans. Algorithms, 5 (1): 9:1-9:17 (2008)On maximum number of minimal dominating sets in graphs., , , and . Electron. Notes Discret. Math., (2005)On Two Techniques of Combining Branching and Treewidth., , , and . Algorithmica, 54 (2): 181-207 (2009)A Moderately Exponential Time Algorithm for Full Degree Spanning Tree., , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 479-489. Springer, (2008)