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.
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. Solving Connected Dominating Set Faster than 2::: ::::n:::: :::. Algorithmica, 52(2):153-166, 2008. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Solving Connected Dominating Set Faster Than 2:::::::n:::::::Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. fsttcs 2006: 152-163 [doi] Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 nIvan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger. algorithmica, 76(2):569-594, 2016. [doi] Computing Tree-Depth Faster Than 2 nFedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk. iwpec 2013: 137-149 [doi]
The following publications are possibly variants of this publication: