Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos. Average-case complexity of a branch-and-bound algorithm for Min Dominating Set. Discrete Applied Mathematics, 345:4-8, March 2024. [doi]
Abstract is missing.